./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN --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 9201e7b46e737fc47a8de4643d1149fbe3bbd874a732a4c23bafe97925e39ff6 --- 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-6b4ec56 [2022-11-20 11:42:56,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:42:56,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:42:56,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:42:56,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:42:57,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:42:57,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:42:57,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:42:57,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:42:57,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:42:57,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:42:57,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:42:57,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:42:57,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:42:57,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:42:57,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:42:57,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:42:57,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:42:57,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:42:57,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:42:57,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:42:57,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:42:57,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:42:57,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:42:57,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:42:57,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:42:57,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:42:57,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:42:57,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:42:57,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:42:57,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:42:57,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:42:57,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:42:57,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:42:57,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:42:57,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:42:57,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:42:57,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:42:57,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:42:57,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:42:57,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:42:57,054 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-20 11:42:57,092 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:42:57,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:42:57,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:42:57,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:42:57,099 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:42:57,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:42:57,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:42:57,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:42:57,100 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:42:57,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:42:57,102 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:42:57,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:42:57,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:42:57,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:42:57,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:42:57,103 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:42:57,103 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 11:42:57,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:42:57,104 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:42:57,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:42:57,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:42:57,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:42:57,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:42:57,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:42:57,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:42:57,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:42:57,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:42:57,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:42:57,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:42:57,107 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:42:57,107 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:42:57,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:42:57,107 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_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN/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_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN 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 -> 9201e7b46e737fc47a8de4643d1149fbe3bbd874a732a4c23bafe97925e39ff6 [2022-11-20 11:42:57,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:42:57,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:42:57,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:42:57,498 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:42:57,499 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:42:57,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_15_good.i [2022-11-20 11:43:00,749 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:43:01,100 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:43:01,101 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_15_good.i [2022-11-20 11:43:01,122 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN/data/3704cdfc1/e3db06e7672f4d3a94a100c6e921aed2/FLAG9a10751b4 [2022-11-20 11:43:01,155 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN/data/3704cdfc1/e3db06e7672f4d3a94a100c6e921aed2 [2022-11-20 11:43:01,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:43:01,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:43:01,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:43:01,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:43:01,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:43:01,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:43:01" (1/1) ... [2022-11-20 11:43:01,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3945aa61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:01, skipping insertion in model container [2022-11-20 11:43:01,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:43:01" (1/1) ... [2022-11-20 11:43:01,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:43:01,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:43:01,692 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-20 11:43:02,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:43:02,303 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:43:02,322 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-20 11:43:02,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:43:02,483 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:43:02,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:02 WrapperNode [2022-11-20 11:43:02,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:43:02,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:43:02,485 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:43:02,485 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:43:02,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:02" (1/1) ... [2022-11-20 11:43:02,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:02" (1/1) ... [2022-11-20 11:43:02,558 INFO L138 Inliner]: procedures = 503, calls = 81, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 193 [2022-11-20 11:43:02,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:43:02,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:43:02,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:43:02,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:43:02,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:02" (1/1) ... [2022-11-20 11:43:02,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:02" (1/1) ... [2022-11-20 11:43:02,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:02" (1/1) ... [2022-11-20 11:43:02,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:02" (1/1) ... [2022-11-20 11:43:02,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:02" (1/1) ... [2022-11-20 11:43:02,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:02" (1/1) ... [2022-11-20 11:43:02,587 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:02" (1/1) ... [2022-11-20 11:43:02,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:02" (1/1) ... [2022-11-20 11:43:02,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:43:02,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:43:02,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:43:02,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:43:02,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:02" (1/1) ... [2022-11-20 11:43:02,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:43:02,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:43:02,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:43:02,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:43:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-20 11:43:02,686 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-20 11:43:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-20 11:43:02,686 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-20 11:43:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:43:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:43:02,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:43:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-20 11:43:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:43:02,859 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:43:02,861 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:43:03,185 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:43:03,192 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:43:03,193 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 11:43:03,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:43:03 BoogieIcfgContainer [2022-11-20 11:43:03,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:43:03,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:43:03,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:43:03,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:43:03,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:43:01" (1/3) ... [2022-11-20 11:43:03,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22704b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:43:03, skipping insertion in model container [2022-11-20 11:43:03,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:43:02" (2/3) ... [2022-11-20 11:43:03,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22704b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:43:03, skipping insertion in model container [2022-11-20 11:43:03,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:43:03" (3/3) ... [2022-11-20 11:43:03,205 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_postdec_15_good.i [2022-11-20 11:43:03,227 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:43:03,227 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-20 11:43:03,291 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:43:03,299 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;@6998aa21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:43:03,300 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-20 11:43:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.537037037037037) internal successors, (83), 76 states have internal predecessors, (83), 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-20 11:43:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 11:43:03,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:03,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:43:03,318 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-20 11:43:03,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:03,325 INFO L85 PathProgramCache]: Analyzing trace with hash 998974264, now seen corresponding path program 1 times [2022-11-20 11:43:03,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:03,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492176934] [2022-11-20 11:43:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:03,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:03,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:03,634 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-20 11:43:03,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:03,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492176934] [2022-11-20 11:43:03,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492176934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:03,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:03,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:43:03,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271786655] [2022-11-20 11:43:03,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:03,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:43:03,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:03,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:43:03,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:43:03,681 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.537037037037037) internal successors, (83), 76 states have internal predecessors, (83), 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 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-20 11:43:03,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:03,733 INFO L93 Difference]: Finished difference Result 153 states and 216 transitions. [2022-11-20 11:43:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:43:03,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-20 11:43:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:03,748 INFO L225 Difference]: With dead ends: 153 [2022-11-20 11:43:03,748 INFO L226 Difference]: Without dead ends: 68 [2022-11-20 11:43:03,753 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-20 11:43:03,757 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:43:03,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 213 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-20 11:43:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-20 11:43:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 64 states have internal predecessors, (70), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-20 11:43:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2022-11-20 11:43:03,811 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 15 [2022-11-20 11:43:03,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:03,812 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2022-11-20 11:43:03,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-20 11:43:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2022-11-20 11:43:03,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:43:03,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:03,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:43:03,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:43:03,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 11:43:03,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:03,817 INFO L85 PathProgramCache]: Analyzing trace with hash 45972825, now seen corresponding path program 1 times [2022-11-20 11:43:03,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:03,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107817536] [2022-11-20 11:43:03,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:03,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:04,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:04,148 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-20 11:43:04,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:04,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107817536] [2022-11-20 11:43:04,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107817536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:04,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:04,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:43:04,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905860294] [2022-11-20 11:43:04,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:04,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:43:04,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:04,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:43:04,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:43:04,164 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 11:43:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:04,227 INFO L93 Difference]: Finished difference Result 68 states and 94 transitions. [2022-11-20 11:43:04,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:43:04,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-20 11:43:04,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:04,230 INFO L225 Difference]: With dead ends: 68 [2022-11-20 11:43:04,233 INFO L226 Difference]: Without dead ends: 67 [2022-11-20 11:43:04,233 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-20 11:43:04,235 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 57 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:43:04,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 196 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:04,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-20 11:43:04,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-20 11:43:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.5) internal successors, (69), 63 states have internal predecessors, (69), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-20 11:43:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2022-11-20 11:43:04,252 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 16 [2022-11-20 11:43:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:04,252 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2022-11-20 11:43:04,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 11:43:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-11-20 11:43:04,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 11:43:04,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:04,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:43:04,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:43:04,254 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 11:43:04,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:04,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1425157655, now seen corresponding path program 1 times [2022-11-20 11:43:04,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:04,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235260771] [2022-11-20 11:43:04,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:04,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:04,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:04,413 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-20 11:43:04,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:04,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235260771] [2022-11-20 11:43:04,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235260771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:04,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:04,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:43:04,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844544728] [2022-11-20 11:43:04,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:04,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:43:04,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:04,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:43:04,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:43:04,421 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-20 11:43:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:04,454 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-11-20 11:43:04,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:43:04,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2022-11-20 11:43:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:04,466 INFO L225 Difference]: With dead ends: 67 [2022-11-20 11:43:04,466 INFO L226 Difference]: Without dead ends: 66 [2022-11-20 11:43:04,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:43:04,470 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 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-20 11:43:04,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-20 11:43:04,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-20 11:43:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 62 states have internal predecessors, (68), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-20 11:43:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2022-11-20 11:43:04,482 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 17 [2022-11-20 11:43:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:04,482 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2022-11-20 11:43:04,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-20 11:43:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2022-11-20 11:43:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:43:04,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:04,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:43:04,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:43:04,485 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-20 11:43:04,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:04,487 INFO L85 PathProgramCache]: Analyzing trace with hash -674493454, now seen corresponding path program 1 times [2022-11-20 11:43:04,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:04,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211202467] [2022-11-20 11:43:04,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:04,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:04,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:04,578 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-20 11:43:04,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:04,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211202467] [2022-11-20 11:43:04,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211202467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:04,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:04,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:43:04,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125487916] [2022-11-20 11:43:04,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:04,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:43:04,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:04,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:43:04,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:43:04,584 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 11:43:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:04,626 INFO L93 Difference]: Finished difference Result 116 states and 160 transitions. [2022-11-20 11:43:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:43:04,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-20 11:43:04,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:04,628 INFO L225 Difference]: With dead ends: 116 [2022-11-20 11:43:04,628 INFO L226 Difference]: Without dead ends: 66 [2022-11-20 11:43:04,629 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-20 11:43:04,630 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 168 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-20 11:43:04,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 168 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-20 11:43:04,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-20 11:43:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 61 states have internal predecessors, (67), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-20 11:43:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2022-11-20 11:43:04,642 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 22 [2022-11-20 11:43:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:04,642 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2022-11-20 11:43:04,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 11:43:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2022-11-20 11:43:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:43:04,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:04,644 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-20 11:43:04,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:43:04,644 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-20 11:43:04,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:04,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1904871187, now seen corresponding path program 1 times [2022-11-20 11:43:04,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:04,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371864126] [2022-11-20 11:43:04,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:04,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:04,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:04,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:43:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:04,713 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-20 11:43:04,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:04,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371864126] [2022-11-20 11:43:04,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371864126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:04,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:04,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:43:04,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155411571] [2022-11-20 11:43:04,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:04,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:43:04,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:04,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:43:04,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:43:04,720 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-20 11:43:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:04,757 INFO L93 Difference]: Finished difference Result 116 states and 159 transitions. [2022-11-20 11:43:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:43:04,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 26 [2022-11-20 11:43:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:04,764 INFO L225 Difference]: With dead ends: 116 [2022-11-20 11:43:04,764 INFO L226 Difference]: Without dead ends: 65 [2022-11-20 11:43:04,765 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-20 11:43:04,766 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 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-20 11:43:04,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-20 11:43:04,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-20 11:43:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.434782608695652) internal successors, (66), 60 states have internal predecessors, (66), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 11:43:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2022-11-20 11:43:04,783 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 26 [2022-11-20 11:43:04,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:04,784 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2022-11-20 11:43:04,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-20 11:43:04,785 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2022-11-20 11:43:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 11:43:04,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:04,789 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:43:04,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:43:04,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 11:43:04,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:04,791 INFO L85 PathProgramCache]: Analyzing trace with hash 902429544, now seen corresponding path program 1 times [2022-11-20 11:43:04,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:04,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365651008] [2022-11-20 11:43:04,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:04,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:04,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:04,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:43:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:04,888 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-20 11:43:04,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:04,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365651008] [2022-11-20 11:43:04,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365651008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:04,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:04,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:43:04,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650176286] [2022-11-20 11:43:04,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:04,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:43:04,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:04,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:43:04,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:43:04,892 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-20 11:43:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:04,908 INFO L93 Difference]: Finished difference Result 108 states and 145 transitions. [2022-11-20 11:43:04,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:43:04,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 28 [2022-11-20 11:43:04,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:04,912 INFO L225 Difference]: With dead ends: 108 [2022-11-20 11:43:04,912 INFO L226 Difference]: Without dead ends: 63 [2022-11-20 11:43:04,913 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-20 11:43:04,916 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:43:04,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 159 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-20 11:43:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-20 11:43:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.4) internal successors, (63), 58 states have internal predecessors, (63), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-20 11:43:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2022-11-20 11:43:04,935 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 28 [2022-11-20 11:43:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:04,936 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2022-11-20 11:43:04,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-20 11:43:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2022-11-20 11:43:04,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:43:04,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:04,937 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] [2022-11-20 11:43:04,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:43:04,938 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 11:43:04,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:04,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1839930966, now seen corresponding path program 1 times [2022-11-20 11:43:04,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:04,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404265467] [2022-11-20 11:43:04,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:04,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:43:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,156 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-20 11:43:05,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:05,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404265467] [2022-11-20 11:43:05,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404265467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:05,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:05,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:43:05,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152145179] [2022-11-20 11:43:05,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:05,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:43:05,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:05,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:43:05,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:43:05,159 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-20 11:43:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:05,199 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-11-20 11:43:05,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:43:05,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 29 [2022-11-20 11:43:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:05,203 INFO L225 Difference]: With dead ends: 63 [2022-11-20 11:43:05,203 INFO L226 Difference]: Without dead ends: 62 [2022-11-20 11:43:05,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-20 11:43:05,208 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 38 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:43:05,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 187 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-20 11:43:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-20 11:43:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 57 states have internal predecessors, (62), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-20 11:43:05,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2022-11-20 11:43:05,224 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 29 [2022-11-20 11:43:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:05,226 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2022-11-20 11:43:05,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-20 11:43:05,226 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2022-11-20 11:43:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 11:43:05,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:05,231 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] [2022-11-20 11:43:05,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:43:05,231 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 11:43:05,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:05,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1203284977, now seen corresponding path program 1 times [2022-11-20 11:43:05,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:05,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789929733] [2022-11-20 11:43:05,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:05,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:43:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,411 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-20 11:43:05,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:05,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789929733] [2022-11-20 11:43:05,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789929733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:05,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:05,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:43:05,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365897168] [2022-11-20 11:43:05,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:05,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:43:05,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:05,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:43:05,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:43:05,422 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-20 11:43:05,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:05,437 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-11-20 11:43:05,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:43:05,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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 30 [2022-11-20 11:43:05,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:05,439 INFO L225 Difference]: With dead ends: 62 [2022-11-20 11:43:05,439 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 11:43:05,440 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-20 11:43:05,441 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 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-20 11:43:05,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:05,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 11:43:05,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-20 11:43:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 56 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-20 11:43:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-11-20 11:43:05,460 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 30 [2022-11-20 11:43:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:05,461 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-11-20 11:43:05,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-20 11:43:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-11-20 11:43:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 11:43:05,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:05,462 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, 1, 1, 1, 1] [2022-11-20 11:43:05,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:43:05,463 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-20 11:43:05,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:05,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1995870532, now seen corresponding path program 1 times [2022-11-20 11:43:05,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:05,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127405228] [2022-11-20 11:43:05,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:05,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:43:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,561 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-20 11:43:05,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:05,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127405228] [2022-11-20 11:43:05,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127405228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:05,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:05,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:43:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064181860] [2022-11-20 11:43:05,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:05,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:43:05,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:05,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:43:05,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:43:05,565 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-20 11:43:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:05,582 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2022-11-20 11:43:05,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:43:05,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 35 [2022-11-20 11:43:05,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:05,585 INFO L225 Difference]: With dead ends: 93 [2022-11-20 11:43:05,585 INFO L226 Difference]: Without dead ends: 59 [2022-11-20 11:43:05,589 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-20 11:43:05,593 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 5 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 141 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-20 11:43:05,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 141 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-20 11:43:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-20 11:43:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 53 states have internal predecessors, (58), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-20 11:43:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2022-11-20 11:43:05,602 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 35 [2022-11-20 11:43:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:05,602 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2022-11-20 11:43:05,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-20 11:43:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-11-20 11:43:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 11:43:05,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:05,605 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:43:05,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:43:05,605 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 11:43:05,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:05,606 INFO L85 PathProgramCache]: Analyzing trace with hash -182219195, now seen corresponding path program 1 times [2022-11-20 11:43:05,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:05,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642796069] [2022-11-20 11:43:05,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:05,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:43:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 11:43:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,725 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-20 11:43:05,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:05,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642796069] [2022-11-20 11:43:05,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642796069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:05,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:05,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:43:05,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682403892] [2022-11-20 11:43:05,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:05,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:43:05,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:05,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:43:05,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:43:05,729 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-20 11:43:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:05,771 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2022-11-20 11:43:05,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:43:05,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 40 [2022-11-20 11:43:05,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:05,775 INFO L225 Difference]: With dead ends: 79 [2022-11-20 11:43:05,775 INFO L226 Difference]: Without dead ends: 78 [2022-11-20 11:43:05,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-20 11:43:05,776 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 19 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:43:05,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 220 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-20 11:43:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2022-11-20 11:43:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 56 states have internal predecessors, (62), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-20 11:43:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2022-11-20 11:43:05,790 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 40 [2022-11-20 11:43:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:05,790 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2022-11-20 11:43:05,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-20 11:43:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2022-11-20 11:43:05,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 11:43:05,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:05,794 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:43:05,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 11:43:05,795 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-20 11:43:05,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:05,797 INFO L85 PathProgramCache]: Analyzing trace with hash -182159613, now seen corresponding path program 1 times [2022-11-20 11:43:05,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:05,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340260336] [2022-11-20 11:43:05,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:05,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:43:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 11:43:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:05,877 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-20 11:43:05,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:05,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340260336] [2022-11-20 11:43:05,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340260336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:05,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:05,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:43:05,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317910797] [2022-11-20 11:43:05,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:05,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:43:05,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:05,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:43:05,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:43:05,880 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-20 11:43:05,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:05,894 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2022-11-20 11:43:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:43:05,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 40 [2022-11-20 11:43:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:05,896 INFO L225 Difference]: With dead ends: 89 [2022-11-20 11:43:05,896 INFO L226 Difference]: Without dead ends: 62 [2022-11-20 11:43:05,897 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-20 11:43:05,898 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 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-20 11:43:05,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-20 11:43:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-20 11:43:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.297872340425532) internal successors, (61), 55 states have internal predecessors, (61), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-20 11:43:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-11-20 11:43:05,910 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 40 [2022-11-20 11:43:05,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:05,910 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-11-20 11:43:05,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-20 11:43:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-11-20 11:43:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 11:43:05,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:05,912 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:43:05,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:43:05,913 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 11:43:05,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:05,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1353827591, now seen corresponding path program 1 times [2022-11-20 11:43:05,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:05,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608618146] [2022-11-20 11:43:05,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:05,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:43:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 11:43:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,027 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-20 11:43:06,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:06,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608618146] [2022-11-20 11:43:06,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608618146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:06,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:06,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:43:06,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904254615] [2022-11-20 11:43:06,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:06,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:43:06,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:06,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:43:06,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:43:06,030 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-20 11:43:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:06,052 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-11-20 11:43:06,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:43:06,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 41 [2022-11-20 11:43:06,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:06,054 INFO L225 Difference]: With dead ends: 73 [2022-11-20 11:43:06,054 INFO L226 Difference]: Without dead ends: 72 [2022-11-20 11:43:06,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-20 11:43:06,055 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 20 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 201 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-20 11:43:06,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 201 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-20 11:43:06,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2022-11-20 11:43:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 states have internal predecessors, (60), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-20 11:43:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2022-11-20 11:43:06,069 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 41 [2022-11-20 11:43:06,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:06,070 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-11-20 11:43:06,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-20 11:43:06,070 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2022-11-20 11:43:06,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 11:43:06,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:06,072 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, 1, 1, 1, 1] [2022-11-20 11:43:06,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:43:06,072 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 11:43:06,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:06,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1673585398, now seen corresponding path program 1 times [2022-11-20 11:43:06,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:06,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700978264] [2022-11-20 11:43:06,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:06,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:43:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 11:43:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 11:43:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,150 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-20 11:43:06,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:06,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700978264] [2022-11-20 11:43:06,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700978264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:06,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:06,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:43:06,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238195839] [2022-11-20 11:43:06,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:06,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:43:06,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:06,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:43:06,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:43:06,152 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-20 11:43:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:06,164 INFO L93 Difference]: Finished difference Result 83 states and 104 transitions. [2022-11-20 11:43:06,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:43:06,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 44 [2022-11-20 11:43:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:06,166 INFO L225 Difference]: With dead ends: 83 [2022-11-20 11:43:06,166 INFO L226 Difference]: Without dead ends: 56 [2022-11-20 11:43:06,166 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-20 11:43:06,167 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 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-20 11:43:06,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:06,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-20 11:43:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-20 11:43:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 50 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-20 11:43:06,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-11-20 11:43:06,174 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 44 [2022-11-20 11:43:06,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:06,175 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-11-20 11:43:06,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-20 11:43:06,176 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-11-20 11:43:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 11:43:06,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:06,178 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] [2022-11-20 11:43:06,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:43:06,178 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 11:43:06,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:06,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1929747657, now seen corresponding path program 1 times [2022-11-20 11:43:06,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:06,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350020134] [2022-11-20 11:43:06,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:06,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:43:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 11:43:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,268 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-20 11:43:06,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:06,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350020134] [2022-11-20 11:43:06,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350020134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:06,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:06,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:43:06,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797227557] [2022-11-20 11:43:06,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:06,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:43:06,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:06,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:43:06,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:43:06,272 INFO L87 Difference]: Start difference. First operand 56 states and 70 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, (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-20 11:43:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:06,282 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-11-20 11:43:06,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:43:06,283 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, (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 46 [2022-11-20 11:43:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:06,284 INFO L225 Difference]: With dead ends: 71 [2022-11-20 11:43:06,284 INFO L226 Difference]: Without dead ends: 54 [2022-11-20 11:43:06,284 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-20 11:43:06,285 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 122 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-20 11:43:06,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 122 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-20 11:43:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-20 11:43:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.186046511627907) internal successors, (51), 47 states have internal predecessors, (51), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-20 11:43:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-11-20 11:43:06,291 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 46 [2022-11-20 11:43:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:06,292 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-11-20 11:43:06,292 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, (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-20 11:43:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-11-20 11:43:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 11:43:06,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:06,293 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, 1, 1, 1] [2022-11-20 11:43:06,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:43:06,293 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-20 11:43:06,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:06,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1871777561, now seen corresponding path program 1 times [2022-11-20 11:43:06,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:06,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079252737] [2022-11-20 11:43:06,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:06,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:43:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 11:43:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:43:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,406 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-20 11:43:06,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:06,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079252737] [2022-11-20 11:43:06,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079252737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:06,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:06,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:43:06,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883337478] [2022-11-20 11:43:06,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:06,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:43:06,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:06,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:43:06,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:43:06,409 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-20 11:43:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:06,432 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-11-20 11:43:06,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:43:06,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 51 [2022-11-20 11:43:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:06,433 INFO L225 Difference]: With dead ends: 60 [2022-11-20 11:43:06,433 INFO L226 Difference]: Without dead ends: 59 [2022-11-20 11:43:06,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-20 11:43:06,436 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:43:06,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-20 11:43:06,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2022-11-20 11:43:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.173913043478261) internal successors, (54), 50 states have internal predecessors, (54), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-20 11:43:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2022-11-20 11:43:06,441 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 51 [2022-11-20 11:43:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:06,442 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2022-11-20 11:43:06,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-20 11:43:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-11-20 11:43:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 11:43:06,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:06,443 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, 1, 1, 1, 1] [2022-11-20 11:43:06,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:43:06,443 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 11:43:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:06,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2104437944, now seen corresponding path program 1 times [2022-11-20 11:43:06,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:06,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880128554] [2022-11-20 11:43:06,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:06,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:43:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 11:43:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:43:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,555 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-20 11:43:06,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:06,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880128554] [2022-11-20 11:43:06,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880128554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:06,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:06,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:43:06,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667433159] [2022-11-20 11:43:06,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:06,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:43:06,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:06,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:43:06,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:43:06,560 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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-20 11:43:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:06,577 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-11-20 11:43:06,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:43:06,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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 52 [2022-11-20 11:43:06,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:06,578 INFO L225 Difference]: With dead ends: 57 [2022-11-20 11:43:06,579 INFO L226 Difference]: Without dead ends: 52 [2022-11-20 11:43:06,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-20 11:43:06,579 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 175 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-20 11:43:06,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 175 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:06,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-20 11:43:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-20 11:43:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 45 states have internal predecessors, (48), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-20 11:43:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-11-20 11:43:06,586 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 52 [2022-11-20 11:43:06,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:06,587 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-11-20 11:43:06,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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-20 11:43:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-11-20 11:43:06,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 11:43:06,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:43:06,588 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, 1, 1, 1, 1] [2022-11-20 11:43:06,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 11:43:06,589 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 11:43:06,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:43:06,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2106222457, now seen corresponding path program 1 times [2022-11-20 11:43:06,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:43:06,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224570574] [2022-11-20 11:43:06,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:43:06,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:43:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:43:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:43:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 11:43:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 11:43:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:43:06,698 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-20 11:43:06,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:43:06,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224570574] [2022-11-20 11:43:06,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224570574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:43:06,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:43:06,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:43:06,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579954921] [2022-11-20 11:43:06,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:43:06,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:43:06,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:43:06,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:43:06,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:43:06,700 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-20 11:43:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:43:06,708 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-11-20 11:43:06,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:43:06,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 52 [2022-11-20 11:43:06,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:43:06,709 INFO L225 Difference]: With dead ends: 56 [2022-11-20 11:43:06,709 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 11:43:06,710 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-20 11:43:06,711 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 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-20 11:43:06,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:43:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 11:43:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 11:43:06,712 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-20 11:43:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 11:43:06,712 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-11-20 11:43:06,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:43:06,713 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 11:43:06,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-20 11:43:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 11:43:06,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 11:43:06,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-20 11:43:06,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-20 11:43:06,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-20 11:43:06,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-20 11:43:06,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-20 11:43:06,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-20 11:43:06,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-20 11:43:06,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-20 11:43:06,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 11:43:06,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 11:43:06,914 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-20 11:43:06,915 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-20 11:43:06,915 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-20 11:43:06,915 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-20 11:43:06,915 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-20 11:43:06,915 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-20 11:43:06,916 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-20 11:43:06,916 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1598) no Hoare annotation was computed. [2022-11-20 11:43:06,916 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-11-20 11:43:06,916 INFO L899 garLoopResultBuilder]: For program point L1629(line 1629) no Hoare annotation was computed. [2022-11-20 11:43:06,916 INFO L899 garLoopResultBuilder]: For program point L1596(lines 1596 1605) no Hoare annotation was computed. [2022-11-20 11:43:06,916 INFO L899 garLoopResultBuilder]: For program point L1629-1(line 1629) no Hoare annotation was computed. [2022-11-20 11:43:06,917 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-11-20 11:43:06,917 INFO L899 garLoopResultBuilder]: For program point L1654(line 1654) no Hoare annotation was computed. [2022-11-20 11:43:06,917 INFO L899 garLoopResultBuilder]: For program point L1621(line 1621) no Hoare annotation was computed. [2022-11-20 11:43:06,917 INFO L899 garLoopResultBuilder]: For program point L1555(line 1555) no Hoare annotation was computed. [2022-11-20 11:43:06,917 INFO L899 garLoopResultBuilder]: For program point L1555-2(line 1555) no Hoare annotation was computed. [2022-11-20 11:43:06,917 INFO L902 garLoopResultBuilder]: At program point L1679(lines 1673 1680) the Hoare annotation is: true [2022-11-20 11:43:06,917 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1611) no Hoare annotation was computed. [2022-11-20 11:43:06,918 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-20 11:43:06,918 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-20 11:43:06,918 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 11:43:06,918 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 11:43:06,919 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2022-11-20 11:43:06,919 INFO L899 garLoopResultBuilder]: For program point L1589(line 1589) no Hoare annotation was computed. [2022-11-20 11:43:06,919 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1579) no Hoare annotation was computed. [2022-11-20 11:43:06,919 INFO L899 garLoopResultBuilder]: For program point L1639(lines 1639 1665) no Hoare annotation was computed. [2022-11-20 11:43:06,920 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-20 11:43:06,920 INFO L895 garLoopResultBuilder]: At program point L1631(line 1631) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch115#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-20 11:43:06,920 INFO L899 garLoopResultBuilder]: For program point L1598(line 1598) no Hoare annotation was computed. [2022-11-20 11:43:06,921 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2022-11-20 11:43:06,921 INFO L899 garLoopResultBuilder]: For program point L1656(line 1656) no Hoare annotation was computed. [2022-11-20 11:43:06,921 INFO L899 garLoopResultBuilder]: For program point L1656-1(line 1656) no Hoare annotation was computed. [2022-11-20 11:43:06,921 INFO L895 garLoopResultBuilder]: At program point L1590(line 1590) the Hoare annotation is: false [2022-11-20 11:43:06,921 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-11-20 11:43:06,921 INFO L899 garLoopResultBuilder]: For program point L1648(line 1648) no Hoare annotation was computed. [2022-11-20 11:43:06,922 INFO L899 garLoopResultBuilder]: For program point L1607(line 1607) no Hoare annotation was computed. [2022-11-20 11:43:06,923 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-20 11:43:06,923 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2022-11-20 11:43:06,923 INFO L895 garLoopResultBuilder]: At program point L1649(line 1649) the Hoare annotation is: false [2022-11-20 11:43:06,923 INFO L895 garLoopResultBuilder]: At program point L1616(lines 1616 1624) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (and (<= .cse0 0) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch114#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (<= 0 .cse0))) [2022-11-20 11:43:06,923 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) the Hoare annotation is: false [2022-11-20 11:43:06,923 INFO L895 garLoopResultBuilder]: At program point L1575(line 1575) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch101#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) [2022-11-20 11:43:06,924 INFO L899 garLoopResultBuilder]: For program point L1666(lines 1666 1672) no Hoare annotation was computed. [2022-11-20 11:43:06,924 INFO L895 garLoopResultBuilder]: At program point L1600(line 1600) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch112#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-20 11:43:06,924 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1576) no Hoare annotation was computed. [2022-11-20 11:43:06,924 INFO L902 garLoopResultBuilder]: At program point L1658(line 1658) the Hoare annotation is: true [2022-11-20 11:43:06,924 INFO L895 garLoopResultBuilder]: At program point L1625(lines 1625 1637) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch115#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-20 11:43:06,924 INFO L895 garLoopResultBuilder]: At program point L1584(lines 1584 1592) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch103#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-20 11:43:06,924 INFO L899 garLoopResultBuilder]: For program point L1634(line 1634) no Hoare annotation was computed. [2022-11-20 11:43:06,925 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 11:43:06,925 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-20 11:43:06,925 INFO L895 garLoopResultBuilder]: At program point L1593(lines 1593 1610) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch112#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-20 11:43:06,925 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2022-11-20 11:43:06,925 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch92#1|) [2022-11-20 11:43:06,925 INFO L902 garLoopResultBuilder]: At program point L1676(line 1676) the Hoare annotation is: true [2022-11-20 11:43:06,926 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2022-11-20 11:43:06,926 INFO L895 garLoopResultBuilder]: At program point L1643(lines 1643 1651) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2))) (and (<= 0 .cse0) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (<= .cse0 0))) [2022-11-20 11:43:06,926 INFO L895 garLoopResultBuilder]: At program point L1635(line 1635) the Hoare annotation is: false [2022-11-20 11:43:06,926 INFO L899 garLoopResultBuilder]: For program point L1569(line 1569) no Hoare annotation was computed. [2022-11-20 11:43:06,926 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 11:43:06,926 INFO L899 garLoopResultBuilder]: For program point L1569-1(line 1569) no Hoare annotation was computed. [2022-11-20 11:43:06,926 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-20 11:43:06,927 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2022-11-20 11:43:06,927 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1578) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch101#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) [2022-11-20 11:43:06,927 INFO L902 garLoopResultBuilder]: At program point L1652(lines 1652 1664) the Hoare annotation is: true [2022-11-20 11:43:06,927 INFO L895 garLoopResultBuilder]: At program point L1619(line 1619) the Hoare annotation is: false [2022-11-20 11:43:06,927 INFO L899 garLoopResultBuilder]: For program point L1586(line 1586) no Hoare annotation was computed. [2022-11-20 11:43:06,927 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1598) no Hoare annotation was computed. [2022-11-20 11:43:06,928 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-11-20 11:43:06,928 INFO L899 garLoopResultBuilder]: For program point L1595(line 1595) no Hoare annotation was computed. [2022-11-20 11:43:06,928 INFO L899 garLoopResultBuilder]: For program point L1587(line 1587) no Hoare annotation was computed. [2022-11-20 11:43:06,928 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-20 11:43:06,929 INFO L899 garLoopResultBuilder]: For program point L1587-2(line 1587) no Hoare annotation was computed. [2022-11-20 11:43:06,929 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-11-20 11:43:06,929 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-20 11:43:06,929 INFO L899 garLoopResultBuilder]: For program point L1678-1(line 1678) no Hoare annotation was computed. [2022-11-20 11:43:06,929 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1638) no Hoare annotation was computed. [2022-11-20 11:43:06,929 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-20 11:43:06,929 INFO L895 garLoopResultBuilder]: At program point L1604(line 1604) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch112#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-20 11:43:06,930 INFO L895 garLoopResultBuilder]: At program point L1571(line 1571) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch101#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) [2022-11-20 11:43:06,933 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:43:06,938 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:43:06,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:43:06 BoogieIcfgContainer [2022-11-20 11:43:06,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:43:06,959 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:43:06,959 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:43:06,960 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:43:06,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:43:03" (3/4) ... [2022-11-20 11:43:06,963 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 11:43:06,970 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-20 11:43:06,971 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-20 11:43:06,977 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-20 11:43:06,977 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-20 11:43:06,978 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 11:43:06,978 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 11:43:06,978 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 11:43:07,028 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 11:43:07,028 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:43:07,029 INFO L158 Benchmark]: Toolchain (without parser) took 5867.45ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 130.5MB in the beginning and 130.0MB in the end (delta: 545.6kB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2022-11-20 11:43:07,029 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 125.8MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:43:07,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1319.93ms. Allocated memory is still 159.4MB. Free memory was 129.8MB in the beginning and 82.1MB in the end (delta: 47.7MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2022-11-20 11:43:07,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.26ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 77.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 11:43:07,031 INFO L158 Benchmark]: Boogie Preprocessor took 33.30ms. Allocated memory is still 159.4MB. Free memory was 77.9MB in the beginning and 75.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:43:07,031 INFO L158 Benchmark]: RCFGBuilder took 602.31ms. Allocated memory is still 159.4MB. Free memory was 75.8MB in the beginning and 116.1MB in the end (delta: -40.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2022-11-20 11:43:07,031 INFO L158 Benchmark]: TraceAbstraction took 3760.96ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 116.1MB in the beginning and 135.2MB in the end (delta: -19.1MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2022-11-20 11:43:07,032 INFO L158 Benchmark]: Witness Printer took 69.43ms. Allocated memory is still 192.9MB. Free memory was 135.2MB in the beginning and 130.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 11:43:07,033 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.34ms. Allocated memory is still 125.8MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1319.93ms. Allocated memory is still 159.4MB. Free memory was 129.8MB in the beginning and 82.1MB in the end (delta: 47.7MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.26ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 77.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.30ms. Allocated memory is still 159.4MB. Free memory was 77.9MB in the beginning and 75.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 602.31ms. Allocated memory is still 159.4MB. Free memory was 75.8MB in the beginning and 116.1MB in the end (delta: -40.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3760.96ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 116.1MB in the beginning and 135.2MB in the end (delta: -19.1MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Witness Printer took 69.43ms. Allocated memory is still 192.9MB. Free memory was 135.2MB in the beginning and 130.0MB 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: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 2855 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1548 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 1307 mSDtfsCounter, 82 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 59, 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, 17 MinimizatonAttempts, 29 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 89 PreInvPairs, 106 NumberOfFragments, 118 HoareAnnotationTreeSize, 89 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 584 NumberOfCodeBlocks, 584 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 567 ConstructedInterpolants, 0 QuantifiedInterpolants, 659 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 128/128 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: 1616]: Loop Invariant Derived loop invariant: (((2 + data <= 0 && data <= 2147483647) && aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = -2; break; }-aux) && data <= 2147483647) && 0 <= 2 + data - InvariantResult [Line: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1673]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1561]: Loop Invariant Derived loop invariant: aux-switch(8) { case 7: printLine("Benign, fixed string"); break; default: if (data > (-0x7fffffff - 1)) { data--; int result = data; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; }-aux && data <= 2147483647 - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: data <= 2147483647 && aux-switch(6) { case 6: data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)); break; default: printLine("Benign, fixed string"); break; }-aux - InvariantResult [Line: 1593]: Loop Invariant Derived loop invariant: (aux-switch(7) { case 7: if (data > (-0x7fffffff - 1)) { data--; int result = data; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; default: printLine("Benign, fixed string"); break; }-aux && data <= 2147483647) && data <= 2147483647 - InvariantResult [Line: 1643]: Loop Invariant Derived loop invariant: ((0 <= data + 2 && data <= 2147483647) && data <= 2147483647) && data + 2 <= 0 - InvariantResult [Line: 1584]: Loop Invariant Derived loop invariant: (aux-switch(6) { case 6: data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)); break; default: printLine("Benign, fixed string"); break; }-aux && data <= 2147483647) && data <= 2147483647 - InvariantResult [Line: 1625]: Loop Invariant Derived loop invariant: (data <= 2147483647 && aux-switch(7) { case 7: { data--; int result = data; printIntLine(result); } break; default: printLine("Benign, fixed string"); break; }-aux) && data <= 2147483647 RESULT: Ultimate proved your program to be correct! [2022-11-20 11:43:07,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a255bf-ee26-4d48-9e9e-7a0e5be816c2/bin/uautomizer-ug76WZFUDN/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