./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b 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_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b4fc024eb4a291394a4ae1b1322682ed27f27b7bc4916ad7f6f7dabc24e8b4cb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:51:58,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:51:58,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:51:58,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:51:58,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:51:58,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:51:58,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:51:58,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:51:58,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:51:58,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:51:58,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:51:58,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:51:58,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:51:58,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:51:58,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:51:58,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:51:58,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:51:58,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:51:58,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:51:58,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:51:58,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:51:58,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:51:58,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:51:58,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:51:58,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:51:58,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:51:58,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:51:58,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:51:58,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:51:58,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:51:58,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:51:58,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:51:58,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:51:58,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:51:58,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:51:58,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:51:58,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:51:58,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:51:58,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:51:58,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:51:58,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:51:58,111 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-18 20:51:58,155 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:51:58,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:51:58,155 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:51:58,155 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:51:58,156 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:51:58,156 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:51:58,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:51:58,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:51:58,157 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:51:58,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:51:58,158 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:51:58,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:51:58,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:51:58,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:51:58,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:51:58,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:51:58,163 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 20:51:58,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:51:58,164 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:51:58,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:51:58,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:51:58,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:51:58,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:51:58,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:51:58,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:51:58,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:51:58,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:51:58,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:51:58,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:51:58,167 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:51:58,167 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:51:58,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:51:58,168 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_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4fc024eb4a291394a4ae1b1322682ed27f27b7bc4916ad7f6f7dabc24e8b4cb [2022-11-18 20:51:58,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:51:58,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:51:58,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:51:58,545 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:51:58,545 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:51:58,547 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i [2022-11-18 20:51:58,633 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/data/bd1151d3c/698af83c4ea44a52a9de141003fada78/FLAG988a22872 [2022-11-18 20:51:59,334 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:51:59,335 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i [2022-11-18 20:51:59,365 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/data/bd1151d3c/698af83c4ea44a52a9de141003fada78/FLAG988a22872 [2022-11-18 20:51:59,503 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/data/bd1151d3c/698af83c4ea44a52a9de141003fada78 [2022-11-18 20:51:59,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:51:59,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:51:59,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:51:59,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:51:59,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:51:59,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:59" (1/1) ... [2022-11-18 20:51:59,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f598dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:59, skipping insertion in model container [2022-11-18 20:51:59,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:59" (1/1) ... [2022-11-18 20:51:59,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:51:59,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:52:00,030 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-18 20:52:00,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:52:00,506 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:52:00,555 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-18 20:52:00,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:52:00,740 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:52:00,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:00 WrapperNode [2022-11-18 20:52:00,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:52:00,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:52:00,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:52:00,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:52:00,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:00" (1/1) ... [2022-11-18 20:52:00,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:00" (1/1) ... [2022-11-18 20:52:00,800 INFO L138 Inliner]: procedures = 503, calls = 81, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2022-11-18 20:52:00,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:52:00,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:52:00,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:52:00,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:52:00,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:00" (1/1) ... [2022-11-18 20:52:00,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:00" (1/1) ... [2022-11-18 20:52:00,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:00" (1/1) ... [2022-11-18 20:52:00,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:00" (1/1) ... [2022-11-18 20:52:00,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:00" (1/1) ... [2022-11-18 20:52:00,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:00" (1/1) ... [2022-11-18 20:52:00,823 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:00" (1/1) ... [2022-11-18 20:52:00,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:00" (1/1) ... [2022-11-18 20:52:00,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:52:00,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:52:00,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:52:00,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:52:00,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:00" (1/1) ... [2022-11-18 20:52:00,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:52:00,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:52:00,868 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:52:00,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:52:00,912 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-18 20:52:00,913 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-18 20:52:00,913 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-18 20:52:00,913 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-18 20:52:00,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:52:00,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:52:00,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:52:00,914 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-18 20:52:00,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:52:01,051 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:52:01,054 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:52:01,406 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:52:01,434 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:52:01,437 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:52:01,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:52:01 BoogieIcfgContainer [2022-11-18 20:52:01,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:52:01,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:52:01,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:52:01,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:52:01,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:51:59" (1/3) ... [2022-11-18 20:52:01,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6439c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:52:01, skipping insertion in model container [2022-11-18 20:52:01,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:00" (2/3) ... [2022-11-18 20:52:01,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6439c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:52:01, skipping insertion in model container [2022-11-18 20:52:01,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:52:01" (3/3) ... [2022-11-18 20:52:01,450 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_multiply_15_good.i [2022-11-18 20:52:01,470 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:52:01,470 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-18 20:52:01,551 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:52:01,559 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;@30d8dd4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:52:01,559 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-18 20:52:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 76 states have internal predecessors, (85), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-18 20:52:01,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:52:01,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:01,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:01,574 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:52:01,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:01,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1923445095, now seen corresponding path program 1 times [2022-11-18 20:52:01,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:01,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975293303] [2022-11-18 20:52:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:01,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:01,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:52:01,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:01,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975293303] [2022-11-18 20:52:01,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975293303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:01,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:01,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:01,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243352197] [2022-11-18 20:52:01,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:01,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:01,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:01,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:01,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:01,989 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 76 states have internal predecessors, (85), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 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-18 20:52:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:02,062 INFO L93 Difference]: Finished difference Result 210 states and 304 transitions. [2022-11-18 20:52:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:02,068 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-18 20:52:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:02,084 INFO L225 Difference]: With dead ends: 210 [2022-11-18 20:52:02,086 INFO L226 Difference]: Without dead ends: 121 [2022-11-18 20:52:02,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:02,100 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 62 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:02,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 235 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:52:02,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-18 20:52:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 75. [2022-11-18 20:52:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 71 states have internal predecessors, (81), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-18 20:52:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 107 transitions. [2022-11-18 20:52:02,192 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 107 transitions. Word has length 15 [2022-11-18 20:52:02,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:02,192 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 107 transitions. [2022-11-18 20:52:02,193 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-18 20:52:02,193 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 107 transitions. [2022-11-18 20:52:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:52:02,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:02,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:02,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:52:02,200 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-18 20:52:02,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:02,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1033231396, now seen corresponding path program 1 times [2022-11-18 20:52:02,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:02,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352601002] [2022-11-18 20:52:02,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:02,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:02,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:52:02,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:02,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352601002] [2022-11-18 20:52:02,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352601002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:02,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:02,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:02,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016571195] [2022-11-18 20:52:02,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:02,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:02,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:02,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:02,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:02,322 INFO L87 Difference]: Start difference. First operand 75 states and 107 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-18 20:52:02,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:02,342 INFO L93 Difference]: Finished difference Result 128 states and 181 transitions. [2022-11-18 20:52:02,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:02,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-18 20:52:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:02,344 INFO L225 Difference]: With dead ends: 128 [2022-11-18 20:52:02,344 INFO L226 Difference]: Without dead ends: 63 [2022-11-18 20:52:02,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:02,347 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 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-18 20:52:02,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:52:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-18 20:52:02,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-18 20:52:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 59 states have internal predecessors, (65), 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-18 20:52:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2022-11-18 20:52:02,357 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 16 [2022-11-18 20:52:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:02,357 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2022-11-18 20:52:02,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:52:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-11-18 20:52:02,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 20:52:02,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:02,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:02,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:52:02,360 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:52:02,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:02,361 INFO L85 PathProgramCache]: Analyzing trace with hash 426041701, now seen corresponding path program 1 times [2022-11-18 20:52:02,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:02,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584974093] [2022-11-18 20:52:02,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:02,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:02,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:52:02,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:02,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584974093] [2022-11-18 20:52:02,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584974093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:02,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:02,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:02,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177981249] [2022-11-18 20:52:02,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:02,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:02,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:02,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:02,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:02,416 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:52:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:02,444 INFO L93 Difference]: Finished difference Result 114 states and 157 transitions. [2022-11-18 20:52:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:02,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-18 20:52:02,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:02,451 INFO L225 Difference]: With dead ends: 114 [2022-11-18 20:52:02,451 INFO L226 Difference]: Without dead ends: 63 [2022-11-18 20:52:02,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:02,453 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:02,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 161 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:52:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-18 20:52:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-18 20:52:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 58 states have internal predecessors, (64), 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-18 20:52:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2022-11-18 20:52:02,464 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 20 [2022-11-18 20:52:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:02,465 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2022-11-18 20:52:02,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:52:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2022-11-18 20:52:02,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:52:02,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:02,466 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] [2022-11-18 20:52:02,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:52:02,467 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:52:02,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:02,468 INFO L85 PathProgramCache]: Analyzing trace with hash 433245301, now seen corresponding path program 1 times [2022-11-18 20:52:02,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:02,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80436155] [2022-11-18 20:52:02,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:02,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:02,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:02,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:52:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:52:02,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:02,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80436155] [2022-11-18 20:52:02,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80436155] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:02,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:02,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:02,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473836607] [2022-11-18 20:52:02,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:02,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:02,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:02,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:02,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:02,603 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 20:52:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:02,626 INFO L93 Difference]: Finished difference Result 114 states and 156 transitions. [2022-11-18 20:52:02,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:02,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 24 [2022-11-18 20:52:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:02,635 INFO L225 Difference]: With dead ends: 114 [2022-11-18 20:52:02,637 INFO L226 Difference]: Without dead ends: 62 [2022-11-18 20:52:02,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:02,639 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:02,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:52:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-18 20:52:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-18 20:52:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 57 states have internal predecessors, (63), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-18 20:52:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2022-11-18 20:52:02,647 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 24 [2022-11-18 20:52:02,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:02,647 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-11-18 20:52:02,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 20:52:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-11-18 20:52:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-18 20:52:02,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:02,649 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] [2022-11-18 20:52:02,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:52:02,650 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:52:02,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:02,650 INFO L85 PathProgramCache]: Analyzing trace with hash 406206194, now seen corresponding path program 1 times [2022-11-18 20:52:02,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:02,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750696669] [2022-11-18 20:52:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:02,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:02,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:02,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 20:52:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:52:02,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:02,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750696669] [2022-11-18 20:52:02,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750696669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:02,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:02,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:02,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822271618] [2022-11-18 20:52:02,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:02,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:02,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:02,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:02,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:02,795 INFO L87 Difference]: Start difference. First operand 62 states and 83 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:52:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:02,844 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-11-18 20:52:02,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:02,845 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, (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 27 [2022-11-18 20:52:02,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:02,849 INFO L225 Difference]: With dead ends: 135 [2022-11-18 20:52:02,853 INFO L226 Difference]: Without dead ends: 96 [2022-11-18 20:52:02,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:02,855 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 33 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:02,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 160 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:52:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-18 20:52:02,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2022-11-18 20:52:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 61 states have internal predecessors, (68), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-18 20:52:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2022-11-18 20:52:02,880 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 27 [2022-11-18 20:52:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:02,881 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2022-11-18 20:52:02,881 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:52:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2022-11-18 20:52:02,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-18 20:52:02,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:02,890 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-18 20:52:02,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:52:02,891 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-18 20:52:02,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:02,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1422376419, now seen corresponding path program 1 times [2022-11-18 20:52:02,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:02,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593040991] [2022-11-18 20:52:02,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:02,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:02,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 20:52:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:52:02,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:02,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593040991] [2022-11-18 20:52:02,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593040991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:02,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:02,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:02,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967353756] [2022-11-18 20:52:02,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:02,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:02,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:02,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:02,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:02,979 INFO L87 Difference]: Start difference. First operand 66 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-18 20:52:02,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:02,988 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2022-11-18 20:52:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:02,988 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-18 20:52:02,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:02,990 INFO L225 Difference]: With dead ends: 103 [2022-11-18 20:52:02,990 INFO L226 Difference]: Without dead ends: 55 [2022-11-18 20:52:02,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:02,992 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 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-18 20:52:02,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:52:02,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-18 20:52:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-18 20:52:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3170731707317074) 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), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-18 20:52:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-11-18 20:52:02,999 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 28 [2022-11-18 20:52:02,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:03,000 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-11-18 20:52:03,000 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-18 20:52:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-11-18 20:52:03,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-18 20:52:03,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:03,001 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] [2022-11-18 20:52:03,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:52:03,002 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:52:03,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:03,003 INFO L85 PathProgramCache]: Analyzing trace with hash 91290941, now seen corresponding path program 1 times [2022-11-18 20:52:03,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:03,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065195848] [2022-11-18 20:52:03,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:03,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 20:52:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:52:03,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:03,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065195848] [2022-11-18 20:52:03,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065195848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:03,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:03,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:03,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150172500] [2022-11-18 20:52:03,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:03,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:03,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:03,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:03,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,056 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:52:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:03,064 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2022-11-18 20:52:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:03,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 33 [2022-11-18 20:52:03,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:03,066 INFO L225 Difference]: With dead ends: 89 [2022-11-18 20:52:03,066 INFO L226 Difference]: Without dead ends: 53 [2022-11-18 20:52:03,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,068 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-18 20:52:03,068 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-18 20:52:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-18 20:52:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-18 20:52:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.275) 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), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 20:52:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2022-11-18 20:52:03,075 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 33 [2022-11-18 20:52:03,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:03,075 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2022-11-18 20:52:03,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:52:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2022-11-18 20:52:03,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 20:52:03,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:03,077 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] [2022-11-18 20:52:03,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:52:03,078 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:52:03,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:03,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1997145350, now seen corresponding path program 1 times [2022-11-18 20:52:03,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:03,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221524016] [2022-11-18 20:52:03,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:03,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 20:52:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:52:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:52:03,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:03,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221524016] [2022-11-18 20:52:03,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221524016] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:03,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:03,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:52:03,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896199915] [2022-11-18 20:52:03,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:03,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:03,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:03,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:03,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,149 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:52:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:03,183 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2022-11-18 20:52:03,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:03,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (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 39 [2022-11-18 20:52:03,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:03,185 INFO L225 Difference]: With dead ends: 90 [2022-11-18 20:52:03,185 INFO L226 Difference]: Without dead ends: 73 [2022-11-18 20:52:03,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,186 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:03,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 121 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:52:03,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-18 20:52:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2022-11-18 20:52:03,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 51 states have internal predecessors, (56), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 20:52:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-11-18 20:52:03,194 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 39 [2022-11-18 20:52:03,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:03,195 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-11-18 20:52:03,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:52:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-11-18 20:52:03,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 20:52:03,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:03,197 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] [2022-11-18 20:52:03,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:52:03,197 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:52:03,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:03,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1995298308, now seen corresponding path program 1 times [2022-11-18 20:52:03,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:03,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423712962] [2022-11-18 20:52:03,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 20:52:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:52:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:52:03,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:03,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423712962] [2022-11-18 20:52:03,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423712962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:03,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:03,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:03,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214599156] [2022-11-18 20:52:03,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:03,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:03,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:03,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:03,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,259 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:52:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:03,269 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2022-11-18 20:52:03,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:03,270 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), 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 39 [2022-11-18 20:52:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:03,271 INFO L225 Difference]: With dead ends: 86 [2022-11-18 20:52:03,271 INFO L226 Difference]: Without dead ends: 57 [2022-11-18 20:52:03,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,273 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:03,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:52:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-18 20:52:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-18 20:52:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.25) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 20:52:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2022-11-18 20:52:03,279 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 39 [2022-11-18 20:52:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:03,279 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2022-11-18 20:52:03,280 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:52:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-11-18 20:52:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-18 20:52:03,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:03,281 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-18 20:52:03,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:52:03,282 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:52:03,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:03,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1781963547, now seen corresponding path program 1 times [2022-11-18 20:52:03,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:03,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700060313] [2022-11-18 20:52:03,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 20:52:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:52:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:52:03,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:03,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700060313] [2022-11-18 20:52:03,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700060313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:03,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:03,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:52:03,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114078293] [2022-11-18 20:52:03,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:03,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:03,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:03,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:03,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,349 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 3 states, 2 states have (on average 14.0) 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-18 20:52:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:03,373 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-11-18 20:52:03,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:03,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) 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-18 20:52:03,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:03,375 INFO L225 Difference]: With dead ends: 57 [2022-11-18 20:52:03,375 INFO L226 Difference]: Without dead ends: 56 [2022-11-18 20:52:03,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,376 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 20 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:03,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:52:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-18 20:52:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-18 20:52:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 49 states have internal predecessors, (54), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 20:52:03,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-11-18 20:52:03,382 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 40 [2022-11-18 20:52:03,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:03,383 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-11-18 20:52:03,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) 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-18 20:52:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-11-18 20:52:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-18 20:52:03,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:03,385 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] [2022-11-18 20:52:03,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:52:03,385 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:52:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:03,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1519209323, now seen corresponding path program 1 times [2022-11-18 20:52:03,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:03,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667366774] [2022-11-18 20:52:03,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:03,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 20:52:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:52:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:52:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 20:52:03,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:03,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667366774] [2022-11-18 20:52:03,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667366774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:03,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:03,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:03,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387571151] [2022-11-18 20:52:03,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:03,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:03,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:03,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:03,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,440 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:52:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:03,448 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-11-18 20:52:03,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:03,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 43 [2022-11-18 20:52:03,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:03,449 INFO L225 Difference]: With dead ends: 79 [2022-11-18 20:52:03,449 INFO L226 Difference]: Without dead ends: 50 [2022-11-18 20:52:03,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,450 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:03,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:52:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-18 20:52:03,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-18 20:52:03,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.15) internal successors, (46), 44 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:52:03,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-11-18 20:52:03,456 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 43 [2022-11-18 20:52:03,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:03,456 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-11-18 20:52:03,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:52:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-11-18 20:52:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-18 20:52:03,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:03,458 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] [2022-11-18 20:52:03,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:52:03,458 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:52:03,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:03,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1151157231, now seen corresponding path program 1 times [2022-11-18 20:52:03,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:03,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105411874] [2022-11-18 20:52:03,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:03,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 20:52:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:52:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:52:03,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:03,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105411874] [2022-11-18 20:52:03,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105411874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:03,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:03,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:03,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30611196] [2022-11-18 20:52:03,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:03,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:03,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:03,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:03,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,521 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:52:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:03,528 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-11-18 20:52:03,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:03,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 45 [2022-11-18 20:52:03,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:03,530 INFO L225 Difference]: With dead ends: 66 [2022-11-18 20:52:03,530 INFO L226 Difference]: Without dead ends: 48 [2022-11-18 20:52:03,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,531 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:03,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:52:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-18 20:52:03,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-18 20:52:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 41 states have internal predecessors, (43), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-18 20:52:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-18 20:52:03,536 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 45 [2022-11-18 20:52:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:03,536 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-18 20:52:03,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:52:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-18 20:52:03,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 20:52:03,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:03,538 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-18 20:52:03,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:52:03,538 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:52:03,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:03,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1850334672, now seen corresponding path program 1 times [2022-11-18 20:52:03,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:03,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262614495] [2022-11-18 20:52:03,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:03,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 20:52:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:52:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:52:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:52:03,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:03,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262614495] [2022-11-18 20:52:03,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262614495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:03,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:03,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:52:03,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814072838] [2022-11-18 20:52:03,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:03,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:03,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:03,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:03,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,600 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 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-18 20:52:03,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:03,612 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-11-18 20:52:03,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:03,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 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-18 20:52:03,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:03,613 INFO L225 Difference]: With dead ends: 54 [2022-11-18 20:52:03,614 INFO L226 Difference]: Without dead ends: 53 [2022-11-18 20:52:03,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,615 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:03,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 97 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:52:03,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-18 20:52:03,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-11-18 20:52:03,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 45 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-18 20:52:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-11-18 20:52:03,619 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 51 [2022-11-18 20:52:03,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:03,620 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-11-18 20:52:03,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 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-18 20:52:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-11-18 20:52:03,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-18 20:52:03,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:03,621 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-18 20:52:03,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:52:03,622 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:52:03,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1525799786, now seen corresponding path program 1 times [2022-11-18 20:52:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:03,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099864269] [2022-11-18 20:52:03,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:03,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 20:52:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:52:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:52:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:52:03,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:03,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099864269] [2022-11-18 20:52:03,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099864269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:03,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:03,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:52:03,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111109302] [2022-11-18 20:52:03,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:03,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:03,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:03,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:03,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,685 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 3 states, 2 states have (on average 19.0) 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-18 20:52:03,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:03,694 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-11-18 20:52:03,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:03,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) 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-18 20:52:03,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:03,710 INFO L225 Difference]: With dead ends: 52 [2022-11-18 20:52:03,710 INFO L226 Difference]: Without dead ends: 46 [2022-11-18 20:52:03,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,711 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:03,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 90 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:52:03,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-18 20:52:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-18 20:52:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-18 20:52:03,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-11-18 20:52:03,716 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 52 [2022-11-18 20:52:03,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:03,716 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-11-18 20:52:03,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) 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-18 20:52:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-11-18 20:52:03,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-18 20:52:03,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:03,718 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-18 20:52:03,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:52:03,718 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:52:03,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:03,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1470480846, now seen corresponding path program 1 times [2022-11-18 20:52:03,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:03,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613780909] [2022-11-18 20:52:03,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:03,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 20:52:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-18 20:52:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:52:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:52:03,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:03,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613780909] [2022-11-18 20:52:03,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613780909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:03,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:03,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:03,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171517302] [2022-11-18 20:52:03,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:03,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:03,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:03,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:03,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,798 INFO L87 Difference]: Start difference. First operand 46 states and 50 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-18 20:52:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:03,802 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-11-18 20:52:03,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:03,802 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-18 20:52:03,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:03,803 INFO L225 Difference]: With dead ends: 50 [2022-11-18 20:52:03,803 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 20:52:03,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,807 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:03,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:52:03,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 20:52:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 20:52:03,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:03,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 20:52:03,808 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-11-18 20:52:03,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:03,809 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 20:52:03,809 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-18 20:52:03,809 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 20:52:03,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 20:52:03,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-18 20:52:03,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-18 20:52:03,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-18 20:52:03,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-18 20:52:03,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-18 20:52:03,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-18 20:52:03,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-18 20:52:03,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-18 20:52:03,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:52:03,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 20:52:03,907 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-18 20:52:03,907 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-18 20:52:03,908 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-18 20:52:03,908 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-18 20:52:03,908 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-18 20:52:03,908 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-18 20:52:03,908 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-18 20:52:03,908 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2022-11-18 20:52:03,909 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-11-18 20:52:03,909 INFO L895 garLoopResultBuilder]: At program point L1629(lines 1629 1641) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch97#1| (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2022-11-18 20:52:03,909 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-11-18 20:52:03,909 INFO L899 garLoopResultBuilder]: For program point L1588(line 1588) no Hoare annotation was computed. [2022-11-18 20:52:03,909 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-11-18 20:52:03,909 INFO L899 garLoopResultBuilder]: For program point L1638(line 1638) no Hoare annotation was computed. [2022-11-18 20:52:03,910 INFO L895 garLoopResultBuilder]: At program point L1572(line 1572) the Hoare annotation is: false [2022-11-18 20:52:03,910 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2022-11-18 20:52:03,910 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 20:52:03,910 INFO L899 garLoopResultBuilder]: For program point L1597(line 1597) no Hoare annotation was computed. [2022-11-18 20:52:03,910 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 20:52:03,910 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2022-11-18 20:52:03,911 INFO L899 garLoopResultBuilder]: For program point L1622(line 1622) no Hoare annotation was computed. [2022-11-18 20:52:03,911 INFO L902 garLoopResultBuilder]: At program point L1680(line 1680) the Hoare annotation is: true [2022-11-18 20:52:03,911 INFO L899 garLoopResultBuilder]: For program point L1680-1(line 1680) no Hoare annotation was computed. [2022-11-18 20:52:03,911 INFO L895 garLoopResultBuilder]: At program point L1647(lines 1647 1655) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2))) (and (<= 0 .cse0) (<= .cse0 0) (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)))) [2022-11-18 20:52:03,912 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1581) no Hoare annotation was computed. [2022-11-18 20:52:03,912 INFO L895 garLoopResultBuilder]: At program point L1639(line 1639) the Hoare annotation is: false [2022-11-18 20:52:03,913 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2022-11-18 20:52:03,913 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2022-11-18 20:52:03,913 INFO L899 garLoopResultBuilder]: For program point L1598(lines 1598 1609) no Hoare annotation was computed. [2022-11-18 20:52:03,913 INFO L902 garLoopResultBuilder]: At program point L1656(lines 1656 1668) the Hoare annotation is: true [2022-11-18 20:52:03,913 INFO L895 garLoopResultBuilder]: At program point L1623(line 1623) the Hoare annotation is: false [2022-11-18 20:52:03,914 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-11-18 20:52:03,914 INFO L899 garLoopResultBuilder]: For program point L1582(lines 1582 1615) no Hoare annotation was computed. [2022-11-18 20:52:03,914 INFO L895 garLoopResultBuilder]: At program point L1607(line 1607) the Hoare annotation is: |ULTIMATE.start_goodB2G2_#t~switch95#1| [2022-11-18 20:52:03,914 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2022-11-18 20:52:03,915 INFO L899 garLoopResultBuilder]: For program point L1632(lines 1632 1636) no Hoare annotation was computed. [2022-11-18 20:52:03,915 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-18 20:52:03,915 INFO L899 garLoopResultBuilder]: For program point L1591(line 1591) no Hoare annotation was computed. [2022-11-18 20:52:03,915 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2022-11-18 20:52:03,915 INFO L902 garLoopResultBuilder]: At program point L1682(line 1682) the Hoare annotation is: true [2022-11-18 20:52:03,915 INFO L899 garLoopResultBuilder]: For program point L1649(line 1649) no Hoare annotation was computed. [2022-11-18 20:52:03,916 INFO L899 garLoopResultBuilder]: For program point L1682-1(line 1682) no Hoare annotation was computed. [2022-11-18 20:52:03,916 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1642) no Hoare annotation was computed. [2022-11-18 20:52:03,916 INFO L902 garLoopResultBuilder]: At program point L1666(line 1666) the Hoare annotation is: true [2022-11-18 20:52:03,916 INFO L899 garLoopResultBuilder]: For program point L1600(lines 1600 1608) no Hoare annotation was computed. [2022-11-18 20:52:03,916 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1578) no Hoare annotation was computed. [2022-11-18 20:52:03,916 INFO L899 garLoopResultBuilder]: For program point L1658(line 1658) no Hoare annotation was computed. [2022-11-18 20:52:03,916 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-11-18 20:52:03,917 INFO L895 garLoopResultBuilder]: At program point L1592(line 1592) the Hoare annotation is: false [2022-11-18 20:52:03,917 INFO L902 garLoopResultBuilder]: At program point L1683(lines 1677 1684) the Hoare annotation is: true [2022-11-18 20:52:03,917 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch93#1| [2022-11-18 20:52:03,917 INFO L899 garLoopResultBuilder]: For program point L1634(line 1634) no Hoare annotation was computed. [2022-11-18 20:52:03,918 INFO L899 garLoopResultBuilder]: For program point L1634-1(line 1634) no Hoare annotation was computed. [2022-11-18 20:52:03,918 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 20:52:03,918 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2022-11-18 20:52:03,919 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1663) no Hoare annotation was computed. [2022-11-18 20:52:03,919 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch92#1| (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) [2022-11-18 20:52:03,919 INFO L899 garLoopResultBuilder]: For program point L1643(lines 1643 1669) no Hoare annotation was computed. [2022-11-18 20:52:03,919 INFO L895 garLoopResultBuilder]: At program point L1635(line 1635) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch97#1| (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2022-11-18 20:52:03,919 INFO L899 garLoopResultBuilder]: For program point L1602(line 1602) no Hoare annotation was computed. [2022-11-18 20:52:03,919 INFO L899 garLoopResultBuilder]: For program point L1569(lines 1569 1577) no Hoare annotation was computed. [2022-11-18 20:52:03,920 INFO L899 garLoopResultBuilder]: For program point L1602-1(line 1602) no Hoare annotation was computed. [2022-11-18 20:52:03,921 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 20:52:03,921 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2022-11-18 20:52:03,921 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1580) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch93#1| [2022-11-18 20:52:03,921 INFO L899 garLoopResultBuilder]: For program point L1652(line 1652) no Hoare annotation was computed. [2022-11-18 20:52:03,921 INFO L895 garLoopResultBuilder]: At program point L1586(lines 1586 1594) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch94#1| (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) [2022-11-18 20:52:03,922 INFO L899 garLoopResultBuilder]: For program point L1611(line 1611) no Hoare annotation was computed. [2022-11-18 20:52:03,922 INFO L895 garLoopResultBuilder]: At program point L1603(line 1603) the Hoare annotation is: false [2022-11-18 20:52:03,922 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2022-11-18 20:52:03,922 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-11-18 20:52:03,922 INFO L899 garLoopResultBuilder]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2022-11-18 20:52:03,922 INFO L895 garLoopResultBuilder]: At program point L1595(lines 1595 1614) the Hoare annotation is: |ULTIMATE.start_goodB2G2_#t~switch95#1| [2022-11-18 20:52:03,923 INFO L895 garLoopResultBuilder]: At program point L1653(line 1653) the Hoare annotation is: false [2022-11-18 20:52:03,923 INFO L895 garLoopResultBuilder]: At program point L1620(lines 1620 1628) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (and |ULTIMATE.start_goodG2B1_#t~switch96#1| (<= .cse0 0) (<= 0 .cse0))) [2022-11-18 20:52:03,923 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-18 20:52:03,923 INFO L895 garLoopResultBuilder]: At program point L1612(line 1612) the Hoare annotation is: false [2022-11-18 20:52:03,923 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-11-18 20:52:03,923 INFO L899 garLoopResultBuilder]: For program point L1670(lines 1670 1676) no Hoare annotation was computed. [2022-11-18 20:52:03,924 INFO L899 garLoopResultBuilder]: For program point L1571(line 1571) no Hoare annotation was computed. [2022-11-18 20:52:03,924 INFO L899 garLoopResultBuilder]: For program point L1571-1(line 1571) no Hoare annotation was computed. [2022-11-18 20:52:03,927 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:03,930 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:52:03,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:52:03 BoogieIcfgContainer [2022-11-18 20:52:03,965 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:52:03,965 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:52:03,965 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:52:03,965 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:52:03,966 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:52:01" (3/4) ... [2022-11-18 20:52:03,969 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 20:52:03,974 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-18 20:52:03,974 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-18 20:52:03,980 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-18 20:52:03,980 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-18 20:52:03,980 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-18 20:52:03,981 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:52:03,981 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:52:04,023 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:52:04,023 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:52:04,023 INFO L158 Benchmark]: Toolchain (without parser) took 4516.24ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 102.2MB in the beginning and 100.1MB in the end (delta: 2.1MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2022-11-18 20:52:04,024 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 113.2MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:52:04,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1230.52ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 63.3MB in the end (delta: 38.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-18 20:52:04,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.84ms. Allocated memory is still 142.6MB. Free memory was 63.3MB in the beginning and 60.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:52:04,025 INFO L158 Benchmark]: Boogie Preprocessor took 26.24ms. Allocated memory is still 142.6MB. Free memory was 60.1MB in the beginning and 58.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:52:04,025 INFO L158 Benchmark]: RCFGBuilder took 611.74ms. Allocated memory is still 142.6MB. Free memory was 58.9MB in the beginning and 112.6MB in the end (delta: -53.7MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2022-11-18 20:52:04,025 INFO L158 Benchmark]: TraceAbstraction took 2521.21ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 112.6MB in the beginning and 105.4MB in the end (delta: 7.2MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2022-11-18 20:52:04,026 INFO L158 Benchmark]: Witness Printer took 57.77ms. Allocated memory is still 197.1MB. Free memory was 105.4MB in the beginning and 101.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:52:04,027 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.21ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 113.2MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1230.52ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 63.3MB in the end (delta: 38.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.84ms. Allocated memory is still 142.6MB. Free memory was 63.3MB in the beginning and 60.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.24ms. Allocated memory is still 142.6MB. Free memory was 60.1MB in the beginning and 58.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 611.74ms. Allocated memory is still 142.6MB. Free memory was 58.9MB in the beginning and 112.6MB in the end (delta: -53.7MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2521.21ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 112.6MB in the beginning and 105.4MB in the end (delta: 7.2MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. * Witness Printer took 57.77ms. Allocated memory is still 197.1MB. Free memory was 105.4MB in the beginning and 101.2MB in the end (delta: 4.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: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 1953 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 918 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1035 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 93 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 105 PreInvPairs, 125 NumberOfFragments, 77 HoareAnnotationTreeSize, 105 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 509 ConstructedInterpolants, 0 QuantifiedInterpolants, 619 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 124/124 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1595]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1656]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1629]: Loop Invariant Derived loop invariant: aux-switch(7) { case 7: if(data < 0) { int result = data * 2; printIntLine(result); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= 2 + data - InvariantResult [Line: 1561]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: data = (-0x7fffffff - 1); break; default: printLine("Benign, fixed string"); break; }-aux && data + 2147483648 <= 0 - InvariantResult [Line: 1586]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: data = (-0x7fffffff - 1); break; default: printLine("Benign, fixed string"); break; }-aux && data + 2147483648 <= 0 - InvariantResult [Line: 1620]: Loop Invariant Derived loop invariant: (aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = -2; break; }-aux && 2 + data <= 0) && 0 <= 2 + data - InvariantResult [Line: 1647]: Loop Invariant Derived loop invariant: (0 <= data + 2 && data + 2 <= 0) && 0 <= 2 + data - InvariantResult [Line: 1677]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-18 20:52:04,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32e240f-4b1f-44e4-8182-8b48b2efb82c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE