./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 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_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a --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 bd97e3c5e9754f852b995eed0d7e7261cd9ed58702428911046867926ba1d79f --- 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-b5237d8 [2022-11-21 16:13:59,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:13:59,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:13:59,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:13:59,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:13:59,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:13:59,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:13:59,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:13:59,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:13:59,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:13:59,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:13:59,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:13:59,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:13:59,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:13:59,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:13:59,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:13:59,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:13:59,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:13:59,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:13:59,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:13:59,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:13:59,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:13:59,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:13:59,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:13:59,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:13:59,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:13:59,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:13:59,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:13:59,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:13:59,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:13:59,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:13:59,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:13:59,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:13:59,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:13:59,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:13:59,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:13:59,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:13:59,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:13:59,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:13:59,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:13:59,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:13:59,600 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-21 16:13:59,622 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:13:59,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:13:59,623 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:13:59,623 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:13:59,624 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:13:59,625 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:13:59,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:13:59,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:13:59,626 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:13:59,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:13:59,627 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:13:59,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:13:59,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:13:59,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:13:59,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:13:59,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:13:59,629 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-21 16:13:59,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:13:59,629 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:13:59,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:13:59,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:13:59,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:13:59,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:13:59,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:13:59,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:13:59,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:13:59,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:13:59,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:13:59,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:13:59,633 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:13:59,633 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:13:59,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:13:59,634 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_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a/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_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a 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 -> bd97e3c5e9754f852b995eed0d7e7261cd9ed58702428911046867926ba1d79f [2022-11-21 16:13:59,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:13:59,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:13:59,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:13:59,947 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:13:59,950 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:13:59,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_15_good.i [2022-11-21 16:14:03,104 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:14:03,492 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:14:03,492 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da2c6ca-939a-439c-931f-4413dffb1189/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_15_good.i [2022-11-21 16:14:03,516 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a/data/4bc19763e/42a65c29b911483e883e843432dc5f39/FLAG998a42efb [2022-11-21 16:14:03,532 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a/data/4bc19763e/42a65c29b911483e883e843432dc5f39 [2022-11-21 16:14:03,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:14:03,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:14:03,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:14:03,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:14:03,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:14:03,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:14:03" (1/1) ... [2022-11-21 16:14:03,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@500556ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:03, skipping insertion in model container [2022-11-21 16:14:03,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:14:03" (1/1) ... [2022-11-21 16:14:03,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:14:03,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:14:04,049 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-21 16:14:04,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:14:04,729 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:14:04,761 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-21 16:14:04,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:14:04,994 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:14:04,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:04 WrapperNode [2022-11-21 16:14:04,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:14:04,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:14:04,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:14:04,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:14:05,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:04" (1/1) ... [2022-11-21 16:14:05,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:04" (1/1) ... [2022-11-21 16:14:05,076 INFO L138 Inliner]: procedures = 504, calls = 97, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 175 [2022-11-21 16:14:05,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:14:05,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:14:05,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:14:05,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:14:05,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:04" (1/1) ... [2022-11-21 16:14:05,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:04" (1/1) ... [2022-11-21 16:14:05,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:04" (1/1) ... [2022-11-21 16:14:05,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:04" (1/1) ... [2022-11-21 16:14:05,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:04" (1/1) ... [2022-11-21 16:14:05,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:04" (1/1) ... [2022-11-21 16:14:05,104 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:04" (1/1) ... [2022-11-21 16:14:05,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:04" (1/1) ... [2022-11-21 16:14:05,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:14:05,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:14:05,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:14:05,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:14:05,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:04" (1/1) ... [2022-11-21 16:14:05,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:14:05,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:14:05,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:14:05,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:14:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-21 16:14:05,243 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-21 16:14:05,243 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-21 16:14:05,243 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-21 16:14:05,244 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-21 16:14:05,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:14:05,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-21 16:14:05,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:14:05,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:14:05,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:14:05,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:14:05,254 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-21 16:14:05,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:14:05,494 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:14:05,496 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:14:05,822 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:14:05,832 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:14:05,833 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:14:05,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:14:05 BoogieIcfgContainer [2022-11-21 16:14:05,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:14:05,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:14:05,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:14:05,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:14:05,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:14:03" (1/3) ... [2022-11-21 16:14:05,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19383c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:14:05, skipping insertion in model container [2022-11-21 16:14:05,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:04" (2/3) ... [2022-11-21 16:14:05,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19383c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:14:05, skipping insertion in model container [2022-11-21 16:14:05,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:14:05" (3/3) ... [2022-11-21 16:14:05,844 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_sub_15_good.i [2022-11-21 16:14:05,863 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:14:05,863 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-21 16:14:05,915 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:14:05,922 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;@42e3c6fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:14:05,922 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-21 16:14:05,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.537037037037037) internal successors, (83), 78 states have internal predecessors, (83), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-21 16:14:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 16:14:05,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:05,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:05,937 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-21 16:14:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:05,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2009313757, now seen corresponding path program 1 times [2022-11-21 16:14:05,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:05,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556420065] [2022-11-21 16:14:05,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:05,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:06,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:06,230 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-21 16:14:06,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:06,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556420065] [2022-11-21 16:14:06,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556420065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:06,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:06,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:14:06,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408826673] [2022-11-21 16:14:06,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:06,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:06,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:06,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:06,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:06,272 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.537037037037037) internal successors, (83), 78 states have internal predecessors, (83), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 18 states have call successors, (18) 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-21 16:14:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:06,356 INFO L93 Difference]: Finished difference Result 156 states and 222 transitions. [2022-11-21 16:14:06,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:06,359 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-21 16:14:06,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:06,374 INFO L225 Difference]: With dead ends: 156 [2022-11-21 16:14:06,374 INFO L226 Difference]: Without dead ends: 70 [2022-11-21 16:14:06,380 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-21 16:14:06,387 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 220 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-21 16:14:06,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 220 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-21 16:14:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-21 16:14:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-21 16:14:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2022-11-21 16:14:06,461 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 15 [2022-11-21 16:14:06,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:06,463 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2022-11-21 16:14:06,463 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-21 16:14:06,463 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-11-21 16:14:06,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:14:06,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:06,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:06,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:14:06,467 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-21 16:14:06,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:06,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1328587979, now seen corresponding path program 1 times [2022-11-21 16:14:06,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:06,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907051539] [2022-11-21 16:14:06,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:06,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:06,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:06,684 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-21 16:14:06,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:06,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907051539] [2022-11-21 16:14:06,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907051539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:06,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:06,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:14:06,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652694948] [2022-11-21 16:14:06,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:06,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:06,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:06,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:06,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:06,704 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 3 states, 2 states have (on average 7.0) 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-21 16:14:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:06,735 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-11-21 16:14:06,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:06,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) 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-21 16:14:06,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:06,737 INFO L225 Difference]: With dead ends: 70 [2022-11-21 16:14:06,737 INFO L226 Difference]: Without dead ends: 69 [2022-11-21 16:14:06,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:06,740 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 54 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 115 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-21 16:14:06,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-21 16:14:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-21 16:14:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.5) internal successors, (69), 65 states have internal predecessors, (69), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-21 16:14:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2022-11-21 16:14:06,753 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 16 [2022-11-21 16:14:06,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:06,753 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2022-11-21 16:14:06,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) 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-21 16:14:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2022-11-21 16:14:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:14:06,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:06,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:06,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:14:06,756 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 16:14:06,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1763445692, now seen corresponding path program 1 times [2022-11-21 16:14:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:06,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269922633] [2022-11-21 16:14:06,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:06,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:06,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:06,865 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-21 16:14:06,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:06,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269922633] [2022-11-21 16:14:06,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269922633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:06,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:06,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:14:06,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423158457] [2022-11-21 16:14:06,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:06,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:06,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:06,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:06,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:06,868 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:14:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:06,903 INFO L93 Difference]: Finished difference Result 171 states and 243 transitions. [2022-11-21 16:14:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:06,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-21 16:14:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:06,906 INFO L225 Difference]: With dead ends: 171 [2022-11-21 16:14:06,906 INFO L226 Difference]: Without dead ends: 118 [2022-11-21 16:14:06,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:06,908 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 55 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:06,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:06,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-21 16:14:06,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 73. [2022-11-21 16:14:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-21 16:14:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2022-11-21 16:14:06,928 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 17 [2022-11-21 16:14:06,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:06,928 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2022-11-21 16:14:06,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:14:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2022-11-21 16:14:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:14:06,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:06,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:06,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:14:06,931 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-21 16:14:06,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:06,931 INFO L85 PathProgramCache]: Analyzing trace with hash 799401358, now seen corresponding path program 1 times [2022-11-21 16:14:06,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:06,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54544819] [2022-11-21 16:14:06,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:06,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:06,994 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-21 16:14:06,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:06,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54544819] [2022-11-21 16:14:06,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54544819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:06,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:06,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:14:06,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303107095] [2022-11-21 16:14:06,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:06,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:06,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:06,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:06,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:06,998 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:14:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:07,021 INFO L93 Difference]: Finished difference Result 124 states and 173 transitions. [2022-11-21 16:14:07,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:07,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-21 16:14:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:07,023 INFO L225 Difference]: With dead ends: 124 [2022-11-21 16:14:07,023 INFO L226 Difference]: Without dead ends: 73 [2022-11-21 16:14:07,024 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-21 16:14:07,025 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 176 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-21 16:14:07,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 176 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-21 16:14:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-21 16:14:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 67 states have internal predecessors, (73), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-21 16:14:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2022-11-21 16:14:07,044 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 22 [2022-11-21 16:14:07,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:07,045 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2022-11-21 16:14:07,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:14:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2022-11-21 16:14:07,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 16:14:07,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:07,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:07,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:14:07,050 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-21 16:14:07,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:07,051 INFO L85 PathProgramCache]: Analyzing trace with hash 510911504, now seen corresponding path program 1 times [2022-11-21 16:14:07,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:07,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700120744] [2022-11-21 16:14:07,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 16:14:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,171 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-21 16:14:07,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:07,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700120744] [2022-11-21 16:14:07,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700120744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:07,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:07,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:14:07,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16120083] [2022-11-21 16:14:07,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:07,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:07,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:07,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:07,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:07,183 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 16:14:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:07,216 INFO L93 Difference]: Finished difference Result 124 states and 171 transitions. [2022-11-21 16:14:07,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:07,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-11-21 16:14:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:07,228 INFO L225 Difference]: With dead ends: 124 [2022-11-21 16:14:07,228 INFO L226 Difference]: Without dead ends: 72 [2022-11-21 16:14:07,229 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-21 16:14:07,230 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 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-21 16:14:07,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-21 16:14:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-21 16:14:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.392156862745098) internal successors, (71), 66 states have internal predecessors, (71), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-21 16:14:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2022-11-21 16:14:07,257 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 26 [2022-11-21 16:14:07,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:07,258 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-11-21 16:14:07,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 16:14:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2022-11-21 16:14:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 16:14:07,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:07,265 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-21 16:14:07,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:14:07,265 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-21 16:14:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:07,266 INFO L85 PathProgramCache]: Analyzing trace with hash 612038571, now seen corresponding path program 1 times [2022-11-21 16:14:07,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:07,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327182912] [2022-11-21 16:14:07,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:07,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:14:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,381 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-21 16:14:07,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:07,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327182912] [2022-11-21 16:14:07,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327182912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:07,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:07,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:14:07,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516908740] [2022-11-21 16:14:07,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:07,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:07,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:07,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:07,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:07,385 INFO L87 Difference]: Start difference. First operand 72 states and 97 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-21 16:14:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:07,419 INFO L93 Difference]: Finished difference Result 115 states and 154 transitions. [2022-11-21 16:14:07,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:07,420 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-21 16:14:07,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:07,427 INFO L225 Difference]: With dead ends: 115 [2022-11-21 16:14:07,427 INFO L226 Difference]: Without dead ends: 70 [2022-11-21 16:14:07,428 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-21 16:14:07,435 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 166 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-21 16:14:07,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-21 16:14:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-21 16:14:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.36) internal successors, (68), 64 states have internal predecessors, (68), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-21 16:14:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2022-11-21 16:14:07,446 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 28 [2022-11-21 16:14:07,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:07,446 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2022-11-21 16:14:07,453 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-21 16:14:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2022-11-21 16:14:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 16:14:07,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:07,455 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:07,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:14:07,457 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 16:14:07,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:07,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1126717929, now seen corresponding path program 1 times [2022-11-21 16:14:07,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:07,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348741592] [2022-11-21 16:14:07,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:07,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:14:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,583 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-21 16:14:07,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:07,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348741592] [2022-11-21 16:14:07,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348741592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:07,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:07,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:14:07,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129363044] [2022-11-21 16:14:07,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:07,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:07,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:07,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:07,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:07,587 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 16:14:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:07,619 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2022-11-21 16:14:07,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:07,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-11-21 16:14:07,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:07,623 INFO L225 Difference]: With dead ends: 70 [2022-11-21 16:14:07,623 INFO L226 Difference]: Without dead ends: 69 [2022-11-21 16:14:07,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:07,633 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 35 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 118 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-21 16:14:07,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 118 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-21 16:14:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-21 16:14:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.34) internal successors, (67), 63 states have internal predecessors, (67), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-21 16:14:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2022-11-21 16:14:07,675 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 29 [2022-11-21 16:14:07,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:07,675 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-11-21 16:14:07,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 16:14:07,676 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2022-11-21 16:14:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 16:14:07,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:07,677 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:07,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:14:07,677 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 16:14:07,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:07,678 INFO L85 PathProgramCache]: Analyzing trace with hash 568517554, now seen corresponding path program 1 times [2022-11-21 16:14:07,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:07,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923075290] [2022-11-21 16:14:07,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:07,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:14:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,776 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-21 16:14:07,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:07,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923075290] [2022-11-21 16:14:07,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923075290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:07,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:07,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:14:07,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556200224] [2022-11-21 16:14:07,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:07,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:07,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:07,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:07,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:07,785 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 16:14:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:07,822 INFO L93 Difference]: Finished difference Result 133 states and 177 transitions. [2022-11-21 16:14:07,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:07,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-21 16:14:07,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:07,825 INFO L225 Difference]: With dead ends: 133 [2022-11-21 16:14:07,825 INFO L226 Difference]: Without dead ends: 99 [2022-11-21 16:14:07,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:07,826 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 35 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:07,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-21 16:14:07,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 72. [2022-11-21 16:14:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 65 states have internal predecessors, (71), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-21 16:14:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2022-11-21 16:14:07,838 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 30 [2022-11-21 16:14:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:07,839 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-11-21 16:14:07,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 16:14:07,839 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2022-11-21 16:14:07,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 16:14:07,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:07,840 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:07,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:14:07,840 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-21 16:14:07,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:07,841 INFO L85 PathProgramCache]: Analyzing trace with hash -243306749, now seen corresponding path program 1 times [2022-11-21 16:14:07,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:07,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674041968] [2022-11-21 16:14:07,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:07,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:14:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,912 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-21 16:14:07,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:07,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674041968] [2022-11-21 16:14:07,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674041968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:07,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:07,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:14:07,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708831751] [2022-11-21 16:14:07,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:07,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:07,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:07,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:07,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:07,915 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 16:14:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:07,938 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2022-11-21 16:14:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:07,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-21 16:14:07,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:07,941 INFO L225 Difference]: With dead ends: 104 [2022-11-21 16:14:07,941 INFO L226 Difference]: Without dead ends: 70 [2022-11-21 16:14:07,943 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-21 16:14:07,946 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:07,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-21 16:14:07,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-21 16:14:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 62 states have internal predecessors, (67), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-21 16:14:07,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2022-11-21 16:14:07,968 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 35 [2022-11-21 16:14:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:07,968 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2022-11-21 16:14:07,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 16:14:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2022-11-21 16:14:07,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-21 16:14:07,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:07,973 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-21 16:14:07,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:14:07,973 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 16:14:07,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:07,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1207061858, now seen corresponding path program 1 times [2022-11-21 16:14:07,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:07,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948295338] [2022-11-21 16:14:07,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:07,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:14:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-21 16:14:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,061 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-21 16:14:08,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:08,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948295338] [2022-11-21 16:14:08,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948295338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:08,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:08,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:14:08,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491047982] [2022-11-21 16:14:08,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:08,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:08,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:08,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:08,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:08,065 INFO L87 Difference]: Start difference. First operand 70 states and 89 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-21 16:14:08,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:08,093 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2022-11-21 16:14:08,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:08,093 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-21 16:14:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:08,096 INFO L225 Difference]: With dead ends: 89 [2022-11-21 16:14:08,096 INFO L226 Difference]: Without dead ends: 88 [2022-11-21 16:14:08,097 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-21 16:14:08,097 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 17 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:08,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 154 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-21 16:14:08,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 73. [2022-11-21 16:14:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 65 states have internal predecessors, (71), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-21 16:14:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2022-11-21 16:14:08,125 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 40 [2022-11-21 16:14:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:08,126 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2022-11-21 16:14:08,126 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-21 16:14:08,126 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-11-21 16:14:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-21 16:14:08,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:08,130 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-21 16:14:08,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:14:08,130 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-21 16:14:08,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:08,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1207002276, now seen corresponding path program 1 times [2022-11-21 16:14:08,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:08,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015481618] [2022-11-21 16:14:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:08,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:14:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-21 16:14:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,201 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-21 16:14:08,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:08,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015481618] [2022-11-21 16:14:08,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015481618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:08,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:08,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:14:08,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800017075] [2022-11-21 16:14:08,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:08,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:08,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:08,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:08,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:08,204 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 16:14:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:08,218 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2022-11-21 16:14:08,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:08,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-21 16:14:08,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:08,220 INFO L225 Difference]: With dead ends: 100 [2022-11-21 16:14:08,220 INFO L226 Difference]: Without dead ends: 73 [2022-11-21 16:14:08,220 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-21 16:14:08,221 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:08,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 151 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:08,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-21 16:14:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-21 16:14:08,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.25) internal successors, (70), 64 states have internal predecessors, (70), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-21 16:14:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2022-11-21 16:14:08,230 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 40 [2022-11-21 16:14:08,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:08,231 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2022-11-21 16:14:08,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 16:14:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-11-21 16:14:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 16:14:08,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:08,232 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:08,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:14:08,233 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 16:14:08,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:08,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1235788226, now seen corresponding path program 1 times [2022-11-21 16:14:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:08,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454054181] [2022-11-21 16:14:08,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:08,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:14:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-21 16:14:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,322 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-21 16:14:08,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:08,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454054181] [2022-11-21 16:14:08,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454054181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:08,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:08,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:14:08,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427985581] [2022-11-21 16:14:08,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:08,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:08,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:08,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:08,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:08,325 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 16:14:08,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:08,340 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-11-21 16:14:08,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:08,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-11-21 16:14:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:08,342 INFO L225 Difference]: With dead ends: 73 [2022-11-21 16:14:08,342 INFO L226 Difference]: Without dead ends: 72 [2022-11-21 16:14:08,342 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-21 16:14:08,343 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 18 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:08,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-21 16:14:08,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-21 16:14:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 63 states have internal predecessors, (69), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-21 16:14:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2022-11-21 16:14:08,355 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 41 [2022-11-21 16:14:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:08,355 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2022-11-21 16:14:08,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 16:14:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2022-11-21 16:14:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 16:14:08,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:08,357 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:08,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:14:08,357 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 16:14:08,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash 210930585, now seen corresponding path program 1 times [2022-11-21 16:14:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:08,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057546140] [2022-11-21 16:14:08,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:08,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:14:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-21 16:14:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-21 16:14:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,433 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-21 16:14:08,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:08,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057546140] [2022-11-21 16:14:08,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057546140] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:08,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:08,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:14:08,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357023280] [2022-11-21 16:14:08,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:08,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:08,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:08,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:08,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:08,436 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:14:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:08,450 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-11-21 16:14:08,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:08,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2022-11-21 16:14:08,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:08,451 INFO L225 Difference]: With dead ends: 94 [2022-11-21 16:14:08,452 INFO L226 Difference]: Without dead ends: 67 [2022-11-21 16:14:08,452 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-21 16:14:08,453 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:08,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:08,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-21 16:14:08,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-21 16:14:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 59 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-21 16:14:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2022-11-21 16:14:08,462 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 44 [2022-11-21 16:14:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:08,462 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2022-11-21 16:14:08,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:14:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-11-21 16:14:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 16:14:08,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:08,464 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:08,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:14:08,464 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 16:14:08,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:08,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1068830320, now seen corresponding path program 1 times [2022-11-21 16:14:08,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:08,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915947991] [2022-11-21 16:14:08,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:08,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:14:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-21 16:14:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,523 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-21 16:14:08,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:08,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915947991] [2022-11-21 16:14:08,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915947991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:08,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:08,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:14:08,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653280550] [2022-11-21 16:14:08,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:08,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:08,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:08,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:08,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:08,526 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 16:14:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:08,537 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2022-11-21 16:14:08,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:08,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2022-11-21 16:14:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:08,538 INFO L225 Difference]: With dead ends: 82 [2022-11-21 16:14:08,539 INFO L226 Difference]: Without dead ends: 65 [2022-11-21 16:14:08,539 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-21 16:14:08,540 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:08,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:08,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-21 16:14:08,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-21 16:14:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 56 states have internal predecessors, (60), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-21 16:14:08,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-11-21 16:14:08,547 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 46 [2022-11-21 16:14:08,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:08,548 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-11-21 16:14:08,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 16:14:08,548 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-11-21 16:14:08,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 16:14:08,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:08,549 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-21 16:14:08,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:14:08,549 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-21 16:14:08,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:08,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2085155984, now seen corresponding path program 1 times [2022-11-21 16:14:08,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:08,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5346294] [2022-11-21 16:14:08,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:08,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:14:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-21 16:14:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-21 16:14:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,622 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-21 16:14:08,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:08,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5346294] [2022-11-21 16:14:08,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5346294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:08,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:08,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:14:08,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365375047] [2022-11-21 16:14:08,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:08,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:08,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:08,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:08,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:08,625 INFO L87 Difference]: Start difference. First operand 65 states and 78 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-21 16:14:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:08,639 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-11-21 16:14:08,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:08,639 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-21 16:14:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:08,640 INFO L225 Difference]: With dead ends: 70 [2022-11-21 16:14:08,640 INFO L226 Difference]: Without dead ends: 69 [2022-11-21 16:14:08,641 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-21 16:14:08,641 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:08,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-21 16:14:08,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-11-21 16:14:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 59 states have internal predecessors, (63), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-21 16:14:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2022-11-21 16:14:08,650 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 51 [2022-11-21 16:14:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:08,650 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2022-11-21 16:14:08,651 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-21 16:14:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-11-21 16:14:08,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-21 16:14:08,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:08,652 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-21 16:14:08,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:14:08,652 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 16:14:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:08,653 INFO L85 PathProgramCache]: Analyzing trace with hash -215325871, now seen corresponding path program 1 times [2022-11-21 16:14:08,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:08,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886099415] [2022-11-21 16:14:08,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:08,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:14:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-21 16:14:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-21 16:14:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:14:08,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:08,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886099415] [2022-11-21 16:14:08,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886099415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:08,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:08,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:14:08,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935917332] [2022-11-21 16:14:08,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:08,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:08,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:08,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:08,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:08,728 INFO L87 Difference]: Start difference. First operand 68 states and 81 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-21 16:14:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:08,739 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-11-21 16:14:08,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:08,740 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-21 16:14:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:08,741 INFO L225 Difference]: With dead ends: 68 [2022-11-21 16:14:08,741 INFO L226 Difference]: Without dead ends: 63 [2022-11-21 16:14:08,741 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-21 16:14:08,742 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:08,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:08,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-21 16:14:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-21 16:14:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 54 states have internal predecessors, (57), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-21 16:14:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-11-21 16:14:08,749 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 52 [2022-11-21 16:14:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:08,750 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-11-21 16:14:08,750 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-21 16:14:08,750 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-11-21 16:14:08,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-21 16:14:08,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:08,773 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-21 16:14:08,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 16:14:08,773 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-21 16:14:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash -213541358, now seen corresponding path program 1 times [2022-11-21 16:14:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:08,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297806356] [2022-11-21 16:14:08,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:08,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:14:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:14:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-21 16:14:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-21 16:14:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:08,837 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-21 16:14:08,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:08,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297806356] [2022-11-21 16:14:08,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297806356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:08,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:08,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:14:08,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726758898] [2022-11-21 16:14:08,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:08,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:08,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:08,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:08,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:14:08,839 INFO L87 Difference]: Start difference. First operand 63 states and 75 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-21 16:14:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:08,845 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-11-21 16:14:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:08,846 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-21 16:14:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:08,846 INFO L225 Difference]: With dead ends: 67 [2022-11-21 16:14:08,846 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 16:14:08,847 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-21 16:14:08,847 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:08,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 16:14:08,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 16:14:08,849 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-21 16:14:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 16:14:08,849 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-11-21 16:14:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:08,849 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:14:08,850 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-21 16:14:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 16:14:08,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 16:14:08,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-21 16:14:08,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-21 16:14:08,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-21 16:14:08,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-21 16:14:08,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-21 16:14:08,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-21 16:14:08,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-21 16:14:08,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-21 16:14:08,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 16:14:08,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 16:14:09,144 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-21 16:14:09,144 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-21 16:14:09,145 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-21 16:14:09,145 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-21 16:14:09,145 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-21 16:14:09,145 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-21 16:14:09,145 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-21 16:14:09,145 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1617) no Hoare annotation was computed. [2022-11-21 16:14:09,146 INFO L902 garLoopResultBuilder]: At program point L1695(lines 1689 1696) the Hoare annotation is: true [2022-11-21 16:14:09,146 INFO L899 garLoopResultBuilder]: For program point L1662(line 1662) no Hoare annotation was computed. [2022-11-21 16:14:09,146 INFO L895 garLoopResultBuilder]: At program point L1563(line 1563) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch92#1| (not (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0))) [2022-11-21 16:14:09,146 INFO L899 garLoopResultBuilder]: For program point L1563-1(lines 1557 1564) no Hoare annotation was computed. [2022-11-21 16:14:09,146 INFO L895 garLoopResultBuilder]: At program point L1580(line 1580) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch95#1| (not (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0))) [2022-11-21 16:14:09,147 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1673) no Hoare annotation was computed. [2022-11-21 16:14:09,147 INFO L899 garLoopResultBuilder]: For program point L1671(line 1671) no Hoare annotation was computed. [2022-11-21 16:14:09,147 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2022-11-21 16:14:09,147 INFO L899 garLoopResultBuilder]: For program point L1630(lines 1630 1655) no Hoare annotation was computed. [2022-11-21 16:14:09,147 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 16:14:09,147 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 16:14:09,148 INFO L895 garLoopResultBuilder]: At program point L1622(line 1622) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch99#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-21 16:14:09,148 INFO L899 garLoopResultBuilder]: For program point L1589(lines 1589 1629) no Hoare annotation was computed. [2022-11-21 16:14:09,148 INFO L899 garLoopResultBuilder]: For program point L1647(line 1647) no Hoare annotation was computed. [2022-11-21 16:14:09,148 INFO L899 garLoopResultBuilder]: For program point L1614(line 1614) no Hoare annotation was computed. [2022-11-21 16:14:09,148 INFO L899 garLoopResultBuilder]: For program point L1647-1(line 1647) no Hoare annotation was computed. [2022-11-21 16:14:09,149 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1588) no Hoare annotation was computed. [2022-11-21 16:14:09,149 INFO L899 garLoopResultBuilder]: For program point L1639(line 1639) no Hoare annotation was computed. [2022-11-21 16:14:09,149 INFO L899 garLoopResultBuilder]: For program point L1573(line 1573) no Hoare annotation was computed. [2022-11-21 16:14:09,149 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2022-11-21 16:14:09,149 INFO L899 garLoopResultBuilder]: For program point L1598(lines 1598 1605) no Hoare annotation was computed. [2022-11-21 16:14:09,149 INFO L899 garLoopResultBuilder]: For program point L1656(lines 1656 1681) no Hoare annotation was computed. [2022-11-21 16:14:09,150 INFO L899 garLoopResultBuilder]: For program point L1557(lines 1557 1564) no Hoare annotation was computed. [2022-11-21 16:14:09,150 INFO L895 garLoopResultBuilder]: At program point L1648(line 1648) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch101#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2022-11-21 16:14:09,150 INFO L899 garLoopResultBuilder]: For program point L1615(lines 1615 1623) no Hoare annotation was computed. [2022-11-21 16:14:09,150 INFO L899 garLoopResultBuilder]: For program point L1673(line 1673) no Hoare annotation was computed. [2022-11-21 16:14:09,150 INFO L899 garLoopResultBuilder]: For program point L1673-1(line 1673) no Hoare annotation was computed. [2022-11-21 16:14:09,150 INFO L895 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: false [2022-11-21 16:14:09,151 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2022-11-21 16:14:09,151 INFO L899 garLoopResultBuilder]: For program point L1682(lines 1682 1688) no Hoare annotation was computed. [2022-11-21 16:14:09,151 INFO L902 garLoopResultBuilder]: At program point L1674(line 1674) the Hoare annotation is: true [2022-11-21 16:14:09,151 INFO L899 garLoopResultBuilder]: For program point L1608(line 1608) no Hoare annotation was computed. [2022-11-21 16:14:09,151 INFO L895 garLoopResultBuilder]: At program point L1666(line 1666) the Hoare annotation is: false [2022-11-21 16:14:09,151 INFO L899 garLoopResultBuilder]: For program point L1567(line 1567) no Hoare annotation was computed. [2022-11-21 16:14:09,152 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-11-21 16:14:09,152 INFO L899 garLoopResultBuilder]: For program point L1617(line 1617) no Hoare annotation was computed. [2022-11-21 16:14:09,152 INFO L895 garLoopResultBuilder]: At program point L1584(line 1584) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch95#1|) [2022-11-21 16:14:09,152 INFO L899 garLoopResultBuilder]: For program point L1617-1(line 1617) no Hoare annotation was computed. [2022-11-21 16:14:09,152 INFO L895 garLoopResultBuilder]: At program point L1609(line 1609) the Hoare annotation is: false [2022-11-21 16:14:09,153 INFO L899 garLoopResultBuilder]: For program point L1576(line 1576) no Hoare annotation was computed. [2022-11-21 16:14:09,153 INFO L895 garLoopResultBuilder]: At program point L1634(lines 1634 1642) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (and (<= .cse0 0) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch100#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (<= 0 .cse0))) [2022-11-21 16:14:09,153 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-11-21 16:14:09,153 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 16:14:09,153 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1647) no Hoare annotation was computed. [2022-11-21 16:14:09,154 INFO L902 garLoopResultBuilder]: At program point L1692(line 1692) the Hoare annotation is: true [2022-11-21 16:14:09,154 INFO L899 garLoopResultBuilder]: For program point L1692-1(line 1692) no Hoare annotation was computed. [2022-11-21 16:14:09,154 INFO L895 garLoopResultBuilder]: At program point L1626(line 1626) the Hoare annotation is: false [2022-11-21 16:14:09,154 INFO L895 garLoopResultBuilder]: At program point L1593(lines 1593 1611) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch96#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-21 16:14:09,154 INFO L899 garLoopResultBuilder]: For program point L1651(line 1651) no Hoare annotation was computed. [2022-11-21 16:14:09,154 INFO L895 garLoopResultBuilder]: At program point L1618(line 1618) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch99#1| (not (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-21 16:14:09,155 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1570) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch92#1|) [2022-11-21 16:14:09,155 INFO L895 garLoopResultBuilder]: At program point L1643(lines 1643 1654) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch101#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2022-11-21 16:14:09,155 INFO L899 garLoopResultBuilder]: For program point L1577(lines 1577 1585) no Hoare annotation was computed. [2022-11-21 16:14:09,155 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 16:14:09,155 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1647) no Hoare annotation was computed. [2022-11-21 16:14:09,156 INFO L895 garLoopResultBuilder]: At program point L1660(lines 1660 1668) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2))) (and (<= 0 .cse0) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (<= .cse0 0) (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)))) [2022-11-21 16:14:09,156 INFO L895 garLoopResultBuilder]: At program point L1652(line 1652) the Hoare annotation is: false [2022-11-21 16:14:09,156 INFO L899 garLoopResultBuilder]: For program point L1677(line 1677) no Hoare annotation was computed. [2022-11-21 16:14:09,156 INFO L902 garLoopResultBuilder]: At program point L1669(lines 1669 1680) the Hoare annotation is: true [2022-11-21 16:14:09,156 INFO L899 garLoopResultBuilder]: For program point L1636(line 1636) no Hoare annotation was computed. [2022-11-21 16:14:09,157 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1617) no Hoare annotation was computed. [2022-11-21 16:14:09,157 INFO L902 garLoopResultBuilder]: At program point L1694(line 1694) the Hoare annotation is: true [2022-11-21 16:14:09,157 INFO L899 garLoopResultBuilder]: For program point L1694-1(line 1694) no Hoare annotation was computed. [2022-11-21 16:14:09,157 INFO L899 garLoopResultBuilder]: For program point L1595(line 1595) no Hoare annotation was computed. [2022-11-21 16:14:09,157 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-21 16:14:09,157 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-11-21 16:14:09,158 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-21 16:14:09,158 INFO L895 garLoopResultBuilder]: At program point L1612(lines 1612 1628) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch99#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-21 16:14:09,158 INFO L899 garLoopResultBuilder]: For program point L1579(line 1579) no Hoare annotation was computed. [2022-11-21 16:14:09,158 INFO L899 garLoopResultBuilder]: For program point L1579-1(line 1579) no Hoare annotation was computed. [2022-11-21 16:14:09,158 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1673) no Hoare annotation was computed. [2022-11-21 16:14:09,158 INFO L895 garLoopResultBuilder]: At program point L1637(line 1637) the Hoare annotation is: false [2022-11-21 16:14:09,159 INFO L895 garLoopResultBuilder]: At program point L1604(line 1604) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch96#1| (not (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-21 16:14:09,159 INFO L895 garLoopResultBuilder]: At program point L1571(lines 1571 1587) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch95#1|) [2022-11-21 16:14:09,159 INFO L899 garLoopResultBuilder]: For program point L1604-1(lines 1598 1605) no Hoare annotation was computed. [2022-11-21 16:14:09,163 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:09,165 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:14:09,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:14:09 BoogieIcfgContainer [2022-11-21 16:14:09,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:14:09,183 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:14:09,184 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:14:09,184 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:14:09,184 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:14:05" (3/4) ... [2022-11-21 16:14:09,188 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 16:14:09,195 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-21 16:14:09,195 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-21 16:14:09,201 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-11-21 16:14:09,201 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-21 16:14:09,202 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-21 16:14:09,202 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-21 16:14:09,202 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 16:14:09,264 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:14:09,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:14:09,265 INFO L158 Benchmark]: Toolchain (without parser) took 5729.33ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 105.2MB in the beginning and 108.1MB in the end (delta: -2.9MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2022-11-21 16:14:09,265 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 115.3MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:14:09,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1457.83ms. Allocated memory is still 151.0MB. Free memory was 105.2MB in the beginning and 42.9MB in the end (delta: 62.3MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2022-11-21 16:14:09,266 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.27ms. Allocated memory is still 151.0MB. Free memory was 42.9MB in the beginning and 118.7MB in the end (delta: -75.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2022-11-21 16:14:09,266 INFO L158 Benchmark]: Boogie Preprocessor took 38.31ms. Allocated memory is still 151.0MB. Free memory was 118.7MB in the beginning and 116.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:14:09,267 INFO L158 Benchmark]: RCFGBuilder took 718.62ms. Allocated memory is still 151.0MB. Free memory was 116.6MB in the beginning and 99.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-21 16:14:09,267 INFO L158 Benchmark]: TraceAbstraction took 3346.12ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 98.4MB in the beginning and 112.3MB in the end (delta: -13.8MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2022-11-21 16:14:09,268 INFO L158 Benchmark]: Witness Printer took 81.08ms. Allocated memory is still 182.5MB. Free memory was 112.3MB in the beginning and 108.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 16:14:09,269 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 115.3MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1457.83ms. Allocated memory is still 151.0MB. Free memory was 105.2MB in the beginning and 42.9MB in the end (delta: 62.3MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.27ms. Allocated memory is still 151.0MB. Free memory was 42.9MB in the beginning and 118.7MB in the end (delta: -75.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.31ms. Allocated memory is still 151.0MB. Free memory was 118.7MB in the beginning and 116.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 718.62ms. Allocated memory is still 151.0MB. Free memory was 116.6MB in the beginning and 99.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3346.12ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 98.4MB in the beginning and 112.3MB in the end (delta: -13.8MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Witness Printer took 81.08ms. Allocated memory is still 182.5MB. Free memory was 112.3MB in the beginning and 108.1MB 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: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1647]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1647]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1673]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1673]: 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, 83 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 2663 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1171 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 1492 mSDtfsCounter, 63 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 88 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 111 PreInvPairs, 131 NumberOfFragments, 170 HoareAnnotationTreeSize, 111 FomulaSimplifications, 242 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 183 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 584 NumberOfCodeBlocks, 584 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 567 ConstructedInterpolants, 0 QuantifiedInterpolants, 667 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 128/128 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1571]: Loop Invariant Derived loop invariant: data <= 2147483647 && aux-switch(8) { case 7: printLine("Benign, fixed string"); break; default: if (data > (-0x7fffffff - 1)) { int result = data - 1; printIntLine(result); } else { printLine("data value is too large to perform subtraction."); } break; }-aux - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: data <= 2147483647 && aux-switch(6) { case 6: { char inputBuffer[(3 * sizeof(data) + 2)] = ""; if (fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0)) { data = atoi(inputBuffer); } else { printLine("fgets() failed."); } } break; default: printLine("Benign, fixed string"); break; }-aux - InvariantResult [Line: 1593]: Loop Invariant Derived loop invariant: (aux-switch(6) { case 6: { char inputBuffer[(3 * sizeof(data) + 2)] = ""; if (fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0)) { data = atoi(inputBuffer); } else { printLine("fgets() failed."); } } break; default: printLine("Benign, fixed string"); break; }-aux && data <= 2147483647) && data <= 2147483647 - InvariantResult [Line: 1660]: Loop Invariant Derived loop invariant: (((0 <= data + 2 && data <= 2147483647) && data <= 2147483647) && data + 2 <= 0) && 0 <= 2 + data - InvariantResult [Line: 1634]: Loop Invariant Derived loop invariant: (((2 + data <= 0 && data <= 2147483647) && aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = -2; break; }-aux) && data <= 2147483647) && 0 <= 2 + data - InvariantResult [Line: 1669]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1689]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1643]: Loop Invariant Derived loop invariant: ((data <= 2147483647 && aux-switch(7) { case 7: { int result = data - 1; printIntLine(result); } break; default: printLine("Benign, fixed string"); break; }-aux) && data <= 2147483647) && 0 <= 2 + data - InvariantResult [Line: 1612]: Loop Invariant Derived loop invariant: (aux-switch(7) { case 7: if (data > (-0x7fffffff - 1)) { int result = data - 1; printIntLine(result); } else { printLine("data value is too large to perform subtraction."); } break; default: printLine("Benign, fixed string"); break; }-aux && data <= 2147483647) && data <= 2147483647 RESULT: Ultimate proved your program to be correct! [2022-11-21 16:14:09,295 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da2c6ca-939a-439c-931f-4413dffb1189/bin/uautomizer-vX5HgA9Q3a/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