./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:51:49,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:51:49,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:51:49,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:51:49,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:51:49,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:51:49,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:51:49,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:51:50,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:51:50,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:51:50,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:51:50,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:51:50,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:51:50,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:51:50,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:51:50,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:51:50,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:51:50,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:51:50,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:51:50,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:51:50,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:51:50,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:51:50,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:51:50,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:51:50,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:51:50,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:51:50,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:51:50,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:51:50,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:51:50,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:51:50,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:51:50,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:51:50,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:51:50,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:51:50,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:51:50,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:51:50,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:51:50,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:51:50,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:51:50,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:51:50,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:51:50,065 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-18 20:51:50,105 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:51:50,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:51:50,106 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:51:50,106 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:51:50,107 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:51:50,107 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:51:50,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:51:50,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:51:50,109 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:51:50,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:51:50,110 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:51:50,110 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:51:50,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:51:50,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:51:50,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:51:50,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:51:50,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:51:50,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:51:50,112 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 20:51:50,112 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:51:50,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:51:50,112 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:51:50,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:51:50,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:51:50,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:51:50,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:51:50,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:51:50,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:51:50,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:51:50,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:51:50,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:51:50,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:51:50,116 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:51:50,117 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:51:50,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:51:50,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c [2022-11-18 20:51:50,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:51:50,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:51:50,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:51:50,471 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:51:50,471 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:51:50,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-18 20:51:50,549 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/data/743df2081/fbb02675f94948819630828c6de5eef1/FLAG2a83715ca [2022-11-18 20:51:51,051 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:51:51,054 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-18 20:51:51,061 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/data/743df2081/fbb02675f94948819630828c6de5eef1/FLAG2a83715ca [2022-11-18 20:51:51,386 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/data/743df2081/fbb02675f94948819630828c6de5eef1 [2022-11-18 20:51:51,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:51:51,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:51:51,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:51:51,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:51:51,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:51:51,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:51" (1/1) ... [2022-11-18 20:51:51,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d840c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:51, skipping insertion in model container [2022-11-18 20:51:51,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:51" (1/1) ... [2022-11-18 20:51:51,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:51:51,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:51:51,751 WARN L234 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_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2022-11-18 20:51:51,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:51:51,801 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:51:51,851 WARN L234 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_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2022-11-18 20:51:51,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:51:51,902 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:51:51,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:51 WrapperNode [2022-11-18 20:51:51,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:51:51,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:51:51,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:51:51,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:51:51,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:51" (1/1) ... [2022-11-18 20:51:51,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:51" (1/1) ... [2022-11-18 20:51:51,974 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 281 [2022-11-18 20:51:51,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:51:51,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:51:51,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:51:51,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:51:51,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:51" (1/1) ... [2022-11-18 20:51:51,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:51" (1/1) ... [2022-11-18 20:51:52,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:51" (1/1) ... [2022-11-18 20:51:52,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:51" (1/1) ... [2022-11-18 20:51:52,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:51" (1/1) ... [2022-11-18 20:51:52,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:51" (1/1) ... [2022-11-18 20:51:52,019 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:51" (1/1) ... [2022-11-18 20:51:52,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:51" (1/1) ... [2022-11-18 20:51:52,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:51:52,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:51:52,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:51:52,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:51:52,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:51" (1/1) ... [2022-11-18 20:51:52,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:51:52,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:51:52,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:51:52,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:51:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:51:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:51:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:51:52,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:51:52,249 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:51:52,263 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:51:52,712 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:51:52,720 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:51:52,720 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:51:52,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:52 BoogieIcfgContainer [2022-11-18 20:51:52,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:51:52,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:51:52,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:51:52,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:51:52,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:51:51" (1/3) ... [2022-11-18 20:51:52,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662b804b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:51:52, skipping insertion in model container [2022-11-18 20:51:52,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:51" (2/3) ... [2022-11-18 20:51:52,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662b804b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:51:52, skipping insertion in model container [2022-11-18 20:51:52,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:52" (3/3) ... [2022-11-18 20:51:52,734 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-18 20:51:52,754 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:51:52,754 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-18 20:51:52,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:51:52,814 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;@2801a869, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:51:52,815 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-18 20:51:52,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 88 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 20:51:52,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:52,827 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] [2022-11-18 20:51:52,828 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:51:52,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1523339456, now seen corresponding path program 1 times [2022-11-18 20:51:52,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:52,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725704545] [2022-11-18 20:51:52,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:52,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:53,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:53,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725704545] [2022-11-18 20:51:53,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725704545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:53,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:53,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:51:53,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712812696] [2022-11-18 20:51:53,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:53,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:51:53,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:53,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:51:53,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:51:53,183 INFO L87 Difference]: Start difference. First operand has 89 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 88 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:53,204 INFO L93 Difference]: Finished difference Result 92 states and 132 transitions. [2022-11-18 20:51:53,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:51:53,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-18 20:51:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:53,218 INFO L225 Difference]: With dead ends: 92 [2022-11-18 20:51:53,218 INFO L226 Difference]: Without dead ends: 84 [2022-11-18 20:51:53,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:51:53,246 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:53,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:51:53,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-18 20:51:53,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-18 20:51:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.5) internal successors, (108), 83 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:53,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 108 transitions. [2022-11-18 20:51:53,316 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 108 transitions. Word has length 23 [2022-11-18 20:51:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:53,317 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 108 transitions. [2022-11-18 20:51:53,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2022-11-18 20:51:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 20:51:53,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:53,323 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] [2022-11-18 20:51:53,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:51:53,324 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:51:53,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:53,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1151032549, now seen corresponding path program 1 times [2022-11-18 20:51:53,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:53,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843762934] [2022-11-18 20:51:53,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:53,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:53,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:53,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843762934] [2022-11-18 20:51:53,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843762934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:53,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:53,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:51:53,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858092452] [2022-11-18 20:51:53,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:53,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:53,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:53,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:53,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:53,522 INFO L87 Difference]: Start difference. First operand 84 states and 108 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:53,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:53,618 INFO L93 Difference]: Finished difference Result 206 states and 273 transitions. [2022-11-18 20:51:53,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:53,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-18 20:51:53,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:53,621 INFO L225 Difference]: With dead ends: 206 [2022-11-18 20:51:53,621 INFO L226 Difference]: Without dead ends: 141 [2022-11-18 20:51:53,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:53,623 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 74 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:53,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 248 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:51:53,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-18 20:51:53,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2022-11-18 20:51:53,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 117 states have (on average 1.564102564102564) internal successors, (183), 128 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2022-11-18 20:51:53,660 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 34 [2022-11-18 20:51:53,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:53,662 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2022-11-18 20:51:53,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:53,663 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2022-11-18 20:51:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-18 20:51:53,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:53,666 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] [2022-11-18 20:51:53,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:51:53,667 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:51:53,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:53,669 INFO L85 PathProgramCache]: Analyzing trace with hash -576537676, now seen corresponding path program 1 times [2022-11-18 20:51:53,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:53,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711279269] [2022-11-18 20:51:53,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:53,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:53,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:53,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:53,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711279269] [2022-11-18 20:51:53,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711279269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:53,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:53,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:51:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611063698] [2022-11-18 20:51:53,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:53,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:53,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:53,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:53,780 INFO L87 Difference]: Start difference. First operand 129 states and 183 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:53,833 INFO L93 Difference]: Finished difference Result 333 states and 485 transitions. [2022-11-18 20:51:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:53,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-18 20:51:53,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:53,836 INFO L225 Difference]: With dead ends: 333 [2022-11-18 20:51:53,836 INFO L226 Difference]: Without dead ends: 223 [2022-11-18 20:51:53,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:53,839 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 69 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:53,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 244 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:51:53,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-18 20:51:53,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 211. [2022-11-18 20:51:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 199 states have (on average 1.6030150753768844) internal successors, (319), 210 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 319 transitions. [2022-11-18 20:51:53,879 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 319 transitions. Word has length 35 [2022-11-18 20:51:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:53,879 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 319 transitions. [2022-11-18 20:51:53,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 319 transitions. [2022-11-18 20:51:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 20:51:53,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:53,881 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] [2022-11-18 20:51:53,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:51:53,882 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:51:53,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:53,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1557567312, now seen corresponding path program 1 times [2022-11-18 20:51:53,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:53,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366872033] [2022-11-18 20:51:53,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:53,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:54,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:54,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366872033] [2022-11-18 20:51:54,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366872033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:54,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:54,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:51:54,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810673091] [2022-11-18 20:51:54,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:54,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:51:54,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:54,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:51:54,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:51:54,043 INFO L87 Difference]: Start difference. First operand 211 states and 319 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:54,302 INFO L93 Difference]: Finished difference Result 592 states and 919 transitions. [2022-11-18 20:51:54,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:51:54,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-18 20:51:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:54,307 INFO L225 Difference]: With dead ends: 592 [2022-11-18 20:51:54,307 INFO L226 Difference]: Without dead ends: 589 [2022-11-18 20:51:54,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:51:54,309 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 252 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:54,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 251 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:51:54,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-11-18 20:51:54,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 391. [2022-11-18 20:51:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 379 states have (on average 1.6015831134564644) internal successors, (607), 390 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 607 transitions. [2022-11-18 20:51:54,376 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 607 transitions. Word has length 36 [2022-11-18 20:51:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:54,376 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 607 transitions. [2022-11-18 20:51:54,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 607 transitions. [2022-11-18 20:51:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-18 20:51:54,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:54,378 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] [2022-11-18 20:51:54,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:51:54,378 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:51:54,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:54,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1039946552, now seen corresponding path program 1 times [2022-11-18 20:51:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:54,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083422811] [2022-11-18 20:51:54,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:54,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:54,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083422811] [2022-11-18 20:51:54,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083422811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:54,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:54,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:51:54,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517860150] [2022-11-18 20:51:54,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:54,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:51:54,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:54,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:51:54,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:51:54,547 INFO L87 Difference]: Start difference. First operand 391 states and 607 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:54,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:54,711 INFO L93 Difference]: Finished difference Result 580 states and 907 transitions. [2022-11-18 20:51:54,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:51:54,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-18 20:51:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:54,718 INFO L225 Difference]: With dead ends: 580 [2022-11-18 20:51:54,718 INFO L226 Difference]: Without dead ends: 577 [2022-11-18 20:51:54,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:51:54,724 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 245 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:54,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 142 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:51:54,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-11-18 20:51:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 571. [2022-11-18 20:51:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 559 states have (on average 1.5796064400715564) internal successors, (883), 570 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 883 transitions. [2022-11-18 20:51:54,795 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 883 transitions. Word has length 37 [2022-11-18 20:51:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:54,796 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 883 transitions. [2022-11-18 20:51:54,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:54,796 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 883 transitions. [2022-11-18 20:51:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-18 20:51:54,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:54,798 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] [2022-11-18 20:51:54,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:51:54,798 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:51:54,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2121395118, now seen corresponding path program 1 times [2022-11-18 20:51:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:54,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753574111] [2022-11-18 20:51:54,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:54,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:54,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:54,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753574111] [2022-11-18 20:51:54,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753574111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:54,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:54,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:51:54,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256660709] [2022-11-18 20:51:54,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:54,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:51:54,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:54,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:51:54,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:51:54,943 INFO L87 Difference]: Start difference. First operand 571 states and 883 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:55,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:55,379 INFO L93 Difference]: Finished difference Result 2047 states and 3187 transitions. [2022-11-18 20:51:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:51:55,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-18 20:51:55,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:55,386 INFO L225 Difference]: With dead ends: 2047 [2022-11-18 20:51:55,386 INFO L226 Difference]: Without dead ends: 1495 [2022-11-18 20:51:55,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:51:55,390 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 519 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:55,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 575 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:51:55,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2022-11-18 20:51:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1111. [2022-11-18 20:51:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1099 states have (on average 1.535031847133758) internal successors, (1687), 1110 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1687 transitions. [2022-11-18 20:51:55,535 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1687 transitions. Word has length 38 [2022-11-18 20:51:55,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:55,537 INFO L495 AbstractCegarLoop]: Abstraction has 1111 states and 1687 transitions. [2022-11-18 20:51:55,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:55,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1687 transitions. [2022-11-18 20:51:55,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 20:51:55,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:55,539 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] [2022-11-18 20:51:55,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:51:55,540 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:51:55,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:55,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1338739078, now seen corresponding path program 1 times [2022-11-18 20:51:55,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:55,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276023203] [2022-11-18 20:51:55,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:55,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:55,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:55,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276023203] [2022-11-18 20:51:55,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276023203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:55,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:55,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:51:55,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938892316] [2022-11-18 20:51:55,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:55,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:51:55,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:55,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:51:55,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:51:55,663 INFO L87 Difference]: Start difference. First operand 1111 states and 1687 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:56,005 INFO L93 Difference]: Finished difference Result 1486 states and 2275 transitions. [2022-11-18 20:51:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:51:56,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-18 20:51:56,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:56,013 INFO L225 Difference]: With dead ends: 1486 [2022-11-18 20:51:56,013 INFO L226 Difference]: Without dead ends: 1483 [2022-11-18 20:51:56,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-18 20:51:56,017 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 495 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:56,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 276 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:51:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2022-11-18 20:51:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1471. [2022-11-18 20:51:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1459 states have (on average 1.5099383139136395) internal successors, (2203), 1470 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2203 transitions. [2022-11-18 20:51:56,203 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2203 transitions. Word has length 39 [2022-11-18 20:51:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:56,203 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 2203 transitions. [2022-11-18 20:51:56,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2203 transitions. [2022-11-18 20:51:56,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-18 20:51:56,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:56,209 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] [2022-11-18 20:51:56,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:51:56,210 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:51:56,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:56,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1056432401, now seen corresponding path program 1 times [2022-11-18 20:51:56,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:56,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826929261] [2022-11-18 20:51:56,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:56,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:56,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:56,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826929261] [2022-11-18 20:51:56,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826929261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:56,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:56,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:51:56,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57751656] [2022-11-18 20:51:56,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:56,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:56,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:56,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:56,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:56,282 INFO L87 Difference]: Start difference. First operand 1471 states and 2203 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:56,588 INFO L93 Difference]: Finished difference Result 4023 states and 6027 transitions. [2022-11-18 20:51:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:56,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-18 20:51:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:56,598 INFO L225 Difference]: With dead ends: 4023 [2022-11-18 20:51:56,598 INFO L226 Difference]: Without dead ends: 2571 [2022-11-18 20:51:56,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:56,601 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 75 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:56,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 257 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:51:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-11-18 20:51:56,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2559. [2022-11-18 20:51:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2547 states have (on average 1.4962701217118177) internal successors, (3811), 2558 states have internal predecessors, (3811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 3811 transitions. [2022-11-18 20:51:56,895 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 3811 transitions. Word has length 40 [2022-11-18 20:51:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:56,895 INFO L495 AbstractCegarLoop]: Abstraction has 2559 states and 3811 transitions. [2022-11-18 20:51:56,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 3811 transitions. [2022-11-18 20:51:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-18 20:51:56,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:56,901 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 20:51:56,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:51:56,901 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:51:56,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:56,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1624205634, now seen corresponding path program 1 times [2022-11-18 20:51:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:56,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957144079] [2022-11-18 20:51:56,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:56,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:57,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:57,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957144079] [2022-11-18 20:51:57,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957144079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:57,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:57,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:51:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172062463] [2022-11-18 20:51:57,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:57,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:57,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:57,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:57,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:57,013 INFO L87 Difference]: Start difference. First operand 2559 states and 3811 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:57,366 INFO L93 Difference]: Finished difference Result 5815 states and 8629 transitions. [2022-11-18 20:51:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:57,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-11-18 20:51:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:57,379 INFO L225 Difference]: With dead ends: 5815 [2022-11-18 20:51:57,379 INFO L226 Difference]: Without dead ends: 3275 [2022-11-18 20:51:57,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:57,387 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 45 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:57,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 186 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:51:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2022-11-18 20:51:57,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3229. [2022-11-18 20:51:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3229 states, 3217 states have (on average 1.4762200808206403) internal successors, (4749), 3228 states have internal predecessors, (4749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4749 transitions. [2022-11-18 20:51:57,740 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4749 transitions. Word has length 61 [2022-11-18 20:51:57,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:57,742 INFO L495 AbstractCegarLoop]: Abstraction has 3229 states and 4749 transitions. [2022-11-18 20:51:57,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4749 transitions. [2022-11-18 20:51:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-18 20:51:57,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:57,743 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 20:51:57,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:51:57,744 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:51:57,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2031721315, now seen corresponding path program 1 times [2022-11-18 20:51:57,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:57,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450848646] [2022-11-18 20:51:57,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:57,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:58,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:58,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450848646] [2022-11-18 20:51:58,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450848646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:58,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:58,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:51:58,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118199252] [2022-11-18 20:51:58,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:58,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:51:58,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:58,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:51:58,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:51:58,004 INFO L87 Difference]: Start difference. First operand 3229 states and 4749 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:58,443 INFO L93 Difference]: Finished difference Result 6443 states and 9477 transitions. [2022-11-18 20:51:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:51:58,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-18 20:51:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:58,455 INFO L225 Difference]: With dead ends: 6443 [2022-11-18 20:51:58,455 INFO L226 Difference]: Without dead ends: 3235 [2022-11-18 20:51:58,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:51:58,461 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 121 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:58,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 275 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:51:58,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2022-11-18 20:51:58,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 3229. [2022-11-18 20:51:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3229 states, 3217 states have (on average 1.4662729250854833) internal successors, (4717), 3228 states have internal predecessors, (4717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4717 transitions. [2022-11-18 20:51:58,793 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4717 transitions. Word has length 65 [2022-11-18 20:51:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:58,793 INFO L495 AbstractCegarLoop]: Abstraction has 3229 states and 4717 transitions. [2022-11-18 20:51:58,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4717 transitions. [2022-11-18 20:51:58,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-18 20:51:58,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:58,795 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 20:51:58,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:51:58,795 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:51:58,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:58,796 INFO L85 PathProgramCache]: Analyzing trace with hash 947482817, now seen corresponding path program 1 times [2022-11-18 20:51:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:58,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176150035] [2022-11-18 20:51:58,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:58,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 20:51:58,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:58,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176150035] [2022-11-18 20:51:58,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176150035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:58,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:58,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:51:58,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466488335] [2022-11-18 20:51:58,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:58,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:51:58,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:58,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:51:58,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:51:58,910 INFO L87 Difference]: Start difference. First operand 3229 states and 4717 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:59,379 INFO L93 Difference]: Finished difference Result 4189 states and 6133 transitions. [2022-11-18 20:51:59,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:51:59,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-11-18 20:51:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:59,396 INFO L225 Difference]: With dead ends: 4189 [2022-11-18 20:51:59,396 INFO L226 Difference]: Without dead ends: 4186 [2022-11-18 20:51:59,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:51:59,399 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 124 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:59,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 277 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:51:59,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4186 states. [2022-11-18 20:51:59,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4186 to 3277. [2022-11-18 20:51:59,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3277 states, 3265 states have (on average 1.475344563552833) internal successors, (4817), 3276 states have internal predecessors, (4817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 3277 states and 4817 transitions. [2022-11-18 20:51:59,760 INFO L78 Accepts]: Start accepts. Automaton has 3277 states and 4817 transitions. Word has length 66 [2022-11-18 20:51:59,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:59,760 INFO L495 AbstractCegarLoop]: Abstraction has 3277 states and 4817 transitions. [2022-11-18 20:51:59,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 4817 transitions. [2022-11-18 20:51:59,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-18 20:51:59,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:59,762 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:59,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:51:59,762 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:51:59,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:59,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1013767766, now seen corresponding path program 1 times [2022-11-18 20:51:59,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:59,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101246261] [2022-11-18 20:51:59,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:51:59,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:59,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101246261] [2022-11-18 20:51:59,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101246261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:59,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:59,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:51:59,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823270330] [2022-11-18 20:51:59,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:59,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:51:59,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:59,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:51:59,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:51:59,848 INFO L87 Difference]: Start difference. First operand 3277 states and 4817 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:00,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:00,342 INFO L93 Difference]: Finished difference Result 5140 states and 7525 transitions. [2022-11-18 20:52:00,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:52:00,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-18 20:52:00,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:00,360 INFO L225 Difference]: With dead ends: 5140 [2022-11-18 20:52:00,360 INFO L226 Difference]: Without dead ends: 5137 [2022-11-18 20:52:00,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:52:00,362 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 126 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:00,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 272 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2022-11-18 20:52:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 5125. [2022-11-18 20:52:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5113 states have (on average 1.4576569528652454) internal successors, (7453), 5124 states have internal predecessors, (7453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 7453 transitions. [2022-11-18 20:52:00,791 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 7453 transitions. Word has length 68 [2022-11-18 20:52:00,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:00,791 INFO L495 AbstractCegarLoop]: Abstraction has 5125 states and 7453 transitions. [2022-11-18 20:52:00,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 7453 transitions. [2022-11-18 20:52:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-18 20:52:00,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:00,793 INFO L195 NwaCegarLoop]: trace histogram [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-18 20:52:00,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:52:00,793 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash -459438275, now seen corresponding path program 1 times [2022-11-18 20:52:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:00,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23404758] [2022-11-18 20:52:00,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 20:52:00,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:00,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23404758] [2022-11-18 20:52:00,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23404758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:00,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:00,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:00,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640767148] [2022-11-18 20:52:00,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:00,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:00,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:00,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:00,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:00,897 INFO L87 Difference]: Start difference. First operand 5125 states and 7453 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:01,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:01,662 INFO L93 Difference]: Finished difference Result 10687 states and 15465 transitions. [2022-11-18 20:52:01,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:52:01,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-18 20:52:01,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:01,682 INFO L225 Difference]: With dead ends: 10687 [2022-11-18 20:52:01,682 INFO L226 Difference]: Without dead ends: 5583 [2022-11-18 20:52:01,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:52:01,690 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 272 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:01,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 361 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5583 states. [2022-11-18 20:52:02,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5583 to 5125. [2022-11-18 20:52:02,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5113 states have (on average 1.4490514375122237) internal successors, (7409), 5124 states have internal predecessors, (7409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:02,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 7409 transitions. [2022-11-18 20:52:02,140 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 7409 transitions. Word has length 68 [2022-11-18 20:52:02,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:02,140 INFO L495 AbstractCegarLoop]: Abstraction has 5125 states and 7409 transitions. [2022-11-18 20:52:02,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 7409 transitions. [2022-11-18 20:52:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-18 20:52:02,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:02,142 INFO L195 NwaCegarLoop]: trace histogram [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-18 20:52:02,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:52:02,143 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:02,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:02,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2075261, now seen corresponding path program 1 times [2022-11-18 20:52:02,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:02,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580194509] [2022-11-18 20:52:02,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:02,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 20:52:02,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:02,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580194509] [2022-11-18 20:52:02,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580194509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:02,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:02,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:02,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470210604] [2022-11-18 20:52:02,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:02,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:02,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:02,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:02,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:02,248 INFO L87 Difference]: Start difference. First operand 5125 states and 7409 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:02,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:02,910 INFO L93 Difference]: Finished difference Result 10058 states and 14493 transitions. [2022-11-18 20:52:02,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:02,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-18 20:52:02,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:02,928 INFO L225 Difference]: With dead ends: 10058 [2022-11-18 20:52:02,928 INFO L226 Difference]: Without dead ends: 6802 [2022-11-18 20:52:02,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:52:02,935 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 277 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:02,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 383 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:02,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6802 states. [2022-11-18 20:52:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6802 to 6793. [2022-11-18 20:52:03,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6793 states, 6781 states have (on average 1.4188172835864916) internal successors, (9621), 6792 states have internal predecessors, (9621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 9621 transitions. [2022-11-18 20:52:03,516 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 9621 transitions. Word has length 68 [2022-11-18 20:52:03,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:03,516 INFO L495 AbstractCegarLoop]: Abstraction has 6793 states and 9621 transitions. [2022-11-18 20:52:03,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 9621 transitions. [2022-11-18 20:52:03,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-18 20:52:03,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:03,519 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-11-18 20:52:03,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:52:03,519 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:03,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:03,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1362029810, now seen corresponding path program 1 times [2022-11-18 20:52:03,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:03,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098617492] [2022-11-18 20:52:03,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:03,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:03,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:52:03,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:03,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098617492] [2022-11-18 20:52:03,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098617492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:03,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:03,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:03,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620911622] [2022-11-18 20:52:03,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:03,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:52:03,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:03,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:52:03,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:52:03,618 INFO L87 Difference]: Start difference. First operand 6793 states and 9621 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:04,261 INFO L93 Difference]: Finished difference Result 6799 states and 9621 transitions. [2022-11-18 20:52:04,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:52:04,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-11-18 20:52:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:04,281 INFO L225 Difference]: With dead ends: 6799 [2022-11-18 20:52:04,282 INFO L226 Difference]: Without dead ends: 6796 [2022-11-18 20:52:04,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:52:04,285 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 119 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:04,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 214 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:04,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6796 states. [2022-11-18 20:52:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6796 to 6790. [2022-11-18 20:52:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6790 states, 6781 states have (on average 1.3975814776581625) internal successors, (9477), 6789 states have internal predecessors, (9477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6790 states to 6790 states and 9477 transitions. [2022-11-18 20:52:04,802 INFO L78 Accepts]: Start accepts. Automaton has 6790 states and 9477 transitions. Word has length 69 [2022-11-18 20:52:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:04,802 INFO L495 AbstractCegarLoop]: Abstraction has 6790 states and 9477 transitions. [2022-11-18 20:52:04,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 6790 states and 9477 transitions. [2022-11-18 20:52:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-18 20:52:04,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:04,804 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 20:52:04,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:52:04,805 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:04,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:04,805 INFO L85 PathProgramCache]: Analyzing trace with hash -64332951, now seen corresponding path program 1 times [2022-11-18 20:52:04,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:04,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998088451] [2022-11-18 20:52:04,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:04,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 20:52:04,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:04,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998088451] [2022-11-18 20:52:04,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998088451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:04,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:04,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:04,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553235830] [2022-11-18 20:52:04,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:04,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:04,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:04,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:04,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:04,912 INFO L87 Difference]: Start difference. First operand 6790 states and 9477 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:05,573 INFO L93 Difference]: Finished difference Result 13530 states and 19329 transitions. [2022-11-18 20:52:05,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:05,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-11-18 20:52:05,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:05,593 INFO L225 Difference]: With dead ends: 13530 [2022-11-18 20:52:05,593 INFO L226 Difference]: Without dead ends: 9061 [2022-11-18 20:52:05,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:52:05,600 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 289 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:05,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 268 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9061 states. [2022-11-18 20:52:06,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9061 to 7966. [2022-11-18 20:52:06,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7966 states, 7957 states have (on average 1.4212642955887898) internal successors, (11309), 7965 states have internal predecessors, (11309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7966 states to 7966 states and 11309 transitions. [2022-11-18 20:52:06,293 INFO L78 Accepts]: Start accepts. Automaton has 7966 states and 11309 transitions. Word has length 69 [2022-11-18 20:52:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:06,293 INFO L495 AbstractCegarLoop]: Abstraction has 7966 states and 11309 transitions. [2022-11-18 20:52:06,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 7966 states and 11309 transitions. [2022-11-18 20:52:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-18 20:52:06,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:06,295 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-11-18 20:52:06,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:52:06,295 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:06,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:06,295 INFO L85 PathProgramCache]: Analyzing trace with hash -726748712, now seen corresponding path program 1 times [2022-11-18 20:52:06,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:06,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346396470] [2022-11-18 20:52:06,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:06,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:52:06,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:06,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346396470] [2022-11-18 20:52:06,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346396470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:06,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:06,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:06,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066894875] [2022-11-18 20:52:06,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:06,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:06,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:06,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:06,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:06,397 INFO L87 Difference]: Start difference. First operand 7966 states and 11309 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:07,033 INFO L93 Difference]: Finished difference Result 14620 states and 20973 transitions. [2022-11-18 20:52:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:07,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-11-18 20:52:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:07,052 INFO L225 Difference]: With dead ends: 14620 [2022-11-18 20:52:07,052 INFO L226 Difference]: Without dead ends: 8923 [2022-11-18 20:52:07,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:52:07,060 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 265 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:07,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 389 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:07,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8923 states. [2022-11-18 20:52:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8923 to 8914. [2022-11-18 20:52:07,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8914 states, 8905 states have (on average 1.413700168444694) internal successors, (12589), 8913 states have internal predecessors, (12589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:07,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8914 states to 8914 states and 12589 transitions. [2022-11-18 20:52:07,844 INFO L78 Accepts]: Start accepts. Automaton has 8914 states and 12589 transitions. Word has length 70 [2022-11-18 20:52:07,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:07,844 INFO L495 AbstractCegarLoop]: Abstraction has 8914 states and 12589 transitions. [2022-11-18 20:52:07,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 8914 states and 12589 transitions. [2022-11-18 20:52:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-18 20:52:07,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:07,846 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:07,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:52:07,846 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1134710146, now seen corresponding path program 1 times [2022-11-18 20:52:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:07,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968445305] [2022-11-18 20:52:07,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:07,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:07,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:52:07,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:07,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968445305] [2022-11-18 20:52:07,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968445305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:07,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:07,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:07,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264773882] [2022-11-18 20:52:07,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:07,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:52:07,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:07,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:52:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:52:07,928 INFO L87 Difference]: Start difference. First operand 8914 states and 12589 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:08,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:08,561 INFO L93 Difference]: Finished difference Result 10822 states and 15421 transitions. [2022-11-18 20:52:08,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:52:08,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-11-18 20:52:08,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:08,579 INFO L225 Difference]: With dead ends: 10822 [2022-11-18 20:52:08,579 INFO L226 Difference]: Without dead ends: 10819 [2022-11-18 20:52:08,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:52:08,583 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 155 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:08,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 416 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:08,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10819 states. [2022-11-18 20:52:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10819 to 8914. [2022-11-18 20:52:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8914 states, 8905 states have (on average 1.3975294778214487) internal successors, (12445), 8913 states have internal predecessors, (12445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8914 states to 8914 states and 12445 transitions. [2022-11-18 20:52:09,270 INFO L78 Accepts]: Start accepts. Automaton has 8914 states and 12445 transitions. Word has length 70 [2022-11-18 20:52:09,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:09,270 INFO L495 AbstractCegarLoop]: Abstraction has 8914 states and 12445 transitions. [2022-11-18 20:52:09,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 8914 states and 12445 transitions. [2022-11-18 20:52:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-18 20:52:09,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:09,271 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 20:52:09,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 20:52:09,272 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:09,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:09,272 INFO L85 PathProgramCache]: Analyzing trace with hash -296117079, now seen corresponding path program 1 times [2022-11-18 20:52:09,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:09,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016346546] [2022-11-18 20:52:09,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:09,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 20:52:09,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:09,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016346546] [2022-11-18 20:52:09,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016346546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:09,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:09,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813447507] [2022-11-18 20:52:09,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:09,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:09,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:09,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:09,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:09,385 INFO L87 Difference]: Start difference. First operand 8914 states and 12445 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:10,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:10,142 INFO L93 Difference]: Finished difference Result 9368 states and 13073 transitions. [2022-11-18 20:52:10,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:10,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-11-18 20:52:10,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:10,156 INFO L225 Difference]: With dead ends: 9368 [2022-11-18 20:52:10,156 INFO L226 Difference]: Without dead ends: 9365 [2022-11-18 20:52:10,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:10,160 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 188 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:10,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 424 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2022-11-18 20:52:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 9362. [2022-11-18 20:52:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9362 states, 9353 states have (on average 1.394311985459211) internal successors, (13041), 9361 states have internal predecessors, (13041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9362 states to 9362 states and 13041 transitions. [2022-11-18 20:52:10,781 INFO L78 Accepts]: Start accepts. Automaton has 9362 states and 13041 transitions. Word has length 70 [2022-11-18 20:52:10,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:10,782 INFO L495 AbstractCegarLoop]: Abstraction has 9362 states and 13041 transitions. [2022-11-18 20:52:10,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 9362 states and 13041 transitions. [2022-11-18 20:52:10,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-18 20:52:10,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:10,783 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-11-18 20:52:10,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 20:52:10,784 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:10,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:10,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1054373452, now seen corresponding path program 1 times [2022-11-18 20:52:10,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:10,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306537986] [2022-11-18 20:52:10,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:10,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:52:10,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:10,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306537986] [2022-11-18 20:52:10,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306537986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:10,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:10,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:10,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295315724] [2022-11-18 20:52:10,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:10,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:10,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:10,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:10,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:10,896 INFO L87 Difference]: Start difference. First operand 9362 states and 13041 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:12,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:12,009 INFO L93 Difference]: Finished difference Result 18998 states and 26973 transitions. [2022-11-18 20:52:12,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:12,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-11-18 20:52:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:12,029 INFO L225 Difference]: With dead ends: 18998 [2022-11-18 20:52:12,029 INFO L226 Difference]: Without dead ends: 12353 [2022-11-18 20:52:12,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:52:12,039 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 297 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:12,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 270 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12353 states. [2022-11-18 20:52:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12353 to 10442. [2022-11-18 20:52:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10442 states, 10433 states have (on average 1.400651778012077) internal successors, (14613), 10441 states have internal predecessors, (14613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:12,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10442 states to 10442 states and 14613 transitions. [2022-11-18 20:52:12,945 INFO L78 Accepts]: Start accepts. Automaton has 10442 states and 14613 transitions. Word has length 71 [2022-11-18 20:52:12,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:12,945 INFO L495 AbstractCegarLoop]: Abstraction has 10442 states and 14613 transitions. [2022-11-18 20:52:12,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 10442 states and 14613 transitions. [2022-11-18 20:52:12,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-18 20:52:12,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:12,950 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:12,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 20:52:12,951 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:12,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:12,951 INFO L85 PathProgramCache]: Analyzing trace with hash -922601538, now seen corresponding path program 1 times [2022-11-18 20:52:12,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:12,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841911710] [2022-11-18 20:52:12,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:12,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:52:13,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:13,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841911710] [2022-11-18 20:52:13,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841911710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:13,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:13,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:13,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970018506] [2022-11-18 20:52:13,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:13,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:13,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:13,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:13,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:13,069 INFO L87 Difference]: Start difference. First operand 10442 states and 14613 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:13,801 INFO L93 Difference]: Finished difference Result 11396 states and 15957 transitions. [2022-11-18 20:52:13,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:13,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-11-18 20:52:13,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:13,815 INFO L225 Difference]: With dead ends: 11396 [2022-11-18 20:52:13,815 INFO L226 Difference]: Without dead ends: 11393 [2022-11-18 20:52:13,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:13,819 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 187 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:13,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 387 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11393 states. [2022-11-18 20:52:14,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11393 to 11390. [2022-11-18 20:52:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11390 states, 11381 states have (on average 1.3978560759160004) internal successors, (15909), 11389 states have internal predecessors, (15909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11390 states to 11390 states and 15909 transitions. [2022-11-18 20:52:14,455 INFO L78 Accepts]: Start accepts. Automaton has 11390 states and 15909 transitions. Word has length 72 [2022-11-18 20:52:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:14,456 INFO L495 AbstractCegarLoop]: Abstraction has 11390 states and 15909 transitions. [2022-11-18 20:52:14,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 11390 states and 15909 transitions. [2022-11-18 20:52:14,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-18 20:52:14,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:14,458 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:14,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 20:52:14,458 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:14,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:14,459 INFO L85 PathProgramCache]: Analyzing trace with hash -465238524, now seen corresponding path program 1 times [2022-11-18 20:52:14,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:14,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588049481] [2022-11-18 20:52:14,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:14,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:52:14,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:14,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588049481] [2022-11-18 20:52:14,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588049481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:14,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:14,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:14,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747761207] [2022-11-18 20:52:14,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:14,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:14,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:14,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:14,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:14,590 INFO L87 Difference]: Start difference. First operand 11390 states and 15909 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:15,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:15,613 INFO L93 Difference]: Finished difference Result 14249 states and 20013 transitions. [2022-11-18 20:52:15,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:15,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-11-18 20:52:15,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:15,631 INFO L225 Difference]: With dead ends: 14249 [2022-11-18 20:52:15,632 INFO L226 Difference]: Without dead ends: 14246 [2022-11-18 20:52:15,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:15,636 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 187 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:15,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 476 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:15,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14246 states. [2022-11-18 20:52:16,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14246 to 14234. [2022-11-18 20:52:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14234 states, 14225 states have (on average 1.4001405975395431) internal successors, (19917), 14233 states have internal predecessors, (19917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 19917 transitions. [2022-11-18 20:52:16,564 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 19917 transitions. Word has length 72 [2022-11-18 20:52:16,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:16,564 INFO L495 AbstractCegarLoop]: Abstraction has 14234 states and 19917 transitions. [2022-11-18 20:52:16,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:16,565 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 19917 transitions. [2022-11-18 20:52:16,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-18 20:52:16,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:16,566 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-11-18 20:52:16,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-18 20:52:16,567 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:16,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:16,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1537492216, now seen corresponding path program 1 times [2022-11-18 20:52:16,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:16,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274374214] [2022-11-18 20:52:16,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:16,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:52:16,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:16,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274374214] [2022-11-18 20:52:16,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274374214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:16,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:16,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:16,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225695695] [2022-11-18 20:52:16,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:16,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:16,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:16,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:16,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:16,701 INFO L87 Difference]: Start difference. First operand 14234 states and 19917 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:17,647 INFO L93 Difference]: Finished difference Result 16508 states and 23117 transitions. [2022-11-18 20:52:17,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:17,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-11-18 20:52:17,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:17,660 INFO L225 Difference]: With dead ends: 16508 [2022-11-18 20:52:17,660 INFO L226 Difference]: Without dead ends: 10182 [2022-11-18 20:52:17,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:17,670 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 181 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:17,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 326 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:17,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10182 states. [2022-11-18 20:52:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10182 to 7722. [2022-11-18 20:52:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7722 states, 7713 states have (on average 1.3988072086088421) internal successors, (10789), 7721 states have internal predecessors, (10789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7722 states to 7722 states and 10789 transitions. [2022-11-18 20:52:18,415 INFO L78 Accepts]: Start accepts. Automaton has 7722 states and 10789 transitions. Word has length 73 [2022-11-18 20:52:18,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:18,415 INFO L495 AbstractCegarLoop]: Abstraction has 7722 states and 10789 transitions. [2022-11-18 20:52:18,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 7722 states and 10789 transitions. [2022-11-18 20:52:18,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-18 20:52:18,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:18,417 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:18,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-18 20:52:18,417 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:18,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:18,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1280585962, now seen corresponding path program 1 times [2022-11-18 20:52:18,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:18,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863259150] [2022-11-18 20:52:18,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:18,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:52:18,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:18,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863259150] [2022-11-18 20:52:18,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863259150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:18,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:18,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:18,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048236905] [2022-11-18 20:52:18,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:18,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:18,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:18,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:18,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:18,577 INFO L87 Difference]: Start difference. First operand 7722 states and 10789 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:19,557 INFO L93 Difference]: Finished difference Result 7947 states and 11093 transitions. [2022-11-18 20:52:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:19,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-11-18 20:52:19,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:19,568 INFO L225 Difference]: With dead ends: 7947 [2022-11-18 20:52:19,568 INFO L226 Difference]: Without dead ends: 7506 [2022-11-18 20:52:19,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:19,571 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 187 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:19,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 644 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:52:19,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7506 states. [2022-11-18 20:52:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7506 to 7502. [2022-11-18 20:52:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7502 states, 7493 states have (on average 1.3977045242226078) internal successors, (10473), 7501 states have internal predecessors, (10473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7502 states to 7502 states and 10473 transitions. [2022-11-18 20:52:20,105 INFO L78 Accepts]: Start accepts. Automaton has 7502 states and 10473 transitions. Word has length 74 [2022-11-18 20:52:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:20,105 INFO L495 AbstractCegarLoop]: Abstraction has 7502 states and 10473 transitions. [2022-11-18 20:52:20,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7502 states and 10473 transitions. [2022-11-18 20:52:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-18 20:52:20,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:20,109 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-11-18 20:52:20,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-18 20:52:20,109 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:20,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:20,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1014831339, now seen corresponding path program 1 times [2022-11-18 20:52:20,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:20,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274720838] [2022-11-18 20:52:20,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:20,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 20:52:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:20,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274720838] [2022-11-18 20:52:20,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274720838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:20,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:20,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:20,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836159027] [2022-11-18 20:52:20,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:20,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:52:20,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:20,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:52:20,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:52:20,216 INFO L87 Difference]: Start difference. First operand 7502 states and 10473 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:20,898 INFO L93 Difference]: Finished difference Result 7728 states and 10773 transitions. [2022-11-18 20:52:20,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:52:20,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-11-18 20:52:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:20,905 INFO L225 Difference]: With dead ends: 7728 [2022-11-18 20:52:20,905 INFO L226 Difference]: Without dead ends: 7725 [2022-11-18 20:52:20,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:52:20,907 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 129 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:20,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 344 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:20,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7725 states. [2022-11-18 20:52:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7725 to 7499. [2022-11-18 20:52:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7499 states, 7493 states have (on average 1.365674629654344) internal successors, (10233), 7498 states have internal predecessors, (10233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7499 states to 7499 states and 10233 transitions. [2022-11-18 20:52:21,332 INFO L78 Accepts]: Start accepts. Automaton has 7499 states and 10233 transitions. Word has length 95 [2022-11-18 20:52:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:21,332 INFO L495 AbstractCegarLoop]: Abstraction has 7499 states and 10233 transitions. [2022-11-18 20:52:21,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 7499 states and 10233 transitions. [2022-11-18 20:52:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-18 20:52:21,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:21,336 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-18 20:52:21,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-18 20:52:21,336 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:21,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1641497059, now seen corresponding path program 1 times [2022-11-18 20:52:21,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:21,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612523225] [2022-11-18 20:52:21,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:21,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:52:21,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:21,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612523225] [2022-11-18 20:52:21,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612523225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:21,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:21,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:21,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716580802] [2022-11-18 20:52:21,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:21,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:21,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:21,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:21,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:21,471 INFO L87 Difference]: Start difference. First operand 7499 states and 10233 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:22,187 INFO L93 Difference]: Finished difference Result 8045 states and 10981 transitions. [2022-11-18 20:52:22,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:22,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-11-18 20:52:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:22,195 INFO L225 Difference]: With dead ends: 8045 [2022-11-18 20:52:22,196 INFO L226 Difference]: Without dead ends: 7192 [2022-11-18 20:52:22,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:22,199 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 184 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:22,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 631 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7192 states. [2022-11-18 20:52:22,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7192 to 7183. [2022-11-18 20:52:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7183 states, 7177 states have (on average 1.3683990525289118) internal successors, (9821), 7182 states have internal predecessors, (9821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7183 states to 7183 states and 9821 transitions. [2022-11-18 20:52:22,609 INFO L78 Accepts]: Start accepts. Automaton has 7183 states and 9821 transitions. Word has length 97 [2022-11-18 20:52:22,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:22,609 INFO L495 AbstractCegarLoop]: Abstraction has 7183 states and 9821 transitions. [2022-11-18 20:52:22,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 7183 states and 9821 transitions. [2022-11-18 20:52:22,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-18 20:52:22,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:22,613 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-18 20:52:22,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-18 20:52:22,613 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:22,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:22,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1064049893, now seen corresponding path program 1 times [2022-11-18 20:52:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:22,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306002738] [2022-11-18 20:52:22,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:22,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-18 20:52:22,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:22,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306002738] [2022-11-18 20:52:22,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306002738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:22,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:22,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:22,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433471136] [2022-11-18 20:52:22,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:22,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:22,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:22,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:22,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:22,671 INFO L87 Difference]: Start difference. First operand 7183 states and 9821 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:23,484 INFO L93 Difference]: Finished difference Result 16155 states and 22155 transitions. [2022-11-18 20:52:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:23,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-11-18 20:52:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:23,495 INFO L225 Difference]: With dead ends: 16155 [2022-11-18 20:52:23,495 INFO L226 Difference]: Without dead ends: 9925 [2022-11-18 20:52:23,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:23,501 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 63 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:23,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 238 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:52:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9925 states. [2022-11-18 20:52:24,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9925 to 9579. [2022-11-18 20:52:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9579 states, 9573 states have (on average 1.3447195236602947) internal successors, (12873), 9578 states have internal predecessors, (12873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 12873 transitions. [2022-11-18 20:52:24,110 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 12873 transitions. Word has length 97 [2022-11-18 20:52:24,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:24,110 INFO L495 AbstractCegarLoop]: Abstraction has 9579 states and 12873 transitions. [2022-11-18 20:52:24,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 12873 transitions. [2022-11-18 20:52:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-18 20:52:24,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:24,114 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-18 20:52:24,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-18 20:52:24,114 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:24,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash 295344941, now seen corresponding path program 2 times [2022-11-18 20:52:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:24,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465633151] [2022-11-18 20:52:24,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 20:52:24,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:24,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465633151] [2022-11-18 20:52:24,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465633151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:24,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:24,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:24,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596423612] [2022-11-18 20:52:24,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:24,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:24,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:24,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:24,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:24,265 INFO L87 Difference]: Start difference. First operand 9579 states and 12873 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:25,286 INFO L93 Difference]: Finished difference Result 13674 states and 18519 transitions. [2022-11-18 20:52:25,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:25,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-11-18 20:52:25,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:25,294 INFO L225 Difference]: With dead ends: 13674 [2022-11-18 20:52:25,294 INFO L226 Difference]: Without dead ends: 7564 [2022-11-18 20:52:25,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:25,299 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 195 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:25,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 487 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:25,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7564 states. [2022-11-18 20:52:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7564 to 7555. [2022-11-18 20:52:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7555 states, 7549 states have (on average 1.3420320572261226) internal successors, (10131), 7554 states have internal predecessors, (10131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10131 transitions. [2022-11-18 20:52:25,766 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10131 transitions. Word has length 97 [2022-11-18 20:52:25,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:25,767 INFO L495 AbstractCegarLoop]: Abstraction has 7555 states and 10131 transitions. [2022-11-18 20:52:25,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10131 transitions. [2022-11-18 20:52:25,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-18 20:52:25,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:25,770 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-18 20:52:25,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-18 20:52:25,771 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:25,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:25,771 INFO L85 PathProgramCache]: Analyzing trace with hash -58450279, now seen corresponding path program 1 times [2022-11-18 20:52:25,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:25,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841600265] [2022-11-18 20:52:25,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:25,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:52:25,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:25,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841600265] [2022-11-18 20:52:25,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841600265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:25,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:25,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:25,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195717870] [2022-11-18 20:52:25,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:25,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:25,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:25,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:25,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:25,902 INFO L87 Difference]: Start difference. First operand 7555 states and 10131 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:26,638 INFO L93 Difference]: Finished difference Result 7558 states and 10131 transitions. [2022-11-18 20:52:26,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:26,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-11-18 20:52:26,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:26,647 INFO L225 Difference]: With dead ends: 7558 [2022-11-18 20:52:26,647 INFO L226 Difference]: Without dead ends: 7555 [2022-11-18 20:52:26,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:26,650 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 159 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:26,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 445 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7555 states. [2022-11-18 20:52:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7555 to 7555. [2022-11-18 20:52:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7555 states, 7549 states have (on average 1.3372632136706848) internal successors, (10095), 7554 states have internal predecessors, (10095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10095 transitions. [2022-11-18 20:52:27,182 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10095 transitions. Word has length 99 [2022-11-18 20:52:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:27,182 INFO L495 AbstractCegarLoop]: Abstraction has 7555 states and 10095 transitions. [2022-11-18 20:52:27,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10095 transitions. [2022-11-18 20:52:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-18 20:52:27,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:27,186 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-18 20:52:27,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-18 20:52:27,186 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:27,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:27,187 INFO L85 PathProgramCache]: Analyzing trace with hash -308445212, now seen corresponding path program 1 times [2022-11-18 20:52:27,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:27,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621710030] [2022-11-18 20:52:27,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:27,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:52:27,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:27,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621710030] [2022-11-18 20:52:27,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621710030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:27,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:27,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:27,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865665466] [2022-11-18 20:52:27,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:27,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:27,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:27,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:27,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:27,356 INFO L87 Difference]: Start difference. First operand 7555 states and 10095 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:28,004 INFO L93 Difference]: Finished difference Result 7558 states and 10095 transitions. [2022-11-18 20:52:28,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:28,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-11-18 20:52:28,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:28,012 INFO L225 Difference]: With dead ends: 7558 [2022-11-18 20:52:28,013 INFO L226 Difference]: Without dead ends: 7555 [2022-11-18 20:52:28,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:28,015 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 153 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:28,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 451 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:28,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7555 states. [2022-11-18 20:52:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7555 to 7555. [2022-11-18 20:52:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7555 states, 7549 states have (on average 1.3335541131275666) internal successors, (10067), 7554 states have internal predecessors, (10067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10067 transitions. [2022-11-18 20:52:28,500 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10067 transitions. Word has length 101 [2022-11-18 20:52:28,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:28,500 INFO L495 AbstractCegarLoop]: Abstraction has 7555 states and 10067 transitions. [2022-11-18 20:52:28,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10067 transitions. [2022-11-18 20:52:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-18 20:52:28,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:28,504 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-18 20:52:28,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-18 20:52:28,504 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:28,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:28,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1302363118, now seen corresponding path program 1 times [2022-11-18 20:52:28,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:28,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539157498] [2022-11-18 20:52:28,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:28,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 20:52:28,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:28,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539157498] [2022-11-18 20:52:28,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539157498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:28,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:28,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:28,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512087598] [2022-11-18 20:52:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:28,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:28,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:28,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:28,652 INFO L87 Difference]: Start difference. First operand 7555 states and 10067 transitions. Second operand has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:29,297 INFO L93 Difference]: Finished difference Result 7561 states and 10067 transitions. [2022-11-18 20:52:29,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:29,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-11-18 20:52:29,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:29,305 INFO L225 Difference]: With dead ends: 7561 [2022-11-18 20:52:29,305 INFO L226 Difference]: Without dead ends: 7558 [2022-11-18 20:52:29,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:29,307 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 161 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:29,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 402 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2022-11-18 20:52:29,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 7555. [2022-11-18 20:52:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7555 states, 7549 states have (on average 1.32613591204133) internal successors, (10011), 7554 states have internal predecessors, (10011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10011 transitions. [2022-11-18 20:52:29,787 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10011 transitions. Word has length 101 [2022-11-18 20:52:29,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:29,787 INFO L495 AbstractCegarLoop]: Abstraction has 7555 states and 10011 transitions. [2022-11-18 20:52:29,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:29,788 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10011 transitions. [2022-11-18 20:52:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-18 20:52:29,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:29,790 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-11-18 20:52:29,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-18 20:52:29,790 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:29,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:29,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1718550854, now seen corresponding path program 1 times [2022-11-18 20:52:29,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:29,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827387141] [2022-11-18 20:52:29,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:29,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 20:52:29,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:29,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827387141] [2022-11-18 20:52:29,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827387141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:29,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:29,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:29,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028181302] [2022-11-18 20:52:29,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:29,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:29,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:29,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:29,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:29,936 INFO L87 Difference]: Start difference. First operand 7555 states and 10011 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:30,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:30,469 INFO L93 Difference]: Finished difference Result 8837 states and 11785 transitions. [2022-11-18 20:52:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:30,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2022-11-18 20:52:30,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:30,475 INFO L225 Difference]: With dead ends: 8837 [2022-11-18 20:52:30,475 INFO L226 Difference]: Without dead ends: 4627 [2022-11-18 20:52:30,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:30,479 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 137 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:30,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 378 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2022-11-18 20:52:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 4226. [2022-11-18 20:52:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4226 states, 4225 states have (on average 1.3015384615384615) internal successors, (5499), 4225 states have internal predecessors, (5499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 5499 transitions. [2022-11-18 20:52:30,794 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 5499 transitions. Word has length 102 [2022-11-18 20:52:30,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:30,795 INFO L495 AbstractCegarLoop]: Abstraction has 4226 states and 5499 transitions. [2022-11-18 20:52:30,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:30,795 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 5499 transitions. [2022-11-18 20:52:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-18 20:52:30,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:30,798 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-18 20:52:30,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-18 20:52:30,798 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:30,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1722623032, now seen corresponding path program 1 times [2022-11-18 20:52:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:30,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390228038] [2022-11-18 20:52:30,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:52:30,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:30,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390228038] [2022-11-18 20:52:30,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390228038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:30,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:30,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:30,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917171572] [2022-11-18 20:52:30,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:30,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:30,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:30,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:30,936 INFO L87 Difference]: Start difference. First operand 4226 states and 5499 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:31,452 INFO L93 Difference]: Finished difference Result 4448 states and 5795 transitions. [2022-11-18 20:52:31,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:31,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-11-18 20:52:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:31,457 INFO L225 Difference]: With dead ends: 4448 [2022-11-18 20:52:31,457 INFO L226 Difference]: Without dead ends: 3787 [2022-11-18 20:52:31,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:31,459 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 172 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:31,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 531 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2022-11-18 20:52:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3566. [2022-11-18 20:52:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3566 states, 3565 states have (on average 1.293969144460028) internal successors, (4613), 3565 states have internal predecessors, (4613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 4613 transitions. [2022-11-18 20:52:31,712 INFO L78 Accepts]: Start accepts. Automaton has 3566 states and 4613 transitions. Word has length 103 [2022-11-18 20:52:31,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:31,713 INFO L495 AbstractCegarLoop]: Abstraction has 3566 states and 4613 transitions. [2022-11-18 20:52:31,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3566 states and 4613 transitions. [2022-11-18 20:52:31,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-18 20:52:31,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:31,715 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-18 20:52:31,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-18 20:52:31,716 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:31,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:31,716 INFO L85 PathProgramCache]: Analyzing trace with hash -37264520, now seen corresponding path program 2 times [2022-11-18 20:52:31,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:31,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124525266] [2022-11-18 20:52:31,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:31,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:31,829 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 20:52:31,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:31,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124525266] [2022-11-18 20:52:31,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124525266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:31,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:31,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:31,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369722170] [2022-11-18 20:52:31,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:31,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:31,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:31,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:31,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:31,831 INFO L87 Difference]: Start difference. First operand 3566 states and 4613 transitions. Second operand has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:32,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:32,209 INFO L93 Difference]: Finished difference Result 3567 states and 4613 transitions. [2022-11-18 20:52:32,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:32,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-11-18 20:52:32,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:32,212 INFO L225 Difference]: With dead ends: 3567 [2022-11-18 20:52:32,212 INFO L226 Difference]: Without dead ends: 2554 [2022-11-18 20:52:32,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:32,214 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 156 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:32,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 480 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2022-11-18 20:52:32,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2554. [2022-11-18 20:52:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2553 states have (on average 1.2867215041128084) internal successors, (3285), 2553 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:32,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3285 transitions. [2022-11-18 20:52:32,411 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3285 transitions. Word has length 103 [2022-11-18 20:52:32,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:32,411 INFO L495 AbstractCegarLoop]: Abstraction has 2554 states and 3285 transitions. [2022-11-18 20:52:32,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3285 transitions. [2022-11-18 20:52:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-18 20:52:32,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:32,414 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-18 20:52:32,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-18 20:52:32,414 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-18 20:52:32,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:32,414 INFO L85 PathProgramCache]: Analyzing trace with hash -131639445, now seen corresponding path program 1 times [2022-11-18 20:52:32,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:32,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962337687] [2022-11-18 20:52:32,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:32,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:52:32,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:32,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962337687] [2022-11-18 20:52:32,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962337687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:32,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:32,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:32,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510567966] [2022-11-18 20:52:32,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:32,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:32,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:32,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:32,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:32,550 INFO L87 Difference]: Start difference. First operand 2554 states and 3285 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:32,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:32,876 INFO L93 Difference]: Finished difference Result 2554 states and 3285 transitions. [2022-11-18 20:52:32,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:32,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2022-11-18 20:52:32,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:32,877 INFO L225 Difference]: With dead ends: 2554 [2022-11-18 20:52:32,877 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 20:52:32,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:32,880 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 147 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:32,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 517 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:32,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 20:52:32,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 20:52:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 20:52:32,881 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2022-11-18 20:52:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:32,881 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 20:52:32,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 20:52:32,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 20:52:32,884 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-18 20:52:32,885 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-18 20:52:32,886 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-18 20:52:32,886 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-18 20:52:32,886 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-18 20:52:32,886 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-18 20:52:32,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-18 20:52:32,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-18 20:52:32,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-18 20:52:32,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-18 20:52:32,898 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-18 20:52:32,898 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-18 20:52:32,899 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-18 20:52:32,899 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-18 20:52:32,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-18 20:52:32,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 20:52:50,694 WARN L233 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 873 DAG size of output: 864 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-18 20:53:04,486 WARN L233 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 881 DAG size of output: 872 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-18 20:53:12,656 WARN L233 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 861 DAG size of output: 852 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-18 20:53:20,221 WARN L233 SmtUtils]: Spent 7.56s on a formula simplification. DAG size of input: 909 DAG size of output: 900 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-18 20:53:38,003 WARN L233 SmtUtils]: Spent 7.91s on a formula simplification. DAG size of input: 862 DAG size of output: 853 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-18 20:53:52,612 WARN L233 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 864 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-18 20:54:04,980 WARN L233 SmtUtils]: Spent 5.56s on a formula simplification. DAG size of input: 872 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-18 20:54:10,637 WARN L233 SmtUtils]: Spent 5.65s on a formula simplification. DAG size of input: 852 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-18 20:54:16,932 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 900 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-18 20:54:32,402 WARN L233 SmtUtils]: Spent 5.72s on a formula simplification. DAG size of input: 853 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-18 20:54:32,412 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-18 20:54:32,413 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 280) no Hoare annotation was computed. [2022-11-18 20:54:32,413 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 351) no Hoare annotation was computed. [2022-11-18 20:54:32,413 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 408) no Hoare annotation was computed. [2022-11-18 20:54:32,414 INFO L895 garLoopResultBuilder]: At program point L350(lines 135 351) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-11-18 20:54:32,414 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 20:54:32,414 INFO L895 garLoopResultBuilder]: At program point L284(lines 265 285) the Hoare annotation is: (let ((.cse0 (= ~st1~0 1)) (.cse10 (= ~st2~0 1)) (.cse1 (= (* 256 (div ~mode3~0 256)) ~mode3~0))) (let ((.cse4 (and .cse0 .cse10 .cse1)) (.cse3 (<= ~st2~0 0)) (.cse2 (<= 0 ~st2~0)) (.cse5 (<= ~st1~0 0)) (.cse7 (<= 0 ~st1~0)) (.cse8 (or (and .cse10 .cse1) (let ((.cse11 (+ ~st2~0 ~st1~0))) (and .cse1 (<= .cse11 0) (<= 0 .cse11))))) (.cse9 (= ~st3~0 1))) (or (and (<= ~st3~0 0) (or (and .cse0 .cse1 .cse2 .cse3) .cse4) (<= 0 ~st3~0)) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and .cse5 (<= 0 .cse6) .cse7 .cse8 (<= .cse6 0))) (and (or .cse4 (and .cse0 .cse1 .cse3)) .cse2 .cse9) (and .cse5 .cse7 .cse8 .cse9)))) [2022-11-18 20:54:32,414 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 300) no Hoare annotation was computed. [2022-11-18 20:54:32,415 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 448) no Hoare annotation was computed. [2022-11-18 20:54:32,418 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-18 20:54:32,418 INFO L895 garLoopResultBuilder]: At program point L318(lines 146 331) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-11-18 20:54:32,418 INFO L902 garLoopResultBuilder]: At program point L467(lines 58 470) the Hoare annotation is: true [2022-11-18 20:54:32,419 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-18 20:54:32,421 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 346) no Hoare annotation was computed. [2022-11-18 20:54:32,421 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 403) no Hoare annotation was computed. [2022-11-18 20:54:32,421 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 443) no Hoare annotation was computed. [2022-11-18 20:54:32,421 INFO L895 garLoopResultBuilder]: At program point L369(lines 126 382) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-11-18 20:54:32,421 INFO L899 garLoopResultBuilder]: For program point L336(lines 336 345) no Hoare annotation was computed. [2022-11-18 20:54:32,422 INFO L895 garLoopResultBuilder]: At program point L304(lines 150 305) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-11-18 20:54:32,422 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 398) no Hoare annotation was computed. [2022-11-18 20:54:32,422 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 438) no Hoare annotation was computed. [2022-11-18 20:54:32,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-18 20:54:32,422 INFO L895 garLoopResultBuilder]: At program point L206(lines 114 384) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-11-18 20:54:32,422 INFO L895 garLoopResultBuilder]: At program point L355(lines 128 356) the Hoare annotation is: (let ((.cse10 (+ ~st2~0 ~st1~0))) (let ((.cse4 (<= ~st1~0 0)) (.cse7 (= ~st3~0 1)) (.cse1 (<= 0 ~st1~0)) (.cse6 (<= 0 .cse10)) (.cse9 (<= 0 ~st2~0)) (.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse0 (= ~st2~0 1)) (.cse11 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 .cse6)) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse4 .cse7 (or (and .cse0 .cse1) (and .cse1 (<= .cse10 0) .cse6))) (and .cse8 .cse11 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse11 .cse2)))) [2022-11-18 20:54:32,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 20:54:32,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-18 20:54:32,423 INFO L895 garLoopResultBuilder]: At program point L273(lines 161 286) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-11-18 20:54:32,423 INFO L895 garLoopResultBuilder]: At program point L240(lines 181 241) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-11-18 20:54:32,423 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 393) no Hoare annotation was computed. [2022-11-18 20:54:32,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-18 20:54:32,424 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 433) no Hoare annotation was computed. [2022-11-18 20:54:32,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-18 20:54:32,424 INFO L895 garLoopResultBuilder]: At program point L324(lines 312 325) the Hoare annotation is: (let ((.cse8 (<= 0 ~st2~0)) (.cse4 (= ~st2~0 1)) (.cse5 (= (* 256 (div ~mode2~0 256)) ~mode2~0))) (let ((.cse0 (let ((.cse9 (= ~st1~0 1))) (or (and .cse9 .cse5 .cse8 (<= ~st2~0 0)) (and .cse9 .cse4 .cse5)))) (.cse2 (= ~st3~0 1)) (.cse3 (<= 0 ~st1~0)) (.cse1 (<= 0 ~st3~0))) (or (and (<= ~st3~0 0) .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse2 (let ((.cse6 (<= ~st1~0 0))) (or (and .cse4 .cse5 .cse6 .cse3) (let ((.cse7 (+ ~st2~0 ~st1~0))) (and .cse5 .cse6 (<= .cse7 0) (<= 0 .cse7)))))) (and .cse4 .cse5 .cse3 (<= (+ ~st3~0 ~st1~0) 0) .cse1) (and .cse5 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) .cse3 .cse8 .cse1)))) [2022-11-18 20:54:32,424 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 299) no Hoare annotation was computed. [2022-11-18 20:54:32,424 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 382) no Hoare annotation was computed. [2022-11-18 20:54:32,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-18 20:54:32,425 INFO L895 garLoopResultBuilder]: At program point L259(lines 165 260) the Hoare annotation is: (let ((.cse5 (<= ~st2~0 0)) (.cse8 (= ~st1~0 1)) (.cse10 (<= ~st3~0 0)) (.cse2 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse4 (<= ~st1~0 0)) (.cse1 (<= 0 ~st1~0)) (.cse9 (<= 0 ~st2~0)) (.cse7 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 (<= (+ ~st3~0 ~st1~0) 0) .cse2) (let ((.cse3 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse3) .cse4 (<= .cse3 0) .cse5 (<= 0 .cse6))) (and .cse7 (or (and .cse8 .cse9 .cse5) (and .cse8 .cse0))) (and .cse8 .cse10 .cse9 .cse5 .cse2) (and .cse8 .cse0 .cse10 .cse2) (and .cse0 .cse4 .cse1 .cse7) (and .cse1 .cse9 .cse7 (<= .cse6 0)))) [2022-11-18 20:54:32,425 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-11-18 20:54:32,425 INFO L899 garLoopResultBuilder]: For program point L226-1(line 226) no Hoare annotation was computed. [2022-11-18 20:54:32,425 INFO L899 garLoopResultBuilder]: For program point L226-2(line 226) no Hoare annotation was computed. [2022-11-18 20:54:32,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-11-18 20:54:32,425 INFO L899 garLoopResultBuilder]: For program point L226-3(line 226) no Hoare annotation was computed. [2022-11-18 20:54:32,426 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 428) no Hoare annotation was computed. [2022-11-18 20:54:32,426 INFO L899 garLoopResultBuilder]: For program point L226-4(lines 226 234) no Hoare annotation was computed. [2022-11-18 20:54:32,426 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 20:54:32,426 INFO L895 garLoopResultBuilder]: At program point L375(lines 363 376) the Hoare annotation is: (let ((.cse12 (+ ~st2~0 ~st1~0))) (let ((.cse6 (<= ~st3~0 0)) (.cse4 (<= 0 ~st3~0)) (.cse10 (<= ~st1~0 0)) (.cse2 (<= 0 ~st1~0)) (.cse3 (<= 0 .cse12)) (.cse11 (= ~st3~0 1)) (.cse7 (<= 0 ~st2~0)) (.cse8 (<= ~st2~0 0)) (.cse5 (= ~st1~0 1)) (.cse0 (= ~st2~0 1)) (.cse1 (= (* 256 (div ~mode1~0 256)) ~mode1~0))) (or (and .cse0 .cse1 .cse2 (<= (+ ~st3~0 ~st1~0) 0) .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse5 .cse0 .cse6 .cse1 .cse4) (let ((.cse9 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse9) .cse1 .cse10 (<= .cse9 0) .cse8 .cse3)) (and .cse11 (or (and .cse0 .cse1 .cse10 .cse2 .cse3) (and .cse1 .cse10 .cse2 (<= .cse12 0) .cse3))) (and .cse11 (or (and .cse5 .cse1 .cse7 .cse8) (and .cse5 .cse0 .cse1)))))) [2022-11-18 20:54:32,426 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 468) no Hoare annotation was computed. [2022-11-18 20:54:32,426 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-11-18 20:54:32,427 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 286) no Hoare annotation was computed. [2022-11-18 20:54:32,427 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 356) no Hoare annotation was computed. [2022-11-18 20:54:32,427 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 330) no Hoare annotation was computed. [2022-11-18 20:54:32,427 INFO L895 garLoopResultBuilder]: At program point L228(lines 183 235) the Hoare annotation is: (let ((.cse0 (= ~st1~0 1)) (.cse3 (<= ~st2~0 0)) (.cse5 (<= ~st1~0 0)) (.cse1 (<= 0 ~st2~0)) (.cse2 (= ~st3~0 1)) (.cse6 (+ ~st2~0 ~st1~0)) (.cse8 (= ~st2~0 1)) (.cse9 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0)) (.cse10 (<= 0 ~st1~0)) (.cse7 (<= 0 ~st3~0))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse4) .cse5 (<= .cse4 0) .cse3 (<= 0 .cse6))) (and .cse0 (<= ~st3~0 0) .cse1 .cse3 .cse7) (and .cse8 .cse9 .cse5 .cse10 .cse2) (and .cse9 .cse10 .cse1 .cse2 (<= .cse6 0)) (and .cse8 .cse9 .cse10 (<= (+ ~st3~0 ~st1~0) 0) .cse7))) [2022-11-18 20:54:32,427 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 423) no Hoare annotation was computed. [2022-11-18 20:54:32,427 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-11-18 20:54:32,427 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2022-11-18 20:54:32,427 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 331) no Hoare annotation was computed. [2022-11-18 20:54:32,428 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-11-18 20:54:32,428 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 388) no Hoare annotation was computed. [2022-11-18 20:54:32,428 INFO L899 garLoopResultBuilder]: For program point L212-3(line 212) no Hoare annotation was computed. [2022-11-18 20:54:32,428 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 463) no Hoare annotation was computed. [2022-11-18 20:54:32,428 INFO L899 garLoopResultBuilder]: For program point L212-4(lines 212 221) no Hoare annotation was computed. [2022-11-18 20:54:32,428 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-18 20:54:32,428 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 381) no Hoare annotation was computed. [2022-11-18 20:54:32,428 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 325) no Hoare annotation was computed. [2022-11-18 20:54:32,429 INFO L895 garLoopResultBuilder]: At program point L279(lines 267 280) the Hoare annotation is: (let ((.cse0 (= ~st1~0 1)) (.cse10 (= ~st2~0 1)) (.cse1 (= (* 256 (div ~mode3~0 256)) ~mode3~0))) (let ((.cse4 (and .cse0 .cse10 .cse1)) (.cse3 (<= ~st2~0 0)) (.cse2 (<= 0 ~st2~0)) (.cse5 (<= ~st1~0 0)) (.cse7 (<= 0 ~st1~0)) (.cse8 (or (and .cse10 .cse1) (let ((.cse11 (+ ~st2~0 ~st1~0))) (and .cse1 (<= .cse11 0) (<= 0 .cse11))))) (.cse9 (= ~st3~0 1))) (or (and (<= ~st3~0 0) (or (and .cse0 .cse1 .cse2 .cse3) .cse4) (<= 0 ~st3~0)) (let ((.cse6 (+ ~st3~0 ~st1~0))) (and .cse5 (<= 0 .cse6) .cse7 .cse8 (<= .cse6 0))) (and (or .cse4 (and .cse0 .cse1 .cse3)) .cse2 .cse9) (and .cse5 .cse7 .cse8 .cse9)))) [2022-11-18 20:54:32,429 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 254) no Hoare annotation was computed. [2022-11-18 20:54:32,429 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-18 20:54:32,429 INFO L895 garLoopResultBuilder]: At program point L329(lines 310 330) the Hoare annotation is: (let ((.cse8 (<= 0 ~st2~0)) (.cse4 (= ~st2~0 1)) (.cse5 (= (* 256 (div ~mode2~0 256)) ~mode2~0))) (let ((.cse0 (let ((.cse9 (= ~st1~0 1))) (or (and .cse9 .cse5 .cse8 (<= ~st2~0 0)) (and .cse9 .cse4 .cse5)))) (.cse2 (= ~st3~0 1)) (.cse3 (<= 0 ~st1~0)) (.cse1 (<= 0 ~st3~0))) (or (and (<= ~st3~0 0) .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse2 (let ((.cse6 (<= ~st1~0 0))) (or (and .cse4 .cse5 .cse6 .cse3) (let ((.cse7 (+ ~st2~0 ~st1~0))) (and .cse5 .cse6 (<= .cse7 0) (<= 0 .cse7)))))) (and .cse4 .cse5 .cse3 (<= (+ ~st3~0 ~st1~0) 0) .cse1) (and .cse5 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) .cse3 .cse8 .cse1)))) [2022-11-18 20:54:32,429 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 418) no Hoare annotation was computed. [2022-11-18 20:54:32,429 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 20:54:32,429 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-18 20:54:32,429 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-11-18 20:54:32,430 INFO L899 garLoopResultBuilder]: For program point L181-1(line 181) no Hoare annotation was computed. [2022-11-18 20:54:32,430 INFO L899 garLoopResultBuilder]: For program point L181-2(line 181) no Hoare annotation was computed. [2022-11-18 20:54:32,430 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 458) no Hoare annotation was computed. [2022-11-18 20:54:32,430 INFO L899 garLoopResultBuilder]: For program point L181-3(line 181) no Hoare annotation was computed. [2022-11-18 20:54:32,430 INFO L899 garLoopResultBuilder]: For program point L181-4(lines 181 241) no Hoare annotation was computed. [2022-11-18 20:54:32,430 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 376) no Hoare annotation was computed. [2022-11-18 20:54:32,430 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 260) no Hoare annotation was computed. [2022-11-18 20:54:32,431 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-11-18 20:54:32,431 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-18 20:54:32,431 INFO L895 garLoopResultBuilder]: At program point L380(lines 361 381) the Hoare annotation is: (let ((.cse12 (+ ~st2~0 ~st1~0))) (let ((.cse6 (<= ~st3~0 0)) (.cse4 (<= 0 ~st3~0)) (.cse10 (<= ~st1~0 0)) (.cse2 (<= 0 ~st1~0)) (.cse3 (<= 0 .cse12)) (.cse11 (= ~st3~0 1)) (.cse7 (<= 0 ~st2~0)) (.cse8 (<= ~st2~0 0)) (.cse5 (= ~st1~0 1)) (.cse0 (= ~st2~0 1)) (.cse1 (= (* 256 (div ~mode1~0 256)) ~mode1~0))) (or (and .cse0 .cse1 .cse2 (<= (+ ~st3~0 ~st1~0) 0) .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse5 .cse0 .cse6 .cse1 .cse4) (let ((.cse9 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse9) .cse1 .cse10 (<= .cse9 0) .cse8 .cse3)) (and .cse11 (or (and .cse0 .cse1 .cse10 .cse2 .cse3) (and .cse1 .cse10 .cse2 (<= .cse12 0) .cse3))) (and .cse11 (or (and .cse5 .cse1 .cse7 .cse8) (and .cse5 .cse0 .cse1)))))) [2022-11-18 20:54:32,431 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 285) no Hoare annotation was computed. [2022-11-18 20:54:32,431 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-11-18 20:54:32,432 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 413) no Hoare annotation was computed. [2022-11-18 20:54:32,432 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 235) no Hoare annotation was computed. [2022-11-18 20:54:32,432 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 305) no Hoare annotation was computed. [2022-11-18 20:54:32,432 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 453) no Hoare annotation was computed. [2022-11-18 20:54:32,432 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 255) no Hoare annotation was computed. [2022-11-18 20:54:32,435 INFO L444 BasicCegarLoop]: Path program histogram: [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] [2022-11-18 20:54:32,438 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:54:32,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:54:32 BoogieIcfgContainer [2022-11-18 20:54:32,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:54:32,478 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:54:32,478 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:54:32,478 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:54:32,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:52" (3/4) ... [2022-11-18 20:54:32,482 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 20:54:32,494 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-18 20:54:32,494 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-18 20:54:32,495 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-18 20:54:32,495 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:54:32,553 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:54:32,554 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:54:32,554 INFO L158 Benchmark]: Toolchain (without parser) took 161162.74ms. Allocated memory was 115.3MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 78.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-18 20:54:32,555 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 115.3MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:54:32,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.37ms. Allocated memory is still 115.3MB. Free memory was 78.6MB in the beginning and 87.0MB in the end (delta: -8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 20:54:32,555 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.11ms. Allocated memory is still 115.3MB. Free memory was 87.0MB in the beginning and 84.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:54:32,555 INFO L158 Benchmark]: Boogie Preprocessor took 56.73ms. Allocated memory is still 115.3MB. Free memory was 84.9MB in the beginning and 83.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:54:32,556 INFO L158 Benchmark]: RCFGBuilder took 688.60ms. Allocated memory is still 115.3MB. Free memory was 83.3MB in the beginning and 62.7MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-18 20:54:32,556 INFO L158 Benchmark]: TraceAbstraction took 159751.58ms. Allocated memory was 115.3MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 61.9MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-11-18 20:54:32,556 INFO L158 Benchmark]: Witness Printer took 76.26ms. Allocated memory is still 2.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:54:32,557 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.29ms. Allocated memory is still 115.3MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 507.37ms. Allocated memory is still 115.3MB. Free memory was 78.6MB in the beginning and 87.0MB in the end (delta: -8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.11ms. Allocated memory is still 115.3MB. Free memory was 87.0MB in the beginning and 84.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.73ms. Allocated memory is still 115.3MB. Free memory was 84.9MB in the beginning and 83.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 688.60ms. Allocated memory is still 115.3MB. Free memory was 83.3MB in the beginning and 62.7MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 159751.58ms. Allocated memory was 115.3MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 61.9MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 76.26ms. Allocated memory is still 2.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 159.6s, OverallIterations: 35, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 119.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6405 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6405 mSDsluCounter, 12592 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6675 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3827 IncrementalHoareTripleChecker+Invalid, 4002 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 5917 mSDtfsCounter, 3827 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14234occurred in iteration=22, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.6s AutomataMinimizationTime, 35 MinimizatonAttempts, 10699 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 2103 NumberOfFragments, 2235 HoareAnnotationTreeSize, 17 FomulaSimplifications, 214521 FormulaSimplificationTreeSizeReduction, 65.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 731155 FormulaSimplificationTreeSizeReductionInter, 54.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2508 NumberOfCodeBlocks, 2508 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2473 ConstructedInterpolants, 0 QuantifiedInterpolants, 9727 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 746/746 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((st3 <= 0 && ((((st1 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode2 / 256) == mode2))) && 0 <= st3) || (st3 == 1 && ((((st1 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode2 / 256) == mode2)))) || ((0 <= st1 && st3 == 1) && ((((st2 == 1 && 256 * (mode2 / 256) == mode2) && st1 <= 0) && 0 <= st1) || (((256 * (mode2 / 256) == mode2 && st1 <= 0) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || ((((st2 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3)) || ((((256 * (mode2 / 256) == mode2 && st3 + st2 + st1 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= st3) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((st1 <= 0 && st3 == 1) && ((st2 == 1 && 0 <= st1) || ((0 <= st1 && st2 + st1 <= 0) && 0 <= st2 + st1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: (((((((st1 == 1 && 0 <= st2) && st3 == 1) && st2 <= 0) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || ((((st2 == 1 && r1 / 256 * 256 + 2 < r1) && st1 <= 0) && 0 <= st1) && st3 == 1)) || ((((r1 / 256 * 256 + 2 < r1 && 0 <= st1) && 0 <= st2) && st3 == 1) && st2 + st1 <= 0)) || ((((st2 == 1 && r1 / 256 * 256 + 2 < r1) && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: ((((st3 <= 0 && ((((st1 == 1 && 256 * (mode3 / 256) == mode3) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode3 / 256) == mode3))) && 0 <= st3) || ((((st1 <= 0 && 0 <= st3 + st1) && 0 <= st1) && ((st2 == 1 && 256 * (mode3 / 256) == mode3) || ((256 * (mode3 / 256) == mode3 && st2 + st1 <= 0) && 0 <= st2 + st1))) && st3 + st1 <= 0)) || (((((st1 == 1 && st2 == 1) && 256 * (mode3 / 256) == mode3) || ((st1 == 1 && 256 * (mode3 / 256) == mode3) && st2 <= 0)) && 0 <= st2) && st3 == 1)) || (((st1 <= 0 && 0 <= st1) && ((st2 == 1 && 256 * (mode3 / 256) == mode3) || ((256 * (mode3 / 256) == mode3 && st2 + st1 <= 0) && 0 <= st2 + st1))) && st3 == 1) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((((((st2 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st1) && st3 + st1 <= 0) && 0 <= st2 + st1) && 0 <= st3) || (((((st1 == 1 && st3 <= 0) && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || ((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode1 / 256) == mode1) && 0 <= st3)) || (((((0 <= st3 + st2 + st1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((((st2 == 1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && 0 <= st1) && 0 <= st2 + st1) || ((((256 * (mode1 / 256) == mode1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || (st3 == 1 && ((((st1 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode1 / 256) == mode1))) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((st3 <= 0 && ((((st1 == 1 && 256 * (mode3 / 256) == mode3) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode3 / 256) == mode3))) && 0 <= st3) || ((((st1 <= 0 && 0 <= st3 + st1) && 0 <= st1) && ((st2 == 1 && 256 * (mode3 / 256) == mode3) || ((256 * (mode3 / 256) == mode3 && st2 + st1 <= 0) && 0 <= st2 + st1))) && st3 + st1 <= 0)) || (((((st1 == 1 && st2 == 1) && 256 * (mode3 / 256) == mode3) || ((st1 == 1 && 256 * (mode3 / 256) == mode3) && st2 <= 0)) && 0 <= st2) && st3 == 1)) || (((st1 <= 0 && 0 <= st1) && ((st2 == 1 && 256 * (mode3 / 256) == mode3) || ((256 * (mode3 / 256) == mode3 && st2 + st1 <= 0) && 0 <= st2 + st1))) && st3 == 1) - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((((((st2 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st1) && st3 + st1 <= 0) && 0 <= st2 + st1) && 0 <= st3) || (((((st1 == 1 && st3 <= 0) && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || ((((st1 == 1 && st2 == 1) && st3 <= 0) && 256 * (mode1 / 256) == mode1) && 0 <= st3)) || (((((0 <= st3 + st2 + st1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((((st2 == 1 && 256 * (mode1 / 256) == mode1) && st1 <= 0) && 0 <= st1) && 0 <= st2 + st1) || ((((256 * (mode1 / 256) == mode1 && st1 <= 0) && 0 <= st1) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || (st3 == 1 && ((((st1 == 1 && 256 * (mode1 / 256) == mode1) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode1 / 256) == mode1))) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: (((((st3 <= 0 && ((((st1 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode2 / 256) == mode2))) && 0 <= st3) || (st3 == 1 && ((((st1 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st2) && st2 <= 0) || ((st1 == 1 && st2 == 1) && 256 * (mode2 / 256) == mode2)))) || ((0 <= st1 && st3 == 1) && ((((st2 == 1 && 256 * (mode2 / 256) == mode2) && st1 <= 0) && 0 <= st1) || (((256 * (mode2 / 256) == mode2 && st1 <= 0) && st2 + st1 <= 0) && 0 <= st2 + st1)))) || ((((st2 == 1 && 256 * (mode2 / 256) == mode2) && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3)) || ((((256 * (mode2 / 256) == mode2 && st3 + st2 + st1 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= st3) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) RESULT: Ultimate proved your program to be correct! [2022-11-18 20:54:32,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a4c69e1-7ce7-4b19-bd6c-c1a47d2cadea/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE