./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:58:33,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:58:33,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:58:33,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:58:33,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:58:33,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:58:33,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:58:33,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:58:33,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:58:33,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:58:33,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:58:33,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:58:33,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:58:33,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:58:33,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:58:33,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:58:33,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:58:33,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:58:33,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:58:33,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:58:33,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:58:33,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:58:33,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:58:33,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:58:33,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:58:33,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:58:33,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:58:33,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:58:33,567 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:58:33,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:58:33,568 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:58:33,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:58:33,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:58:33,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:58:33,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:58:33,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:58:33,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:58:33,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:58:33,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:58:33,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:58:33,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:58:33,585 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-25 16:58:33,630 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:58:33,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:58:33,631 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:58:33,631 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:58:33,632 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:58:33,632 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:58:33,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:58:33,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:58:33,633 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:58:33,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:58:33,634 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:58:33,634 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:58:33,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:58:33,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:58:33,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:58:33,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:58:33,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:58:33,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:58:33,635 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 16:58:33,635 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:58:33,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:58:33,636 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:58:33,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:58:33,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:58:33,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:58:33,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:58:33,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:58:33,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:58:33,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:58:33,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:58:33,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:58:33,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:58:33,643 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:58:33,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:58:33,644 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:58:33,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:58:33,645 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2022-11-25 16:58:33,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:58:33,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:58:33,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:58:33,965 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:58:33,966 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:58:33,967 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-11-25 16:58:37,159 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:58:37,370 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:58:37,371 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-11-25 16:58:37,383 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R/data/213ab6f01/4a01d38539f44227949a5b28aa3c44dc/FLAGb7815abf4 [2022-11-25 16:58:37,398 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R/data/213ab6f01/4a01d38539f44227949a5b28aa3c44dc [2022-11-25 16:58:37,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:58:37,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:58:37,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:58:37,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:58:37,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:58:37,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7edf81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37, skipping insertion in model container [2022-11-25 16:58:37,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:58:37,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:58:37,615 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2022-11-25 16:58:37,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:58:37,675 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:58:37,688 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2022-11-25 16:58:37,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:58:37,727 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:58:37,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37 WrapperNode [2022-11-25 16:58:37,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:58:37,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:58:37,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:58:37,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:58:37,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,775 INFO L138 Inliner]: procedures = 30, calls = 34, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 219 [2022-11-25 16:58:37,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:58:37,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:58:37,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:58:37,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:58:37,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,803 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:58:37,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:58:37,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:58:37,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:58:37,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (1/1) ... [2022-11-25 16:58:37,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:58:37,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:37,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:37,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:58:37,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:58:37,906 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-25 16:58:37,906 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-25 16:58:37,906 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-25 16:58:37,909 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-25 16:58:37,909 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-25 16:58:37,909 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-25 16:58:37,909 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-25 16:58:37,909 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-25 16:58:37,910 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-25 16:58:37,910 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-25 16:58:37,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:58:37,910 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-25 16:58:37,911 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-25 16:58:37,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:58:37,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:58:38,054 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:58:38,056 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:58:38,511 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:58:38,523 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:58:38,527 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 16:58:38,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:58:38 BoogieIcfgContainer [2022-11-25 16:58:38,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:58:38,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:58:38,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:58:38,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:58:38,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:58:37" (1/3) ... [2022-11-25 16:58:38,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c99648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:58:38, skipping insertion in model container [2022-11-25 16:58:38,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:37" (2/3) ... [2022-11-25 16:58:38,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c99648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:58:38, skipping insertion in model container [2022-11-25 16:58:38,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:58:38" (3/3) ... [2022-11-25 16:58:38,554 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2022-11-25 16:58:38,578 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:58:38,579 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-25 16:58:38,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:58:38,656 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;@4dfcf096, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:58:38,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-25 16:58:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 92 states have internal predecessors, (134), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 16:58:38,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 16:58:38,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:38,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:38,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:38,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:38,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1696984144, now seen corresponding path program 1 times [2022-11-25 16:58:38,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:38,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357814372] [2022-11-25 16:58:38,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:38,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:39,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:39,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:39,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:39,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:39,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:39,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357814372] [2022-11-25 16:58:39,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357814372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:39,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:39,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:58:39,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918855898] [2022-11-25 16:58:39,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:39,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:58:39,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:39,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:58:39,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:58:39,247 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 92 states have internal predecessors, (134), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:40,301 INFO L93 Difference]: Finished difference Result 357 states and 529 transitions. [2022-11-25 16:58:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:58:40,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-25 16:58:40,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:40,316 INFO L225 Difference]: With dead ends: 357 [2022-11-25 16:58:40,316 INFO L226 Difference]: Without dead ends: 243 [2022-11-25 16:58:40,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:58:40,324 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 307 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:40,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 426 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 16:58:40,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-25 16:58:40,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 200. [2022-11-25 16:58:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 158 states have (on average 1.4556962025316456) internal successors, (230), 163 states have internal predecessors, (230), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-11-25 16:58:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 283 transitions. [2022-11-25 16:58:40,403 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 283 transitions. Word has length 55 [2022-11-25 16:58:40,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:40,404 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 283 transitions. [2022-11-25 16:58:40,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:40,404 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 283 transitions. [2022-11-25 16:58:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 16:58:40,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:40,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:40,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:58:40,407 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:40,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:40,408 INFO L85 PathProgramCache]: Analyzing trace with hash 767450028, now seen corresponding path program 1 times [2022-11-25 16:58:40,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:40,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654136826] [2022-11-25 16:58:40,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:40,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:40,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:40,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:40,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:40,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:40,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:40,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:40,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654136826] [2022-11-25 16:58:40,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654136826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:40,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:40,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:58:40,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696564455] [2022-11-25 16:58:40,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:40,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:58:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:40,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:58:40,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:58:40,713 INFO L87 Difference]: Start difference. First operand 200 states and 283 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:41,582 INFO L93 Difference]: Finished difference Result 545 states and 773 transitions. [2022-11-25 16:58:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 16:58:41,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-25 16:58:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:41,594 INFO L225 Difference]: With dead ends: 545 [2022-11-25 16:58:41,595 INFO L226 Difference]: Without dead ends: 354 [2022-11-25 16:58:41,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-25 16:58:41,605 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 291 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:41,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 678 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 16:58:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-25 16:58:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 288. [2022-11-25 16:58:41,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 229 states have (on average 1.445414847161572) internal successors, (331), 235 states have internal predecessors, (331), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-11-25 16:58:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 406 transitions. [2022-11-25 16:58:41,681 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 406 transitions. Word has length 55 [2022-11-25 16:58:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:41,682 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 406 transitions. [2022-11-25 16:58:41,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:41,683 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 406 transitions. [2022-11-25 16:58:41,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 16:58:41,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:41,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:41,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:58:41,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:41,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:41,697 INFO L85 PathProgramCache]: Analyzing trace with hash -129943250, now seen corresponding path program 1 times [2022-11-25 16:58:41,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:41,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718769428] [2022-11-25 16:58:41,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:41,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:41,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:41,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:41,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:41,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:41,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:41,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:41,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718769428] [2022-11-25 16:58:41,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718769428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:41,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:41,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:58:41,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574338440] [2022-11-25 16:58:41,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:41,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:58:41,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:41,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:58:41,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:58:41,904 INFO L87 Difference]: Start difference. First operand 288 states and 406 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:42,684 INFO L93 Difference]: Finished difference Result 890 states and 1258 transitions. [2022-11-25 16:58:42,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:58:42,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-25 16:58:42,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:42,689 INFO L225 Difference]: With dead ends: 890 [2022-11-25 16:58:42,689 INFO L226 Difference]: Without dead ends: 611 [2022-11-25 16:58:42,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-25 16:58:42,692 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 346 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:42,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 666 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 16:58:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-11-25 16:58:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 457. [2022-11-25 16:58:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 366 states have (on average 1.4316939890710383) internal successors, (524), 374 states have internal predecessors, (524), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-11-25 16:58:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 643 transitions. [2022-11-25 16:58:42,773 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 643 transitions. Word has length 55 [2022-11-25 16:58:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:42,773 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 643 transitions. [2022-11-25 16:58:42,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 643 transitions. [2022-11-25 16:58:42,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 16:58:42,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:42,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:42,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:58:42,777 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:42,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:42,778 INFO L85 PathProgramCache]: Analyzing trace with hash 118203244, now seen corresponding path program 1 times [2022-11-25 16:58:42,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:42,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411373314] [2022-11-25 16:58:42,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:42,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:42,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:42,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:42,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:42,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:42,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:42,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411373314] [2022-11-25 16:58:42,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411373314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:42,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:42,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:58:42,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494894534] [2022-11-25 16:58:42,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:42,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:58:42,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:42,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:58:42,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:58:42,919 INFO L87 Difference]: Start difference. First operand 457 states and 643 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:43,834 INFO L93 Difference]: Finished difference Result 1424 states and 2007 transitions. [2022-11-25 16:58:43,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:58:43,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-25 16:58:43,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:43,844 INFO L225 Difference]: With dead ends: 1424 [2022-11-25 16:58:43,845 INFO L226 Difference]: Without dead ends: 976 [2022-11-25 16:58:43,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-25 16:58:43,861 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 286 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:43,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 640 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 16:58:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2022-11-25 16:58:43,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 758. [2022-11-25 16:58:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 609 states have (on average 1.4220032840722496) internal successors, (866), 621 states have internal predecessors, (866), 85 states have call successors, (85), 52 states have call predecessors, (85), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2022-11-25 16:58:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1071 transitions. [2022-11-25 16:58:43,979 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1071 transitions. Word has length 55 [2022-11-25 16:58:43,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:43,986 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 1071 transitions. [2022-11-25 16:58:43,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1071 transitions. [2022-11-25 16:58:43,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 16:58:43,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:43,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:43,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:58:43,994 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:43,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:43,995 INFO L85 PathProgramCache]: Analyzing trace with hash 541849966, now seen corresponding path program 1 times [2022-11-25 16:58:43,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:43,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564850639] [2022-11-25 16:58:43,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:43,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:44,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:44,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:44,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:44,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:44,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:44,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:44,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564850639] [2022-11-25 16:58:44,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564850639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:44,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:44,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:58:44,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916864409] [2022-11-25 16:58:44,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:44,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:58:44,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:44,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:58:44,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:58:44,168 INFO L87 Difference]: Start difference. First operand 758 states and 1071 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:44,942 INFO L93 Difference]: Finished difference Result 2117 states and 3003 transitions. [2022-11-25 16:58:44,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:58:44,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-11-25 16:58:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:44,951 INFO L225 Difference]: With dead ends: 2117 [2022-11-25 16:58:44,951 INFO L226 Difference]: Without dead ends: 1369 [2022-11-25 16:58:44,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-25 16:58:44,954 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 407 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:44,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 486 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:58:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2022-11-25 16:58:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1162. [2022-11-25 16:58:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 930 states have (on average 1.3989247311827957) internal successors, (1301), 951 states have internal predecessors, (1301), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-25 16:58:45,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1614 transitions. [2022-11-25 16:58:45,077 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1614 transitions. Word has length 55 [2022-11-25 16:58:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:45,078 INFO L495 AbstractCegarLoop]: Abstraction has 1162 states and 1614 transitions. [2022-11-25 16:58:45,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1614 transitions. [2022-11-25 16:58:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:58:45,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:45,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:45,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:58:45,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:45,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:45,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2042576822, now seen corresponding path program 1 times [2022-11-25 16:58:45,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:45,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243478248] [2022-11-25 16:58:45,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:45,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:45,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:45,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:45,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:45,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:45,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:45,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:45,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:45,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243478248] [2022-11-25 16:58:45,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243478248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:45,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:45,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:58:45,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030116182] [2022-11-25 16:58:45,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:45,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:58:45,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:45,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:58:45,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:58:45,256 INFO L87 Difference]: Start difference. First operand 1162 states and 1614 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:45,995 INFO L93 Difference]: Finished difference Result 2531 states and 3569 transitions. [2022-11-25 16:58:45,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 16:58:45,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-25 16:58:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:46,005 INFO L225 Difference]: With dead ends: 2531 [2022-11-25 16:58:46,006 INFO L226 Difference]: Without dead ends: 1379 [2022-11-25 16:58:46,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-25 16:58:46,012 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 170 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:46,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 476 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:58:46,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-11-25 16:58:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1177. [2022-11-25 16:58:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 945 states have (on average 1.3830687830687831) internal successors, (1307), 966 states have internal predecessors, (1307), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-25 16:58:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1620 transitions. [2022-11-25 16:58:46,151 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1620 transitions. Word has length 56 [2022-11-25 16:58:46,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:46,151 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1620 transitions. [2022-11-25 16:58:46,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1620 transitions. [2022-11-25 16:58:46,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:58:46,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:46,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:46,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:58:46,155 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:46,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:46,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2114963380, now seen corresponding path program 1 times [2022-11-25 16:58:46,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:46,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798222471] [2022-11-25 16:58:46,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:46,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:46,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:46,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:46,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:46,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:46,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:46,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:46,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798222471] [2022-11-25 16:58:46,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798222471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:46,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:46,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:58:46,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868512023] [2022-11-25 16:58:46,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:46,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:58:46,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:46,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:58:46,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:58:46,315 INFO L87 Difference]: Start difference. First operand 1177 states and 1620 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:47,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:47,158 INFO L93 Difference]: Finished difference Result 2586 states and 3614 transitions. [2022-11-25 16:58:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 16:58:47,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-25 16:58:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:47,169 INFO L225 Difference]: With dead ends: 2586 [2022-11-25 16:58:47,169 INFO L226 Difference]: Without dead ends: 1419 [2022-11-25 16:58:47,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-11-25 16:58:47,175 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 135 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:47,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 471 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:58:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2022-11-25 16:58:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1219. [2022-11-25 16:58:47,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 987 states have (on average 1.3667679837892603) internal successors, (1349), 1008 states have internal predecessors, (1349), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-25 16:58:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1662 transitions. [2022-11-25 16:58:47,305 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1662 transitions. Word has length 56 [2022-11-25 16:58:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:47,306 INFO L495 AbstractCegarLoop]: Abstraction has 1219 states and 1662 transitions. [2022-11-25 16:58:47,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:47,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1662 transitions. [2022-11-25 16:58:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:58:47,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:47,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:47,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:58:47,309 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:47,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:47,310 INFO L85 PathProgramCache]: Analyzing trace with hash -191735346, now seen corresponding path program 1 times [2022-11-25 16:58:47,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:47,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093095543] [2022-11-25 16:58:47,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:47,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:47,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:47,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:47,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:47,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:47,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:47,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:47,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093095543] [2022-11-25 16:58:47,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093095543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:47,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:47,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:58:47,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945751760] [2022-11-25 16:58:47,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:47,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:58:47,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:47,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:58:47,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:58:47,546 INFO L87 Difference]: Start difference. First operand 1219 states and 1662 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:48,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:48,327 INFO L93 Difference]: Finished difference Result 1767 states and 2410 transitions. [2022-11-25 16:58:48,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 16:58:48,328 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-25 16:58:48,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:48,335 INFO L225 Difference]: With dead ends: 1767 [2022-11-25 16:58:48,336 INFO L226 Difference]: Without dead ends: 1048 [2022-11-25 16:58:48,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-11-25 16:58:48,339 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 453 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:48,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 459 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:58:48,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2022-11-25 16:58:48,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 878. [2022-11-25 16:58:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 709 states have (on average 1.3540197461212975) internal successors, (960), 723 states have internal predecessors, (960), 100 states have call successors, (100), 59 states have call predecessors, (100), 65 states have return successors, (115), 99 states have call predecessors, (115), 100 states have call successors, (115) [2022-11-25 16:58:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1175 transitions. [2022-11-25 16:58:48,449 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1175 transitions. Word has length 56 [2022-11-25 16:58:48,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:48,449 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 1175 transitions. [2022-11-25 16:58:48,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1175 transitions. [2022-11-25 16:58:48,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:58:48,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:48,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:48,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:58:48,452 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:48,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:48,453 INFO L85 PathProgramCache]: Analyzing trace with hash 27119372, now seen corresponding path program 1 times [2022-11-25 16:58:48,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:48,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165444311] [2022-11-25 16:58:48,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:48,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:48,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:48,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:48,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:48,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:48,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:48,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:48,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165444311] [2022-11-25 16:58:48,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165444311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:48,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:48,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:58:48,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527557003] [2022-11-25 16:58:48,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:48,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:58:48,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:48,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:58:48,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:58:48,615 INFO L87 Difference]: Start difference. First operand 878 states and 1175 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:49,312 INFO L93 Difference]: Finished difference Result 1710 states and 2296 transitions. [2022-11-25 16:58:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 16:58:49,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-25 16:58:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:49,319 INFO L225 Difference]: With dead ends: 1710 [2022-11-25 16:58:49,319 INFO L226 Difference]: Without dead ends: 1076 [2022-11-25 16:58:49,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-11-25 16:58:49,324 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 438 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:49,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 454 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:58:49,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2022-11-25 16:58:49,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 872. [2022-11-25 16:58:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 705 states have (on average 1.348936170212766) internal successors, (951), 717 states have internal predecessors, (951), 100 states have call successors, (100), 59 states have call predecessors, (100), 63 states have return successors, (107), 97 states have call predecessors, (107), 100 states have call successors, (107) [2022-11-25 16:58:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1158 transitions. [2022-11-25 16:58:49,427 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1158 transitions. Word has length 56 [2022-11-25 16:58:49,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:49,427 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 1158 transitions. [2022-11-25 16:58:49,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1158 transitions. [2022-11-25 16:58:49,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:58:49,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:49,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:49,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:58:49,429 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:49,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:49,430 INFO L85 PathProgramCache]: Analyzing trace with hash 449821198, now seen corresponding path program 1 times [2022-11-25 16:58:49,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:49,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042617866] [2022-11-25 16:58:49,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:49,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:49,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:49,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:49,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:49,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:49,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:49,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:49,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042617866] [2022-11-25 16:58:49,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042617866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:49,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:49,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:58:49,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900963585] [2022-11-25 16:58:49,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:49,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:58:49,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:49,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:58:49,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:58:49,595 INFO L87 Difference]: Start difference. First operand 872 states and 1158 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:50,326 INFO L93 Difference]: Finished difference Result 1649 states and 2185 transitions. [2022-11-25 16:58:50,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 16:58:50,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-25 16:58:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:50,331 INFO L225 Difference]: With dead ends: 1649 [2022-11-25 16:58:50,331 INFO L226 Difference]: Without dead ends: 932 [2022-11-25 16:58:50,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-11-25 16:58:50,334 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 331 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:50,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 550 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:58:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-11-25 16:58:50,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 760. [2022-11-25 16:58:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 618 states have (on average 1.343042071197411) internal successors, (830), 628 states have internal predecessors, (830), 85 states have call successors, (85), 51 states have call predecessors, (85), 53 states have return successors, (87), 81 states have call predecessors, (87), 85 states have call successors, (87) [2022-11-25 16:58:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1002 transitions. [2022-11-25 16:58:50,422 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1002 transitions. Word has length 56 [2022-11-25 16:58:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:50,423 INFO L495 AbstractCegarLoop]: Abstraction has 760 states and 1002 transitions. [2022-11-25 16:58:50,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1002 transitions. [2022-11-25 16:58:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:58:50,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:50,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:50,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:58:50,425 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:50,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash -367827252, now seen corresponding path program 1 times [2022-11-25 16:58:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:50,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716770355] [2022-11-25 16:58:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:50,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:50,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:50,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:50,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:50,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:50,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:50,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:50,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716770355] [2022-11-25 16:58:50,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716770355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:50,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:50,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:58:50,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540145664] [2022-11-25 16:58:50,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:50,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:58:50,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:50,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:58:50,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:58:50,525 INFO L87 Difference]: Start difference. First operand 760 states and 1002 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:51,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:51,100 INFO L93 Difference]: Finished difference Result 2370 states and 3182 transitions. [2022-11-25 16:58:51,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:58:51,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-25 16:58:51,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:51,109 INFO L225 Difference]: With dead ends: 2370 [2022-11-25 16:58:51,110 INFO L226 Difference]: Without dead ends: 1621 [2022-11-25 16:58:51,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-25 16:58:51,113 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 418 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:51,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 302 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:58:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-11-25 16:58:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1447. [2022-11-25 16:58:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1177 states have (on average 1.3271028037383177) internal successors, (1562), 1194 states have internal predecessors, (1562), 158 states have call successors, (158), 97 states have call predecessors, (158), 108 states have return successors, (201), 157 states have call predecessors, (201), 158 states have call successors, (201) [2022-11-25 16:58:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1921 transitions. [2022-11-25 16:58:51,253 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1921 transitions. Word has length 56 [2022-11-25 16:58:51,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:51,253 INFO L495 AbstractCegarLoop]: Abstraction has 1447 states and 1921 transitions. [2022-11-25 16:58:51,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:58:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1921 transitions. [2022-11-25 16:58:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 16:58:51,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:51,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:51,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:58:51,256 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1034084368, now seen corresponding path program 1 times [2022-11-25 16:58:51,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:51,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122211543] [2022-11-25 16:58:51,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:51,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:51,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:51,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:51,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:51,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:51,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:58:51,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:51,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122211543] [2022-11-25 16:58:51,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122211543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:51,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:51,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:58:51,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331136721] [2022-11-25 16:58:51,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:51,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:51,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:51,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:51,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:51,329 INFO L87 Difference]: Start difference. First operand 1447 states and 1921 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-25 16:58:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:51,933 INFO L93 Difference]: Finished difference Result 4136 states and 5521 transitions. [2022-11-25 16:58:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:58:51,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2022-11-25 16:58:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:51,947 INFO L225 Difference]: With dead ends: 4136 [2022-11-25 16:58:51,947 INFO L226 Difference]: Without dead ends: 2703 [2022-11-25 16:58:51,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:58:51,953 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 320 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:51,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 350 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:58:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2022-11-25 16:58:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2357. [2022-11-25 16:58:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 1913 states have (on average 1.311552535284893) internal successors, (2509), 1940 states have internal predecessors, (2509), 258 states have call successors, (258), 164 states have call predecessors, (258), 182 states have return successors, (330), 254 states have call predecessors, (330), 258 states have call successors, (330) [2022-11-25 16:58:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3097 transitions. [2022-11-25 16:58:52,171 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3097 transitions. Word has length 57 [2022-11-25 16:58:52,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:52,172 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 3097 transitions. [2022-11-25 16:58:52,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-25 16:58:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3097 transitions. [2022-11-25 16:58:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 16:58:52,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:52,174 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:52,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:58:52,174 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:52,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:52,175 INFO L85 PathProgramCache]: Analyzing trace with hash -286197174, now seen corresponding path program 1 times [2022-11-25 16:58:52,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:52,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394848649] [2022-11-25 16:58:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:52,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:52,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:52,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:52,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:52,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:52,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:52,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 16:58:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 16:58:52,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:52,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394848649] [2022-11-25 16:58:52,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394848649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:52,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:52,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:58:52,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15013838] [2022-11-25 16:58:52,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:52,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:58:52,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:52,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:58:52,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:58:52,267 INFO L87 Difference]: Start difference. First operand 2357 states and 3097 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 16:58:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:53,524 INFO L93 Difference]: Finished difference Result 7472 states and 9914 transitions. [2022-11-25 16:58:53,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 16:58:53,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 74 [2022-11-25 16:58:53,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:53,559 INFO L225 Difference]: With dead ends: 7472 [2022-11-25 16:58:53,559 INFO L226 Difference]: Without dead ends: 5131 [2022-11-25 16:58:53,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-25 16:58:53,567 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 703 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:53,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 483 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 16:58:53,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5131 states. [2022-11-25 16:58:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5131 to 4605. [2022-11-25 16:58:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4605 states, 3722 states have (on average 1.2888232133261688) internal successors, (4797), 3791 states have internal predecessors, (4797), 496 states have call successors, (496), 321 states have call predecessors, (496), 383 states have return successors, (778), 496 states have call predecessors, (778), 496 states have call successors, (778) [2022-11-25 16:58:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6071 transitions. [2022-11-25 16:58:54,104 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6071 transitions. Word has length 74 [2022-11-25 16:58:54,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:54,105 INFO L495 AbstractCegarLoop]: Abstraction has 4605 states and 6071 transitions. [2022-11-25 16:58:54,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 16:58:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6071 transitions. [2022-11-25 16:58:54,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-25 16:58:54,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:54,108 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:54,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:58:54,109 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:54,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:54,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1327486831, now seen corresponding path program 1 times [2022-11-25 16:58:54,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:54,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050250092] [2022-11-25 16:58:54,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:54,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:54,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:54,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:54,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:54,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:54,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:54,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 16:58:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:54,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 16:58:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:54,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 16:58:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 16:58:54,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:54,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050250092] [2022-11-25 16:58:54,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050250092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:54,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:54,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:58:54,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871517258] [2022-11-25 16:58:54,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:54,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:58:54,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:54,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:58:54,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:58:54,361 INFO L87 Difference]: Start difference. First operand 4605 states and 6071 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 16:58:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:55,315 INFO L93 Difference]: Finished difference Result 8872 states and 11640 transitions. [2022-11-25 16:58:55,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:58:55,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2022-11-25 16:58:55,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:55,338 INFO L225 Difference]: With dead ends: 8872 [2022-11-25 16:58:55,338 INFO L226 Difference]: Without dead ends: 5201 [2022-11-25 16:58:55,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-11-25 16:58:55,347 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 519 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:55,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 311 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:58:55,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2022-11-25 16:58:55,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 4573. [2022-11-25 16:58:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 3686 states have (on average 1.2769940314704287) internal successors, (4707), 3759 states have internal predecessors, (4707), 496 states have call successors, (496), 321 states have call predecessors, (496), 387 states have return successors, (697), 496 states have call predecessors, (697), 496 states have call successors, (697) [2022-11-25 16:58:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 5900 transitions. [2022-11-25 16:58:55,822 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 5900 transitions. Word has length 90 [2022-11-25 16:58:55,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:55,823 INFO L495 AbstractCegarLoop]: Abstraction has 4573 states and 5900 transitions. [2022-11-25 16:58:55,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 16:58:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 5900 transitions. [2022-11-25 16:58:55,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-25 16:58:55,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:55,826 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:55,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 16:58:55,827 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:55,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:55,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1400722515, now seen corresponding path program 1 times [2022-11-25 16:58:55,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:55,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929610399] [2022-11-25 16:58:55,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:55,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:55,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:55,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:55,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:55,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:55,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 16:58:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:55,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 16:58:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:55,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 16:58:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-25 16:58:55,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:55,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929610399] [2022-11-25 16:58:55,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929610399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:55,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:55,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:58:55,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785340291] [2022-11-25 16:58:55,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:55,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:55,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:55,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:55,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:55,901 INFO L87 Difference]: Start difference. First operand 4573 states and 5900 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 16:58:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:56,577 INFO L93 Difference]: Finished difference Result 5037 states and 6517 transitions. [2022-11-25 16:58:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:58:56,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2022-11-25 16:58:56,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:56,602 INFO L225 Difference]: With dead ends: 5037 [2022-11-25 16:58:56,602 INFO L226 Difference]: Without dead ends: 4141 [2022-11-25 16:58:56,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:58:56,607 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 265 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:56,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 211 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:58:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2022-11-25 16:58:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 3679. [2022-11-25 16:58:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 2972 states have (on average 1.281965006729475) internal successors, (3810), 3033 states have internal predecessors, (3810), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (562), 393 states have call predecessors, (562), 390 states have call successors, (562) [2022-11-25 16:58:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 4762 transitions. [2022-11-25 16:58:57,032 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 4762 transitions. Word has length 90 [2022-11-25 16:58:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:57,032 INFO L495 AbstractCegarLoop]: Abstraction has 3679 states and 4762 transitions. [2022-11-25 16:58:57,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 16:58:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4762 transitions. [2022-11-25 16:58:57,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-25 16:58:57,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:57,035 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:57,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 16:58:57,035 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:57,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:57,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1500452604, now seen corresponding path program 1 times [2022-11-25 16:58:57,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:57,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382754273] [2022-11-25 16:58:57,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:57,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:57,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:57,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:57,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:57,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:57,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:57,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-25 16:58:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:57,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 16:58:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:57,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 16:58:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 16:58:57,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:57,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382754273] [2022-11-25 16:58:57,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382754273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:57,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:57,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:58:57,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901059073] [2022-11-25 16:58:57,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:57,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:58:57,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:57,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:58:57,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:58:57,157 INFO L87 Difference]: Start difference. First operand 3679 states and 4762 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 16:58:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:58,583 INFO L93 Difference]: Finished difference Result 7051 states and 9090 transitions. [2022-11-25 16:58:58,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 16:58:58,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-11-25 16:58:58,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:58,612 INFO L225 Difference]: With dead ends: 7051 [2022-11-25 16:58:58,612 INFO L226 Difference]: Without dead ends: 4058 [2022-11-25 16:58:58,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-11-25 16:58:58,622 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 1025 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:58,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 565 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 16:58:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2022-11-25 16:58:59,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 3679. [2022-11-25 16:58:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 2972 states have (on average 1.2671601615074024) internal successors, (3766), 3033 states have internal predecessors, (3766), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (496), 393 states have call predecessors, (496), 390 states have call successors, (496) [2022-11-25 16:58:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 4652 transitions. [2022-11-25 16:58:59,021 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 4652 transitions. Word has length 91 [2022-11-25 16:58:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:58:59,022 INFO L495 AbstractCegarLoop]: Abstraction has 3679 states and 4652 transitions. [2022-11-25 16:58:59,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 16:58:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4652 transitions. [2022-11-25 16:58:59,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-25 16:58:59,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:58:59,025 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:58:59,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 16:58:59,025 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:58:59,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash -78861023, now seen corresponding path program 1 times [2022-11-25 16:58:59,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:59,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857303558] [2022-11-25 16:58:59,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:59,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:59,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 16:58:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:59,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 16:58:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:59,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 16:58:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:59,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:58:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:59,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 16:58:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 16:58:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:59,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 16:58:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:59,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 16:58:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:58:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 16:58:59,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:58:59,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857303558] [2022-11-25 16:58:59,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857303558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:58:59,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:58:59,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:58:59,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452760613] [2022-11-25 16:58:59,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:58:59,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:58:59,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:58:59,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:58:59,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:58:59,137 INFO L87 Difference]: Start difference. First operand 3679 states and 4652 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 16:58:59,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:58:59,749 INFO L93 Difference]: Finished difference Result 4141 states and 5269 transitions. [2022-11-25 16:58:59,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:58:59,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 97 [2022-11-25 16:58:59,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:58:59,768 INFO L225 Difference]: With dead ends: 4141 [2022-11-25 16:58:59,768 INFO L226 Difference]: Without dead ends: 4140 [2022-11-25 16:58:59,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:58:59,772 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 260 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:58:59,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 199 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:58:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2022-11-25 16:59:00,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 3678. [2022-11-25 16:59:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 2972 states have (on average 1.2631224764468372) internal successors, (3754), 3032 states have internal predecessors, (3754), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (496), 393 states have call predecessors, (496), 390 states have call successors, (496) [2022-11-25 16:59:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4640 transitions. [2022-11-25 16:59:00,408 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4640 transitions. Word has length 97 [2022-11-25 16:59:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:59:00,409 INFO L495 AbstractCegarLoop]: Abstraction has 3678 states and 4640 transitions. [2022-11-25 16:59:00,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 16:59:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4640 transitions. [2022-11-25 16:59:00,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-25 16:59:00,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:59:00,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:00,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 16:59:00,414 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 16:59:00,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:00,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1850275866, now seen corresponding path program 1 times [2022-11-25 16:59:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:00,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291936996] [2022-11-25 16:59:00,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:00,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:59:00,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:59:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:59:00,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:59:00,509 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:59:00,510 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-25 16:59:00,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-25 16:59:00,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-25 16:59:00,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-25 16:59:00,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 16:59:00,520 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:00,526 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:59:00,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:59:00 BoogieIcfgContainer [2022-11-25 16:59:00,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:59:00,666 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:59:00,666 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:59:00,666 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:59:00,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:58:38" (3/4) ... [2022-11-25 16:59:00,673 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 16:59:00,858 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 16:59:00,859 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:59:00,859 INFO L158 Benchmark]: Toolchain (without parser) took 23457.68ms. Allocated memory was 163.6MB in the beginning and 778.0MB in the end (delta: 614.5MB). Free memory was 124.7MB in the beginning and 534.6MB in the end (delta: -409.9MB). Peak memory consumption was 207.2MB. Max. memory is 16.1GB. [2022-11-25 16:59:00,860 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 163.6MB. Free memory was 128.3MB in the beginning and 128.3MB in the end (delta: 81.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:59:00,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.96ms. Allocated memory is still 163.6MB. Free memory was 124.7MB in the beginning and 111.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 16:59:00,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.29ms. Allocated memory is still 163.6MB. Free memory was 111.3MB in the beginning and 109.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:59:00,861 INFO L158 Benchmark]: Boogie Preprocessor took 30.37ms. Allocated memory is still 163.6MB. Free memory was 109.7MB in the beginning and 107.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:59:00,874 INFO L158 Benchmark]: RCFGBuilder took 729.80ms. Allocated memory is still 163.6MB. Free memory was 107.9MB in the beginning and 90.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 16:59:00,874 INFO L158 Benchmark]: TraceAbstraction took 22123.95ms. Allocated memory was 163.6MB in the beginning and 778.0MB in the end (delta: 614.5MB). Free memory was 89.5MB in the beginning and 545.1MB in the end (delta: -455.6MB). Peak memory consumption was 161.1MB. Max. memory is 16.1GB. [2022-11-25 16:59:00,875 INFO L158 Benchmark]: Witness Printer took 193.24ms. Allocated memory is still 778.0MB. Free memory was 545.1MB in the beginning and 534.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 16:59:00,877 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.66ms. Allocated memory is still 163.6MB. Free memory was 128.3MB in the beginning and 128.3MB in the end (delta: 81.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.96ms. Allocated memory is still 163.6MB. Free memory was 124.7MB in the beginning and 111.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.29ms. Allocated memory is still 163.6MB. Free memory was 111.3MB in the beginning and 109.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.37ms. Allocated memory is still 163.6MB. Free memory was 109.7MB in the beginning and 107.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 729.80ms. Allocated memory is still 163.6MB. Free memory was 107.9MB in the beginning and 90.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22123.95ms. Allocated memory was 163.6MB in the beginning and 778.0MB in the end (delta: 614.5MB). Free memory was 89.5MB in the beginning and 545.1MB in the end (delta: -455.6MB). Peak memory consumption was 161.1MB. Max. memory is 16.1GB. * Witness Printer took 193.24ms. Allocated memory is still 778.0MB. Free memory was 545.1MB in the beginning and 534.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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 - CounterExampleResult [Line: 107]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L473] int __retres1 ; [L477] CALL init_model() [L388] m_i = 1 [L389] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L477] RET init_model() [L478] CALL start_simulation() [L414] int kernel_st ; [L415] int tmp ; [L416] int tmp___0 ; [L420] kernel_st = 0 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L421] FCALL update_channels() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] CALL init_threads() [L170] COND TRUE m_i == 1 [L171] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L175] COND TRUE t1_i == 1 [L176] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] RET init_threads() [L423] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L259] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L264] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L269] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L274] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L423] RET fire_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L124] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L134] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L143] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L153] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L424] RET activate_threads() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L287] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L292] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L297] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L302] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] RET reset_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L428] COND TRUE 1 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L431] kernel_st = 1 [L432] CALL eval() [L206] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L210] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L201] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L99] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L240] RET transmit1() [L210] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L201] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND TRUE \read(tmp_ndt_1) [L225] m_st = 1 [L226] CALL master() [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L55] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L61] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L341] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L124] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L134] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=2147483647] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L143] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L144] COND TRUE E_1 == 1 [L145] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND TRUE \read(tmp___0) [L328] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=2147483647] [L341] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L226] RET master() [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L107] token += 1 VAL [E_1=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 113 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 21.9s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6841 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6674 mSDsluCounter, 7727 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5560 mSDsCounter, 1362 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7926 IncrementalHoareTripleChecker+Invalid, 9288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1362 mSolverCounterUnsat, 2167 mSDtfsCounter, 7926 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 479 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4605occurred in iteration=13, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 4613 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1208 NumberOfCodeBlocks, 1208 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1093 ConstructedInterpolants, 0 QuantifiedInterpolants, 2434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 119/119 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 RESULT: Ultimate proved your program to be incorrect! [2022-11-25 16:59:00,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9798aae-017b-4b73-81b6-40207e5983fe/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)