./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:27:07,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:27:07,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:27:07,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:27:07,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:27:07,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:27:07,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:27:07,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:27:07,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:27:07,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:27:07,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:27:07,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:27:07,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:27:07,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:27:07,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:27:07,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:27:07,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:27:07,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:27:07,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:27:07,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:27:07,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:27:07,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:27:07,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:27:07,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:27:07,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:27:07,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:27:07,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:27:07,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:27:07,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:27:07,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:27:07,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:27:07,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:27:07,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:27:07,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:27:07,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:27:07,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:27:07,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:27:07,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:27:07,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:27:07,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:27:07,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:27:07,980 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 09:27:08,023 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:27:08,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:27:08,025 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:27:08,026 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:27:08,027 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:27:08,027 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:27:08,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:27:08,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:27:08,028 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:27:08,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:27:08,030 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:27:08,031 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:27:08,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:27:08,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:27:08,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:27:08,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:27:08,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:27:08,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:27:08,033 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 09:27:08,033 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:27:08,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:27:08,033 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:27:08,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:27:08,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:27:08,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:27:08,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:27:08,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:08,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:27:08,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:27:08,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:27:08,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:27:08,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:27:08,037 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:27:08,037 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:27:08,038 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:27:08,038 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_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 [2022-11-20 09:27:08,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:27:08,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:27:08,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:27:08,401 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:27:08,402 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:27:08,403 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-20 09:27:11,427 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:27:11,652 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:27:11,653 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-20 09:27:11,667 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN/data/18931b0cc/009e23e2dd60444f88d2b27907661465/FLAGeededf5e1 [2022-11-20 09:27:11,685 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN/data/18931b0cc/009e23e2dd60444f88d2b27907661465 [2022-11-20 09:27:11,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:27:11,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:27:11,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:11,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:27:11,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:27:11,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:11" (1/1) ... [2022-11-20 09:27:11,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@447ec2a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:11, skipping insertion in model container [2022-11-20 09:27:11,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:11" (1/1) ... [2022-11-20 09:27:11,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:27:11,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:27:11,925 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2022-11-20 09:27:11,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:11,957 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:27:11,991 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2022-11-20 09:27:12,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:12,021 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:27:12,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12 WrapperNode [2022-11-20 09:27:12,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:12,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:12,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:27:12,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:27:12,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,071 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 280 [2022-11-20 09:27:12,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:12,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:27:12,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:27:12,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:27:12,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,096 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:27:12,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:27:12,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:27:12,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:27:12,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:12,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:12,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:27:12,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:27:12,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:27:12,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:27:12,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:27:12,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:27:12,313 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:27:12,315 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:27:12,732 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:27:12,740 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:27:12,740 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:27:12,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:12 BoogieIcfgContainer [2022-11-20 09:27:12,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:27:12,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:27:12,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:27:12,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:27:12,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:27:11" (1/3) ... [2022-11-20 09:27:12,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fea617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:12, skipping insertion in model container [2022-11-20 09:27:12,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (2/3) ... [2022-11-20 09:27:12,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fea617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:12, skipping insertion in model container [2022-11-20 09:27:12,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:12" (3/3) ... [2022-11-20 09:27:12,755 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-20 09:27:12,777 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:27:12,778 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-20 09:27:12,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:27:12,868 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;@10e257e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:27:12,869 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-20 09:27:12,874 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-20 09:27:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 09:27:12,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:12,882 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-20 09:27:12,884 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-20 09:27:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:12,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1523339456, now seen corresponding path program 1 times [2022-11-20 09:27:12,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:12,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825618581] [2022-11-20 09:27:12,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:13,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825618581] [2022-11-20 09:27:13,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825618581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:13,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:13,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:27:13,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034205977] [2022-11-20 09:27:13,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:13,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:27:13,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:13,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:27:13,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:27:13,196 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-20 09:27:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:13,221 INFO L93 Difference]: Finished difference Result 92 states and 132 transitions. [2022-11-20 09:27:13,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:27:13,224 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-20 09:27:13,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:13,235 INFO L225 Difference]: With dead ends: 92 [2022-11-20 09:27:13,236 INFO L226 Difference]: Without dead ends: 84 [2022-11-20 09:27:13,239 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-20 09:27:13,242 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-20 09:27:13,243 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-20 09:27:13,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-20 09:27:13,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-20 09:27:13,282 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-20 09:27:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 108 transitions. [2022-11-20 09:27:13,286 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 108 transitions. Word has length 23 [2022-11-20 09:27:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:13,287 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 108 transitions. [2022-11-20 09:27:13,287 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-20 09:27:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2022-11-20 09:27:13,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 09:27:13,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:13,289 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-20 09:27:13,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:27:13,290 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-20 09:27:13,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:13,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1151032549, now seen corresponding path program 1 times [2022-11-20 09:27:13,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:13,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659097362] [2022-11-20 09:27:13,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:13,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:13,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:13,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659097362] [2022-11-20 09:27:13,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659097362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:13,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:13,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:13,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968395986] [2022-11-20 09:27:13,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:13,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:13,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:13,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:13,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:13,539 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-20 09:27:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:13,603 INFO L93 Difference]: Finished difference Result 206 states and 273 transitions. [2022-11-20 09:27:13,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:13,604 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-20 09:27:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:13,606 INFO L225 Difference]: With dead ends: 206 [2022-11-20 09:27:13,606 INFO L226 Difference]: Without dead ends: 141 [2022-11-20 09:27:13,607 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-20 09:27:13,608 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-20 09:27:13,609 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-20 09:27:13,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-20 09:27:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2022-11-20 09:27:13,625 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-20 09:27:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2022-11-20 09:27:13,628 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 34 [2022-11-20 09:27:13,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:13,629 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2022-11-20 09:27:13,629 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-20 09:27:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2022-11-20 09:27:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 09:27:13,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:13,631 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-20 09:27:13,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:27:13,631 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-20 09:27:13,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:13,632 INFO L85 PathProgramCache]: Analyzing trace with hash -576537676, now seen corresponding path program 1 times [2022-11-20 09:27:13,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:13,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019631804] [2022-11-20 09:27:13,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:13,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:13,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:13,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019631804] [2022-11-20 09:27:13,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019631804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:13,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:13,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:13,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062967839] [2022-11-20 09:27:13,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:13,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:13,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:13,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:13,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:13,762 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-20 09:27:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:13,850 INFO L93 Difference]: Finished difference Result 333 states and 485 transitions. [2022-11-20 09:27:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:13,851 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-20 09:27:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:13,858 INFO L225 Difference]: With dead ends: 333 [2022-11-20 09:27:13,860 INFO L226 Difference]: Without dead ends: 223 [2022-11-20 09:27:13,861 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-20 09:27:13,863 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-20 09:27:13,867 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-20 09:27:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-20 09:27:13,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 211. [2022-11-20 09:27:13,925 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-20 09:27:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 319 transitions. [2022-11-20 09:27:13,936 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 319 transitions. Word has length 35 [2022-11-20 09:27:13,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:13,936 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 319 transitions. [2022-11-20 09:27:13,937 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-20 09:27:13,937 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 319 transitions. [2022-11-20 09:27:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 09:27:13,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:13,941 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-20 09:27:13,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:27:13,942 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-20 09:27:13,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:13,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1557567312, now seen corresponding path program 1 times [2022-11-20 09:27:13,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:13,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563621913] [2022-11-20 09:27:13,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:13,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:14,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:14,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563621913] [2022-11-20 09:27:14,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563621913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:14,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:14,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:14,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711462560] [2022-11-20 09:27:14,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:14,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:27:14,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:14,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:27:14,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:14,139 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-20 09:27:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:14,422 INFO L93 Difference]: Finished difference Result 592 states and 919 transitions. [2022-11-20 09:27:14,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:14,423 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-20 09:27:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:14,426 INFO L225 Difference]: With dead ends: 592 [2022-11-20 09:27:14,427 INFO L226 Difference]: Without dead ends: 589 [2022-11-20 09:27:14,428 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-20 09:27:14,430 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-20 09:27:14,433 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-20 09:27:14,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-11-20 09:27:14,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 391. [2022-11-20 09:27:14,502 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-20 09:27:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 607 transitions. [2022-11-20 09:27:14,505 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 607 transitions. Word has length 36 [2022-11-20 09:27:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:14,505 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 607 transitions. [2022-11-20 09:27:14,505 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-20 09:27:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 607 transitions. [2022-11-20 09:27:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 09:27:14,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:14,507 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-20 09:27:14,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:27:14,507 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-20 09:27:14,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1039946552, now seen corresponding path program 1 times [2022-11-20 09:27:14,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:14,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726035991] [2022-11-20 09:27:14,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:14,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:14,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:14,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726035991] [2022-11-20 09:27:14,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726035991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:14,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:14,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:14,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692863065] [2022-11-20 09:27:14,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:14,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:27:14,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:14,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:27:14,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:14,599 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-20 09:27:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:14,770 INFO L93 Difference]: Finished difference Result 580 states and 907 transitions. [2022-11-20 09:27:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:27:14,771 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-20 09:27:14,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:14,775 INFO L225 Difference]: With dead ends: 580 [2022-11-20 09:27:14,776 INFO L226 Difference]: Without dead ends: 577 [2022-11-20 09:27:14,777 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-20 09:27:14,781 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-20 09:27:14,782 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-20 09:27:14,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-11-20 09:27:14,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 571. [2022-11-20 09:27:14,845 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-20 09:27:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 883 transitions. [2022-11-20 09:27:14,848 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 883 transitions. Word has length 37 [2022-11-20 09:27:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:14,852 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 883 transitions. [2022-11-20 09:27:14,853 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-20 09:27:14,853 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 883 transitions. [2022-11-20 09:27:14,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-20 09:27:14,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:14,859 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-20 09:27:14,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:27:14,861 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-20 09:27:14,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:14,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2121395118, now seen corresponding path program 1 times [2022-11-20 09:27:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:14,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068362214] [2022-11-20 09:27:14,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:14,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:14,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:14,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068362214] [2022-11-20 09:27:14,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068362214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:14,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:14,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:14,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323053727] [2022-11-20 09:27:14,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:14,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:14,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:14,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:14,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:14,976 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-20 09:27:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:15,487 INFO L93 Difference]: Finished difference Result 2047 states and 3187 transitions. [2022-11-20 09:27:15,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:27:15,488 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-20 09:27:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:15,495 INFO L225 Difference]: With dead ends: 2047 [2022-11-20 09:27:15,495 INFO L226 Difference]: Without dead ends: 1495 [2022-11-20 09:27:15,498 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-20 09:27:15,499 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.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:15,499 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.3s Time] [2022-11-20 09:27:15,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2022-11-20 09:27:15,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1111. [2022-11-20 09:27:15,618 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-20 09:27:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1687 transitions. [2022-11-20 09:27:15,622 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1687 transitions. Word has length 38 [2022-11-20 09:27:15,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:15,623 INFO L495 AbstractCegarLoop]: Abstraction has 1111 states and 1687 transitions. [2022-11-20 09:27:15,623 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-20 09:27:15,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1687 transitions. [2022-11-20 09:27:15,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 09:27:15,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:15,624 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-20 09:27:15,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:27:15,625 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-20 09:27:15,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:15,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1338739078, now seen corresponding path program 1 times [2022-11-20 09:27:15,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:15,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338761793] [2022-11-20 09:27:15,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:15,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:15,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:15,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338761793] [2022-11-20 09:27:15,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338761793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:15,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:15,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:15,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298599976] [2022-11-20 09:27:15,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:15,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:15,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:15,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:15,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:15,726 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-20 09:27:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:16,080 INFO L93 Difference]: Finished difference Result 1486 states and 2275 transitions. [2022-11-20 09:27:16,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:27:16,081 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-20 09:27:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:16,087 INFO L225 Difference]: With dead ends: 1486 [2022-11-20 09:27:16,087 INFO L226 Difference]: Without dead ends: 1483 [2022-11-20 09:27:16,088 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-20 09:27:16,089 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-20 09:27:16,090 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-20 09:27:16,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2022-11-20 09:27:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1471. [2022-11-20 09:27:16,243 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-20 09:27:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2203 transitions. [2022-11-20 09:27:16,247 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2203 transitions. Word has length 39 [2022-11-20 09:27:16,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:16,248 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 2203 transitions. [2022-11-20 09:27:16,248 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-20 09:27:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2203 transitions. [2022-11-20 09:27:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 09:27:16,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:16,249 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-20 09:27:16,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:27:16,250 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-20 09:27:16,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:16,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1056432401, now seen corresponding path program 1 times [2022-11-20 09:27:16,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:16,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695452229] [2022-11-20 09:27:16,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:16,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:16,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:16,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695452229] [2022-11-20 09:27:16,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695452229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:16,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:16,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:16,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949166842] [2022-11-20 09:27:16,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:16,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:16,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:16,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:16,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:16,296 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-20 09:27:16,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:16,591 INFO L93 Difference]: Finished difference Result 4023 states and 6027 transitions. [2022-11-20 09:27:16,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:16,592 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-20 09:27:16,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:16,603 INFO L225 Difference]: With dead ends: 4023 [2022-11-20 09:27:16,603 INFO L226 Difference]: Without dead ends: 2571 [2022-11-20 09:27:16,605 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-20 09:27:16,609 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-20 09:27:16,613 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-20 09:27:16,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-11-20 09:27:16,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2559. [2022-11-20 09:27:16,887 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-20 09:27:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 3811 transitions. [2022-11-20 09:27:16,895 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 3811 transitions. Word has length 40 [2022-11-20 09:27:16,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:16,895 INFO L495 AbstractCegarLoop]: Abstraction has 2559 states and 3811 transitions. [2022-11-20 09:27:16,896 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-20 09:27:16,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 3811 transitions. [2022-11-20 09:27:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-20 09:27:16,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:16,899 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-20 09:27:16,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:27:16,899 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-20 09:27:16,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:16,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1624205634, now seen corresponding path program 1 times [2022-11-20 09:27:16,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:16,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456003784] [2022-11-20 09:27:16,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:16,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:17,012 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-20 09:27:17,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:17,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456003784] [2022-11-20 09:27:17,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456003784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:17,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:17,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:17,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838680317] [2022-11-20 09:27:17,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:17,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:17,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:17,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:17,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:17,016 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-20 09:27:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:17,357 INFO L93 Difference]: Finished difference Result 5815 states and 8629 transitions. [2022-11-20 09:27:17,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:17,358 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-20 09:27:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:17,370 INFO L225 Difference]: With dead ends: 5815 [2022-11-20 09:27:17,370 INFO L226 Difference]: Without dead ends: 3275 [2022-11-20 09:27:17,375 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-20 09:27:17,377 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-20 09:27:17,378 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-20 09:27:17,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2022-11-20 09:27:17,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3229. [2022-11-20 09:27:17,704 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-20 09:27:17,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4749 transitions. [2022-11-20 09:27:17,714 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4749 transitions. Word has length 61 [2022-11-20 09:27:17,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:17,715 INFO L495 AbstractCegarLoop]: Abstraction has 3229 states and 4749 transitions. [2022-11-20 09:27:17,715 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-20 09:27:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4749 transitions. [2022-11-20 09:27:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 09:27:17,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:17,718 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-20 09:27:17,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:27:17,718 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-20 09:27:17,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:17,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2031721315, now seen corresponding path program 1 times [2022-11-20 09:27:17,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:17,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745987791] [2022-11-20 09:27:17,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:17,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:17,980 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-20 09:27:17,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:17,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745987791] [2022-11-20 09:27:17,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745987791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:17,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:17,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:27:17,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587116715] [2022-11-20 09:27:17,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:17,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:17,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:17,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:17,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:17,983 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-20 09:27:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:18,477 INFO L93 Difference]: Finished difference Result 6443 states and 9477 transitions. [2022-11-20 09:27:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:18,477 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-20 09:27:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:18,489 INFO L225 Difference]: With dead ends: 6443 [2022-11-20 09:27:18,489 INFO L226 Difference]: Without dead ends: 3235 [2022-11-20 09:27:18,493 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-20 09:27:18,494 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-20 09:27:18,495 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-20 09:27:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2022-11-20 09:27:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 3229. [2022-11-20 09:27:18,830 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-20 09:27:18,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4717 transitions. [2022-11-20 09:27:18,842 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4717 transitions. Word has length 65 [2022-11-20 09:27:18,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:18,843 INFO L495 AbstractCegarLoop]: Abstraction has 3229 states and 4717 transitions. [2022-11-20 09:27:18,846 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-20 09:27:18,847 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4717 transitions. [2022-11-20 09:27:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-20 09:27:18,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:18,848 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-20 09:27:18,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:27:18,848 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-20 09:27:18,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:18,849 INFO L85 PathProgramCache]: Analyzing trace with hash 947482817, now seen corresponding path program 1 times [2022-11-20 09:27:18,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:18,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895113923] [2022-11-20 09:27:18,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:18,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:18,966 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-20 09:27:18,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:18,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895113923] [2022-11-20 09:27:18,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895113923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:18,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:18,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:18,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562969705] [2022-11-20 09:27:18,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:18,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:27:18,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:18,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:27:18,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:18,970 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-20 09:27:19,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:19,423 INFO L93 Difference]: Finished difference Result 4189 states and 6133 transitions. [2022-11-20 09:27:19,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:27:19,424 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-20 09:27:19,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:19,439 INFO L225 Difference]: With dead ends: 4189 [2022-11-20 09:27:19,439 INFO L226 Difference]: Without dead ends: 4186 [2022-11-20 09:27:19,440 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-20 09:27:19,442 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-20 09:27:19,443 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-20 09:27:19,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4186 states. [2022-11-20 09:27:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4186 to 3277. [2022-11-20 09:27:19,848 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-20 09:27:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 3277 states and 4817 transitions. [2022-11-20 09:27:19,860 INFO L78 Accepts]: Start accepts. Automaton has 3277 states and 4817 transitions. Word has length 66 [2022-11-20 09:27:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:19,860 INFO L495 AbstractCegarLoop]: Abstraction has 3277 states and 4817 transitions. [2022-11-20 09:27:19,860 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-20 09:27:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 4817 transitions. [2022-11-20 09:27:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-20 09:27:19,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:19,862 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-20 09:27:19,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 09:27:19,863 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-20 09:27:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1013767766, now seen corresponding path program 1 times [2022-11-20 09:27:19,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:19,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667559071] [2022-11-20 09:27:19,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:19,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:19,970 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-20 09:27:19,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:19,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667559071] [2022-11-20 09:27:19,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667559071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:19,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:19,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:19,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796744204] [2022-11-20 09:27:19,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:19,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:27:19,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:19,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:27:19,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:19,974 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-20 09:27:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:20,542 INFO L93 Difference]: Finished difference Result 5140 states and 7525 transitions. [2022-11-20 09:27:20,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:27:20,543 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-20 09:27:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:20,561 INFO L225 Difference]: With dead ends: 5140 [2022-11-20 09:27:20,561 INFO L226 Difference]: Without dead ends: 5137 [2022-11-20 09:27:20,563 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-20 09:27:20,564 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-20 09:27:20,564 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-20 09:27:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2022-11-20 09:27:21,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 5125. [2022-11-20 09:27:21,009 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-20 09:27:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 7453 transitions. [2022-11-20 09:27:21,022 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 7453 transitions. Word has length 68 [2022-11-20 09:27:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:21,023 INFO L495 AbstractCegarLoop]: Abstraction has 5125 states and 7453 transitions. [2022-11-20 09:27:21,023 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-20 09:27:21,023 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 7453 transitions. [2022-11-20 09:27:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-20 09:27:21,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:21,024 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-20 09:27:21,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 09:27:21,025 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-20 09:27:21,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:21,025 INFO L85 PathProgramCache]: Analyzing trace with hash -459438275, now seen corresponding path program 1 times [2022-11-20 09:27:21,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:21,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469494671] [2022-11-20 09:27:21,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:21,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,148 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-20 09:27:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:21,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469494671] [2022-11-20 09:27:21,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469494671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:21,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:21,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:21,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937306173] [2022-11-20 09:27:21,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:21,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:21,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:21,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:21,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:21,151 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-20 09:27:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:21,879 INFO L93 Difference]: Finished difference Result 10687 states and 15465 transitions. [2022-11-20 09:27:21,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:27:21,880 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-20 09:27:21,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:21,917 INFO L225 Difference]: With dead ends: 10687 [2022-11-20 09:27:21,917 INFO L226 Difference]: Without dead ends: 5583 [2022-11-20 09:27:21,924 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-20 09:27:21,925 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:21,925 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.2s Time] [2022-11-20 09:27:21,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5583 states. [2022-11-20 09:27:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5583 to 5125. [2022-11-20 09:27:22,468 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-20 09:27:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 7409 transitions. [2022-11-20 09:27:22,479 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 7409 transitions. Word has length 68 [2022-11-20 09:27:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:22,480 INFO L495 AbstractCegarLoop]: Abstraction has 5125 states and 7409 transitions. [2022-11-20 09:27:22,480 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-20 09:27:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 7409 transitions. [2022-11-20 09:27:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-20 09:27:22,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:22,487 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-20 09:27:22,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 09:27:22,488 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-20 09:27:22,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:22,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2075261, now seen corresponding path program 1 times [2022-11-20 09:27:22,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:22,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277680672] [2022-11-20 09:27:22,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:22,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,625 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-20 09:27:22,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:22,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277680672] [2022-11-20 09:27:22,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277680672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:22,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:22,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:22,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481356095] [2022-11-20 09:27:22,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:22,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:22,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:22,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:22,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:22,628 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-20 09:27:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:23,200 INFO L93 Difference]: Finished difference Result 10058 states and 14493 transitions. [2022-11-20 09:27:23,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:23,201 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-20 09:27:23,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:23,223 INFO L225 Difference]: With dead ends: 10058 [2022-11-20 09:27:23,223 INFO L226 Difference]: Without dead ends: 6802 [2022-11-20 09:27:23,227 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-20 09:27:23,228 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-20 09:27:23,228 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-20 09:27:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6802 states. [2022-11-20 09:27:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6802 to 6793. [2022-11-20 09:27:23,800 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-20 09:27:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 9621 transitions. [2022-11-20 09:27:23,817 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 9621 transitions. Word has length 68 [2022-11-20 09:27:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:23,817 INFO L495 AbstractCegarLoop]: Abstraction has 6793 states and 9621 transitions. [2022-11-20 09:27:23,817 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-20 09:27:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 9621 transitions. [2022-11-20 09:27:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-20 09:27:23,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:23,819 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-20 09:27:23,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 09:27:23,819 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-20 09:27:23,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:23,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1362029810, now seen corresponding path program 1 times [2022-11-20 09:27:23,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:23,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92917429] [2022-11-20 09:27:23,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:23,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,904 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-20 09:27:23,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:23,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92917429] [2022-11-20 09:27:23,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92917429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:23,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:23,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:23,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700659125] [2022-11-20 09:27:23,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:23,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:27:23,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:23,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:27:23,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:23,907 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-20 09:27:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:24,473 INFO L93 Difference]: Finished difference Result 6799 states and 9621 transitions. [2022-11-20 09:27:24,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:27:24,474 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-20 09:27:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:24,493 INFO L225 Difference]: With dead ends: 6799 [2022-11-20 09:27:24,493 INFO L226 Difference]: Without dead ends: 6796 [2022-11-20 09:27:24,498 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-20 09:27:24,499 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-20 09:27:24,499 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-20 09:27:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6796 states. [2022-11-20 09:27:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6796 to 6790. [2022-11-20 09:27:25,144 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-20 09:27:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6790 states to 6790 states and 9477 transitions. [2022-11-20 09:27:25,158 INFO L78 Accepts]: Start accepts. Automaton has 6790 states and 9477 transitions. Word has length 69 [2022-11-20 09:27:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:25,158 INFO L495 AbstractCegarLoop]: Abstraction has 6790 states and 9477 transitions. [2022-11-20 09:27:25,158 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-20 09:27:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 6790 states and 9477 transitions. [2022-11-20 09:27:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-20 09:27:25,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:25,160 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-20 09:27:25,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 09:27:25,160 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-20 09:27:25,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash -64332951, now seen corresponding path program 1 times [2022-11-20 09:27:25,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:25,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246048012] [2022-11-20 09:27:25,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:25,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:25,295 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-20 09:27:25,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:25,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246048012] [2022-11-20 09:27:25,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246048012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:25,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:25,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:25,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284484626] [2022-11-20 09:27:25,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:25,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:25,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:25,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:25,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:25,300 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-20 09:27:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:25,983 INFO L93 Difference]: Finished difference Result 13530 states and 19329 transitions. [2022-11-20 09:27:25,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:25,984 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-20 09:27:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:26,004 INFO L225 Difference]: With dead ends: 13530 [2022-11-20 09:27:26,004 INFO L226 Difference]: Without dead ends: 9061 [2022-11-20 09:27:26,010 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-20 09:27:26,011 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-20 09:27:26,011 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-20 09:27:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9061 states. [2022-11-20 09:27:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9061 to 7966. [2022-11-20 09:27:26,565 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-20 09:27:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7966 states to 7966 states and 11309 transitions. [2022-11-20 09:27:26,581 INFO L78 Accepts]: Start accepts. Automaton has 7966 states and 11309 transitions. Word has length 69 [2022-11-20 09:27:26,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:26,581 INFO L495 AbstractCegarLoop]: Abstraction has 7966 states and 11309 transitions. [2022-11-20 09:27:26,581 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-20 09:27:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 7966 states and 11309 transitions. [2022-11-20 09:27:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-20 09:27:26,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:26,583 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-20 09:27:26,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 09:27:26,583 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-20 09:27:26,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:26,584 INFO L85 PathProgramCache]: Analyzing trace with hash -726748712, now seen corresponding path program 1 times [2022-11-20 09:27:26,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:26,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065212781] [2022-11-20 09:27:26,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:26,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,683 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-20 09:27:26,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:26,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065212781] [2022-11-20 09:27:26,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065212781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:26,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:26,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:26,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936930904] [2022-11-20 09:27:26,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:26,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:26,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:26,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:26,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:26,685 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-20 09:27:27,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:27,747 INFO L93 Difference]: Finished difference Result 14620 states and 20973 transitions. [2022-11-20 09:27:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:27,748 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-20 09:27:27,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:27,771 INFO L225 Difference]: With dead ends: 14620 [2022-11-20 09:27:27,771 INFO L226 Difference]: Without dead ends: 8923 [2022-11-20 09:27:27,779 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-20 09:27:27,780 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-20 09:27:27,780 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-20 09:27:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8923 states. [2022-11-20 09:27:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8923 to 8914. [2022-11-20 09:27:28,416 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-20 09:27:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8914 states to 8914 states and 12589 transitions. [2022-11-20 09:27:28,434 INFO L78 Accepts]: Start accepts. Automaton has 8914 states and 12589 transitions. Word has length 70 [2022-11-20 09:27:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:28,435 INFO L495 AbstractCegarLoop]: Abstraction has 8914 states and 12589 transitions. [2022-11-20 09:27:28,435 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-20 09:27:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 8914 states and 12589 transitions. [2022-11-20 09:27:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-20 09:27:28,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:28,437 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-20 09:27:28,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 09:27:28,437 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-20 09:27:28,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1134710146, now seen corresponding path program 1 times [2022-11-20 09:27:28,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:28,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629451881] [2022-11-20 09:27:28,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:28,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,518 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-20 09:27:28,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:28,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629451881] [2022-11-20 09:27:28,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629451881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:28,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:28,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:28,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287716931] [2022-11-20 09:27:28,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:28,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:27:28,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:27:28,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:28,521 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-20 09:27:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:29,221 INFO L93 Difference]: Finished difference Result 10822 states and 15421 transitions. [2022-11-20 09:27:29,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:27:29,222 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-20 09:27:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:29,246 INFO L225 Difference]: With dead ends: 10822 [2022-11-20 09:27:29,246 INFO L226 Difference]: Without dead ends: 10819 [2022-11-20 09:27:29,250 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-20 09:27:29,251 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:29,251 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.2s Time] [2022-11-20 09:27:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10819 states. [2022-11-20 09:27:29,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10819 to 8914. [2022-11-20 09:27:30,005 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-20 09:27:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8914 states to 8914 states and 12445 transitions. [2022-11-20 09:27:30,020 INFO L78 Accepts]: Start accepts. Automaton has 8914 states and 12445 transitions. Word has length 70 [2022-11-20 09:27:30,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:30,021 INFO L495 AbstractCegarLoop]: Abstraction has 8914 states and 12445 transitions. [2022-11-20 09:27:30,021 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-20 09:27:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 8914 states and 12445 transitions. [2022-11-20 09:27:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-20 09:27:30,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:30,023 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-20 09:27:30,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 09:27:30,023 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-20 09:27:30,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:30,024 INFO L85 PathProgramCache]: Analyzing trace with hash -296117079, now seen corresponding path program 1 times [2022-11-20 09:27:30,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:30,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820125292] [2022-11-20 09:27:30,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:30,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:30,159 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-20 09:27:30,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:30,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820125292] [2022-11-20 09:27:30,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820125292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:30,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:30,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:30,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575402646] [2022-11-20 09:27:30,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:30,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:30,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:30,163 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-20 09:27:30,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:30,991 INFO L93 Difference]: Finished difference Result 9368 states and 13073 transitions. [2022-11-20 09:27:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:30,992 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-20 09:27:30,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:31,005 INFO L225 Difference]: With dead ends: 9368 [2022-11-20 09:27:31,005 INFO L226 Difference]: Without dead ends: 9365 [2022-11-20 09:27:31,006 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-20 09:27:31,007 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-20 09:27:31,007 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-20 09:27:31,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2022-11-20 09:27:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 9362. [2022-11-20 09:27:31,454 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-20 09:27:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9362 states to 9362 states and 13041 transitions. [2022-11-20 09:27:31,470 INFO L78 Accepts]: Start accepts. Automaton has 9362 states and 13041 transitions. Word has length 70 [2022-11-20 09:27:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:31,470 INFO L495 AbstractCegarLoop]: Abstraction has 9362 states and 13041 transitions. [2022-11-20 09:27:31,470 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-20 09:27:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 9362 states and 13041 transitions. [2022-11-20 09:27:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-20 09:27:31,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:31,472 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-20 09:27:31,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 09:27:31,473 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-20 09:27:31,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:31,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1054373452, now seen corresponding path program 1 times [2022-11-20 09:27:31,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:31,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120285495] [2022-11-20 09:27:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:31,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:31,587 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-20 09:27:31,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:31,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120285495] [2022-11-20 09:27:31,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120285495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:31,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:31,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:31,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595668820] [2022-11-20 09:27:31,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:31,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:31,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:31,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:31,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:31,590 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-20 09:27:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:32,745 INFO L93 Difference]: Finished difference Result 18998 states and 26973 transitions. [2022-11-20 09:27:32,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:32,746 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-20 09:27:32,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:32,773 INFO L225 Difference]: With dead ends: 18998 [2022-11-20 09:27:32,773 INFO L226 Difference]: Without dead ends: 12353 [2022-11-20 09:27:32,785 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-20 09:27:32,786 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-20 09:27:32,786 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-20 09:27:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12353 states. [2022-11-20 09:27:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12353 to 10442. [2022-11-20 09:27:33,733 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-20 09:27:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10442 states to 10442 states and 14613 transitions. [2022-11-20 09:27:33,746 INFO L78 Accepts]: Start accepts. Automaton has 10442 states and 14613 transitions. Word has length 71 [2022-11-20 09:27:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:33,747 INFO L495 AbstractCegarLoop]: Abstraction has 10442 states and 14613 transitions. [2022-11-20 09:27:33,747 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-20 09:27:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 10442 states and 14613 transitions. [2022-11-20 09:27:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-20 09:27:33,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:33,749 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-20 09:27:33,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 09:27:33,749 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-20 09:27:33,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:33,750 INFO L85 PathProgramCache]: Analyzing trace with hash -922601538, now seen corresponding path program 1 times [2022-11-20 09:27:33,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:33,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222377987] [2022-11-20 09:27:33,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:33,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:33,914 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-20 09:27:33,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:33,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222377987] [2022-11-20 09:27:33,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222377987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:33,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:33,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:33,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287967362] [2022-11-20 09:27:33,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:33,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:33,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:33,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:33,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:33,917 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-20 09:27:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:35,001 INFO L93 Difference]: Finished difference Result 11396 states and 15957 transitions. [2022-11-20 09:27:35,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:35,002 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-20 09:27:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:35,020 INFO L225 Difference]: With dead ends: 11396 [2022-11-20 09:27:35,021 INFO L226 Difference]: Without dead ends: 11393 [2022-11-20 09:27:35,026 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-20 09:27:35,027 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-20 09:27:35,027 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-20 09:27:35,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11393 states. [2022-11-20 09:27:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11393 to 11390. [2022-11-20 09:27:35,918 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-20 09:27:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11390 states to 11390 states and 15909 transitions. [2022-11-20 09:27:35,933 INFO L78 Accepts]: Start accepts. Automaton has 11390 states and 15909 transitions. Word has length 72 [2022-11-20 09:27:35,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:35,934 INFO L495 AbstractCegarLoop]: Abstraction has 11390 states and 15909 transitions. [2022-11-20 09:27:35,934 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-20 09:27:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand 11390 states and 15909 transitions. [2022-11-20 09:27:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-20 09:27:35,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:35,936 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-20 09:27:35,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 09:27:35,936 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-20 09:27:35,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:35,937 INFO L85 PathProgramCache]: Analyzing trace with hash -465238524, now seen corresponding path program 1 times [2022-11-20 09:27:35,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:35,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274353240] [2022-11-20 09:27:35,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:35,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:36,051 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-20 09:27:36,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:36,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274353240] [2022-11-20 09:27:36,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274353240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:36,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:36,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:36,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169119824] [2022-11-20 09:27:36,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:36,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:36,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:36,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:36,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:36,054 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-20 09:27:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:37,018 INFO L93 Difference]: Finished difference Result 14249 states and 20013 transitions. [2022-11-20 09:27:37,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:37,019 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-20 09:27:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:37,035 INFO L225 Difference]: With dead ends: 14249 [2022-11-20 09:27:37,035 INFO L226 Difference]: Without dead ends: 14246 [2022-11-20 09:27:37,039 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-20 09:27:37,040 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-20 09:27:37,041 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-20 09:27:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14246 states. [2022-11-20 09:27:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14246 to 14234. [2022-11-20 09:27:37,893 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-20 09:27:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 19917 transitions. [2022-11-20 09:27:37,912 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 19917 transitions. Word has length 72 [2022-11-20 09:27:37,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:37,913 INFO L495 AbstractCegarLoop]: Abstraction has 14234 states and 19917 transitions. [2022-11-20 09:27:37,913 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-20 09:27:37,913 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 19917 transitions. [2022-11-20 09:27:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-20 09:27:37,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:37,914 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-20 09:27:37,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 09:27:37,915 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-20 09:27:37,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:37,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1537492216, now seen corresponding path program 1 times [2022-11-20 09:27:37,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:37,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335599273] [2022-11-20 09:27:37,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:37,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:38,022 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-20 09:27:38,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:38,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335599273] [2022-11-20 09:27:38,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335599273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:38,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:38,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:38,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6066490] [2022-11-20 09:27:38,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:38,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:38,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:38,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:38,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:38,025 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-20 09:27:38,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:38,831 INFO L93 Difference]: Finished difference Result 16508 states and 23117 transitions. [2022-11-20 09:27:38,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:38,832 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-20 09:27:38,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:38,847 INFO L225 Difference]: With dead ends: 16508 [2022-11-20 09:27:38,847 INFO L226 Difference]: Without dead ends: 10182 [2022-11-20 09:27:38,872 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-20 09:27:38,873 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-20 09:27:38,874 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-20 09:27:38,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10182 states. [2022-11-20 09:27:39,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10182 to 7722. [2022-11-20 09:27:39,712 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-20 09:27:39,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7722 states to 7722 states and 10789 transitions. [2022-11-20 09:27:39,725 INFO L78 Accepts]: Start accepts. Automaton has 7722 states and 10789 transitions. Word has length 73 [2022-11-20 09:27:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:39,726 INFO L495 AbstractCegarLoop]: Abstraction has 7722 states and 10789 transitions. [2022-11-20 09:27:39,726 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-20 09:27:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 7722 states and 10789 transitions. [2022-11-20 09:27:39,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 09:27:39,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:39,729 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-20 09:27:39,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 09:27:39,729 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-20 09:27:39,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:39,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1280585962, now seen corresponding path program 1 times [2022-11-20 09:27:39,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:39,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373551556] [2022-11-20 09:27:39,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:39,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:39,875 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-20 09:27:39,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:39,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373551556] [2022-11-20 09:27:39,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373551556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:39,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:39,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:39,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302581223] [2022-11-20 09:27:39,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:39,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:39,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:39,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:39,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:39,881 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-20 09:27:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:40,894 INFO L93 Difference]: Finished difference Result 7947 states and 11093 transitions. [2022-11-20 09:27:40,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:40,895 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-20 09:27:40,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:40,903 INFO L225 Difference]: With dead ends: 7947 [2022-11-20 09:27:40,904 INFO L226 Difference]: Without dead ends: 7506 [2022-11-20 09:27:40,906 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-20 09:27:40,907 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.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:40,907 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.1s Time] [2022-11-20 09:27:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7506 states. [2022-11-20 09:27:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7506 to 7502. [2022-11-20 09:27:41,366 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-20 09:27:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7502 states to 7502 states and 10473 transitions. [2022-11-20 09:27:41,375 INFO L78 Accepts]: Start accepts. Automaton has 7502 states and 10473 transitions. Word has length 74 [2022-11-20 09:27:41,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:41,376 INFO L495 AbstractCegarLoop]: Abstraction has 7502 states and 10473 transitions. [2022-11-20 09:27:41,376 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-20 09:27:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 7502 states and 10473 transitions. [2022-11-20 09:27:41,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-20 09:27:41,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:41,378 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-20 09:27:41,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 09:27:41,379 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-20 09:27:41,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1014831339, now seen corresponding path program 1 times [2022-11-20 09:27:41,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:41,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698449419] [2022-11-20 09:27:41,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:41,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:41,478 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-20 09:27:41,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:41,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698449419] [2022-11-20 09:27:41,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698449419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:41,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:41,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:41,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832171331] [2022-11-20 09:27:41,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:41,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:27:41,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:41,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:27:41,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:41,481 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-20 09:27:42,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:42,372 INFO L93 Difference]: Finished difference Result 7728 states and 10773 transitions. [2022-11-20 09:27:42,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:27:42,372 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-20 09:27:42,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:42,382 INFO L225 Difference]: With dead ends: 7728 [2022-11-20 09:27:42,383 INFO L226 Difference]: Without dead ends: 7725 [2022-11-20 09:27:42,385 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-20 09:27:42,390 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-20 09:27:42,391 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-20 09:27:42,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7725 states. [2022-11-20 09:27:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7725 to 7499. [2022-11-20 09:27:42,844 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-20 09:27:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7499 states to 7499 states and 10233 transitions. [2022-11-20 09:27:42,853 INFO L78 Accepts]: Start accepts. Automaton has 7499 states and 10233 transitions. Word has length 95 [2022-11-20 09:27:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:42,853 INFO L495 AbstractCegarLoop]: Abstraction has 7499 states and 10233 transitions. [2022-11-20 09:27:42,853 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-20 09:27:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 7499 states and 10233 transitions. [2022-11-20 09:27:42,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-20 09:27:42,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:42,856 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-20 09:27:42,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 09:27:42,857 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-20 09:27:42,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:42,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1641497059, now seen corresponding path program 1 times [2022-11-20 09:27:42,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:42,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401466520] [2022-11-20 09:27:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:42,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,983 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-20 09:27:42,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:42,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401466520] [2022-11-20 09:27:42,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401466520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:42,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:42,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:42,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887619628] [2022-11-20 09:27:42,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:42,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:42,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:42,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:42,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:42,986 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-20 09:27:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:43,872 INFO L93 Difference]: Finished difference Result 8045 states and 10981 transitions. [2022-11-20 09:27:43,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:43,873 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-20 09:27:43,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:43,882 INFO L225 Difference]: With dead ends: 8045 [2022-11-20 09:27:43,883 INFO L226 Difference]: Without dead ends: 7192 [2022-11-20 09:27:43,885 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-20 09:27:43,886 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:43,886 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.2s Time] [2022-11-20 09:27:43,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7192 states. [2022-11-20 09:27:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7192 to 7183. [2022-11-20 09:27:44,366 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-20 09:27:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7183 states to 7183 states and 9821 transitions. [2022-11-20 09:27:44,374 INFO L78 Accepts]: Start accepts. Automaton has 7183 states and 9821 transitions. Word has length 97 [2022-11-20 09:27:44,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:44,374 INFO L495 AbstractCegarLoop]: Abstraction has 7183 states and 9821 transitions. [2022-11-20 09:27:44,374 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-20 09:27:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 7183 states and 9821 transitions. [2022-11-20 09:27:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-20 09:27:44,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:44,378 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-20 09:27:44,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 09:27:44,378 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-20 09:27:44,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:44,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1064049893, now seen corresponding path program 1 times [2022-11-20 09:27:44,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:44,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500333132] [2022-11-20 09:27:44,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:44,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:44,430 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-20 09:27:44,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:44,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500333132] [2022-11-20 09:27:44,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500333132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:44,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:44,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:44,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729754804] [2022-11-20 09:27:44,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:44,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:44,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:44,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:44,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:44,432 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-20 09:27:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:45,322 INFO L93 Difference]: Finished difference Result 16155 states and 22155 transitions. [2022-11-20 09:27:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:45,322 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-20 09:27:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:45,332 INFO L225 Difference]: With dead ends: 16155 [2022-11-20 09:27:45,332 INFO L226 Difference]: Without dead ends: 9925 [2022-11-20 09:27:45,338 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-20 09:27:45,339 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-20 09:27:45,339 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-20 09:27:45,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9925 states. [2022-11-20 09:27:45,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9925 to 9579. [2022-11-20 09:27:45,956 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-20 09:27:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 12873 transitions. [2022-11-20 09:27:45,968 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 12873 transitions. Word has length 97 [2022-11-20 09:27:45,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:45,968 INFO L495 AbstractCegarLoop]: Abstraction has 9579 states and 12873 transitions. [2022-11-20 09:27:45,968 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-20 09:27:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 12873 transitions. [2022-11-20 09:27:45,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-20 09:27:45,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:45,972 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-20 09:27:45,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 09:27:45,972 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-20 09:27:45,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:45,973 INFO L85 PathProgramCache]: Analyzing trace with hash 295344941, now seen corresponding path program 2 times [2022-11-20 09:27:45,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:45,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288788660] [2022-11-20 09:27:45,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:45,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,122 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-20 09:27:46,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:46,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288788660] [2022-11-20 09:27:46,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288788660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:46,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:46,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466004666] [2022-11-20 09:27:46,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:46,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:46,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:46,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:46,126 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-20 09:27:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:47,034 INFO L93 Difference]: Finished difference Result 13674 states and 18519 transitions. [2022-11-20 09:27:47,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:47,035 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-20 09:27:47,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:47,042 INFO L225 Difference]: With dead ends: 13674 [2022-11-20 09:27:47,042 INFO L226 Difference]: Without dead ends: 7564 [2022-11-20 09:27:47,046 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-20 09:27:47,047 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-20 09:27:47,047 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-20 09:27:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7564 states. [2022-11-20 09:27:47,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7564 to 7555. [2022-11-20 09:27:47,576 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-20 09:27:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10131 transitions. [2022-11-20 09:27:47,587 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10131 transitions. Word has length 97 [2022-11-20 09:27:47,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:47,587 INFO L495 AbstractCegarLoop]: Abstraction has 7555 states and 10131 transitions. [2022-11-20 09:27:47,588 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-20 09:27:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10131 transitions. [2022-11-20 09:27:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-20 09:27:47,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:47,591 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-20 09:27:47,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-20 09:27:47,591 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-20 09:27:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash -58450279, now seen corresponding path program 1 times [2022-11-20 09:27:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:47,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125039696] [2022-11-20 09:27:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:47,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:47,725 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-20 09:27:47,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:47,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125039696] [2022-11-20 09:27:47,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125039696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:47,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:47,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:47,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062014876] [2022-11-20 09:27:47,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:47,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:47,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:47,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:47,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:47,728 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-20 09:27:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:48,363 INFO L93 Difference]: Finished difference Result 7558 states and 10131 transitions. [2022-11-20 09:27:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:48,364 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-20 09:27:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:48,372 INFO L225 Difference]: With dead ends: 7558 [2022-11-20 09:27:48,372 INFO L226 Difference]: Without dead ends: 7555 [2022-11-20 09:27:48,374 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-20 09:27:48,375 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-20 09:27:48,375 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-20 09:27:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7555 states. [2022-11-20 09:27:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7555 to 7555. [2022-11-20 09:27:48,845 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-20 09:27:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10095 transitions. [2022-11-20 09:27:48,852 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10095 transitions. Word has length 99 [2022-11-20 09:27:48,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:48,853 INFO L495 AbstractCegarLoop]: Abstraction has 7555 states and 10095 transitions. [2022-11-20 09:27:48,853 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-20 09:27:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10095 transitions. [2022-11-20 09:27:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 09:27:48,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:48,856 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-20 09:27:48,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-20 09:27:48,856 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-20 09:27:48,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:48,857 INFO L85 PathProgramCache]: Analyzing trace with hash -308445212, now seen corresponding path program 1 times [2022-11-20 09:27:48,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:48,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794507974] [2022-11-20 09:27:48,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:48,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:49,003 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-20 09:27:49,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:49,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794507974] [2022-11-20 09:27:49,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794507974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:49,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:49,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:49,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853674263] [2022-11-20 09:27:49,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:49,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:49,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:49,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:49,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:49,006 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-20 09:27:49,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:49,728 INFO L93 Difference]: Finished difference Result 7558 states and 10095 transitions. [2022-11-20 09:27:49,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:49,729 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-20 09:27:49,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:49,737 INFO L225 Difference]: With dead ends: 7558 [2022-11-20 09:27:49,738 INFO L226 Difference]: Without dead ends: 7555 [2022-11-20 09:27:49,740 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-20 09:27:49,740 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-20 09:27:49,741 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-20 09:27:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7555 states. [2022-11-20 09:27:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7555 to 7555. [2022-11-20 09:27:50,244 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-20 09:27:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10067 transitions. [2022-11-20 09:27:50,254 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10067 transitions. Word has length 101 [2022-11-20 09:27:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:50,254 INFO L495 AbstractCegarLoop]: Abstraction has 7555 states and 10067 transitions. [2022-11-20 09:27:50,254 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-20 09:27:50,254 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10067 transitions. [2022-11-20 09:27:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 09:27:50,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:50,258 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-20 09:27:50,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-20 09:27:50,258 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-20 09:27:50,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:50,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1302363118, now seen corresponding path program 1 times [2022-11-20 09:27:50,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:50,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220278529] [2022-11-20 09:27:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:50,413 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-20 09:27:50,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:50,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220278529] [2022-11-20 09:27:50,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220278529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:50,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:50,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:50,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848482691] [2022-11-20 09:27:50,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:50,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:50,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:50,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:50,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:50,416 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-20 09:27:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:51,092 INFO L93 Difference]: Finished difference Result 7561 states and 10067 transitions. [2022-11-20 09:27:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:51,092 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-20 09:27:51,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:51,101 INFO L225 Difference]: With dead ends: 7561 [2022-11-20 09:27:51,101 INFO L226 Difference]: Without dead ends: 7558 [2022-11-20 09:27:51,103 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-20 09:27:51,104 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-20 09:27:51,104 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-20 09:27:51,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2022-11-20 09:27:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 7555. [2022-11-20 09:27:51,625 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-20 09:27:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10011 transitions. [2022-11-20 09:27:51,634 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10011 transitions. Word has length 101 [2022-11-20 09:27:51,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:51,634 INFO L495 AbstractCegarLoop]: Abstraction has 7555 states and 10011 transitions. [2022-11-20 09:27:51,634 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-20 09:27:51,635 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10011 transitions. [2022-11-20 09:27:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-20 09:27:51,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:51,638 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-20 09:27:51,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-20 09:27:51,638 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-20 09:27:51,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:51,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1718550854, now seen corresponding path program 1 times [2022-11-20 09:27:51,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:51,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544465151] [2022-11-20 09:27:51,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:51,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:51,774 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-20 09:27:51,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:51,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544465151] [2022-11-20 09:27:51,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544465151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:51,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:51,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:51,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983128746] [2022-11-20 09:27:51,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:51,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:51,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:51,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:51,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:51,777 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-20 09:27:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:52,273 INFO L93 Difference]: Finished difference Result 8837 states and 11785 transitions. [2022-11-20 09:27:52,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:52,273 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-20 09:27:52,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:52,279 INFO L225 Difference]: With dead ends: 8837 [2022-11-20 09:27:52,279 INFO L226 Difference]: Without dead ends: 4627 [2022-11-20 09:27:52,283 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-20 09:27:52,284 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-20 09:27:52,284 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-20 09:27:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2022-11-20 09:27:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 4226. [2022-11-20 09:27:52,617 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-20 09:27:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 5499 transitions. [2022-11-20 09:27:52,623 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 5499 transitions. Word has length 102 [2022-11-20 09:27:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:52,623 INFO L495 AbstractCegarLoop]: Abstraction has 4226 states and 5499 transitions. [2022-11-20 09:27:52,623 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-20 09:27:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 5499 transitions. [2022-11-20 09:27:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-20 09:27:52,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:52,626 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-20 09:27:52,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-20 09:27:52,626 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-20 09:27:52,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:52,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1722623032, now seen corresponding path program 1 times [2022-11-20 09:27:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:52,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892213479] [2022-11-20 09:27:52,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:52,760 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-20 09:27:52,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:52,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892213479] [2022-11-20 09:27:52,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892213479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:52,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:52,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:52,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021541388] [2022-11-20 09:27:52,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:52,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:52,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:52,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:52,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:52,762 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-20 09:27:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:53,276 INFO L93 Difference]: Finished difference Result 4448 states and 5795 transitions. [2022-11-20 09:27:53,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:53,277 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-20 09:27:53,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:53,281 INFO L225 Difference]: With dead ends: 4448 [2022-11-20 09:27:53,281 INFO L226 Difference]: Without dead ends: 3787 [2022-11-20 09:27:53,282 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-20 09:27:53,284 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-20 09:27:53,284 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-20 09:27:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2022-11-20 09:27:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3566. [2022-11-20 09:27:53,544 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-20 09:27:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 4613 transitions. [2022-11-20 09:27:53,548 INFO L78 Accepts]: Start accepts. Automaton has 3566 states and 4613 transitions. Word has length 103 [2022-11-20 09:27:53,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:53,548 INFO L495 AbstractCegarLoop]: Abstraction has 3566 states and 4613 transitions. [2022-11-20 09:27:53,548 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-20 09:27:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3566 states and 4613 transitions. [2022-11-20 09:27:53,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-20 09:27:53,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:53,551 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-20 09:27:53,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-20 09:27:53,552 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-20 09:27:53,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash -37264520, now seen corresponding path program 2 times [2022-11-20 09:27:53,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:53,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366957135] [2022-11-20 09:27:53,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:53,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:53,688 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-20 09:27:53,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:53,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366957135] [2022-11-20 09:27:53,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366957135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:53,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:53,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:53,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545756548] [2022-11-20 09:27:53,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:53,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:53,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:53,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:53,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:53,691 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-20 09:27:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:54,291 INFO L93 Difference]: Finished difference Result 3567 states and 4613 transitions. [2022-11-20 09:27:54,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:54,292 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-20 09:27:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:54,295 INFO L225 Difference]: With dead ends: 3567 [2022-11-20 09:27:54,295 INFO L226 Difference]: Without dead ends: 2554 [2022-11-20 09:27:54,297 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-20 09:27:54,298 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-20 09:27:54,298 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-20 09:27:54,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2022-11-20 09:27:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2554. [2022-11-20 09:27:54,519 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-20 09:27:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3285 transitions. [2022-11-20 09:27:54,522 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3285 transitions. Word has length 103 [2022-11-20 09:27:54,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:54,522 INFO L495 AbstractCegarLoop]: Abstraction has 2554 states and 3285 transitions. [2022-11-20 09:27:54,523 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-20 09:27:54,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3285 transitions. [2022-11-20 09:27:54,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-20 09:27:54,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:54,525 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-20 09:27:54,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-20 09:27:54,526 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-20 09:27:54,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:54,526 INFO L85 PathProgramCache]: Analyzing trace with hash -131639445, now seen corresponding path program 1 times [2022-11-20 09:27:54,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:54,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635990110] [2022-11-20 09:27:54,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:54,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:54,693 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-20 09:27:54,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:54,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635990110] [2022-11-20 09:27:54,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635990110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:54,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:54,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396054953] [2022-11-20 09:27:54,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:54,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:54,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:54,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:54,696 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-20 09:27:55,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:55,126 INFO L93 Difference]: Finished difference Result 2554 states and 3285 transitions. [2022-11-20 09:27:55,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:55,126 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-20 09:27:55,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:55,127 INFO L225 Difference]: With dead ends: 2554 [2022-11-20 09:27:55,127 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 09:27:55,129 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-20 09:27:55,129 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-20 09:27:55,130 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-20 09:27:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 09:27:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 09:27:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 09:27:55,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2022-11-20 09:27:55,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:55,131 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 09:27:55,131 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-20 09:27:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 09:27:55,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 09:27:55,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-20 09:27:55,135 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-20 09:27:55,135 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-20 09:27:55,135 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-20 09:27:55,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-20 09:27:55,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-20 09:27:55,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-20 09:27:55,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-20 09:27:55,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-20 09:27:55,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-20 09:27:55,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-20 09:27:55,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-20 09:27:55,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-20 09:27:55,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-20 09:27:55,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-20 09:27:55,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 09:28:16,689 WARN L233 SmtUtils]: Spent 6.95s 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-20 09:28:26,917 WARN L233 SmtUtils]: Spent 6.95s 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-20 09:28:36,332 WARN L233 SmtUtils]: Spent 9.41s 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-20 09:28:45,912 WARN L233 SmtUtils]: Spent 9.57s 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-20 09:29:09,541 WARN L233 SmtUtils]: Spent 9.37s 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-20 09:29:28,800 WARN L233 SmtUtils]: Spent 5.39s 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-20 09:29:36,596 WARN L233 SmtUtils]: Spent 5.58s 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-20 09:29:42,235 WARN L233 SmtUtils]: Spent 5.63s 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-20 09:29:48,562 WARN L233 SmtUtils]: Spent 6.31s 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-20 09:30:03,880 WARN L233 SmtUtils]: Spent 5.66s 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-20 09:30:03,884 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-20 09:30:03,884 INFO L895 garLoopResultBuilder]: At program point L349(lines 135 350) 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-20 09:30:03,884 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 280) no Hoare annotation was computed. [2022-11-20 09:30:03,885 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 350) no Hoare annotation was computed. [2022-11-20 09:30:03,885 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 407) no Hoare annotation was computed. [2022-11-20 09:30:03,885 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 09:30:03,885 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-20 09:30:03,885 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 300) no Hoare annotation was computed. [2022-11-20 09:30:03,886 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 447) no Hoare annotation was computed. [2022-11-20 09:30:03,886 INFO L902 garLoopResultBuilder]: At program point L466(lines 58 469) the Hoare annotation is: true [2022-11-20 09:30:03,886 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-20 09:30:03,886 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-20 09:30:03,887 INFO L895 garLoopResultBuilder]: At program point L368(lines 126 381) 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-20 09:30:03,887 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-20 09:30:03,887 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 345) no Hoare annotation was computed. [2022-11-20 09:30:03,887 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 402) no Hoare annotation was computed. [2022-11-20 09:30:03,888 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 442) no Hoare annotation was computed. [2022-11-20 09:30:03,888 INFO L899 garLoopResultBuilder]: For program point L336(lines 336 344) no Hoare annotation was computed. [2022-11-20 09:30:03,888 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-20 09:30:03,888 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 397) no Hoare annotation was computed. [2022-11-20 09:30:03,889 INFO L895 garLoopResultBuilder]: At program point L354(lines 128 355) 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-20 09:30:03,889 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 437) no Hoare annotation was computed. [2022-11-20 09:30:03,889 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-20 09:30:03,889 INFO L895 garLoopResultBuilder]: At program point L206(lines 114 383) 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-20 09:30:03,889 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 09:30:03,890 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-20 09:30:03,890 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-20 09:30:03,890 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-20 09:30:03,890 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 392) no Hoare annotation was computed. [2022-11-20 09:30:03,890 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-20 09:30:03,891 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 432) no Hoare annotation was computed. [2022-11-20 09:30:03,891 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-20 09:30:03,891 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-20 09:30:03,891 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 299) no Hoare annotation was computed. [2022-11-20 09:30:03,891 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 381) no Hoare annotation was computed. [2022-11-20 09:30:03,892 INFO L895 garLoopResultBuilder]: At program point L374(lines 362 375) 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-20 09:30:03,892 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-20 09:30:03,892 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-20 09:30:03,892 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-11-20 09:30:03,893 INFO L899 garLoopResultBuilder]: For program point L226-1(line 226) no Hoare annotation was computed. [2022-11-20 09:30:03,893 INFO L899 garLoopResultBuilder]: For program point L226-2(line 226) no Hoare annotation was computed. [2022-11-20 09:30:03,893 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-11-20 09:30:03,893 INFO L899 garLoopResultBuilder]: For program point L226-3(line 226) no Hoare annotation was computed. [2022-11-20 09:30:03,893 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 427) no Hoare annotation was computed. [2022-11-20 09:30:03,893 INFO L899 garLoopResultBuilder]: For program point L226-4(lines 226 234) no Hoare annotation was computed. [2022-11-20 09:30:03,893 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 09:30:03,894 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 467) no Hoare annotation was computed. [2022-11-20 09:30:03,894 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-11-20 09:30:03,894 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 286) no Hoare annotation was computed. [2022-11-20 09:30:03,894 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 355) no Hoare annotation was computed. [2022-11-20 09:30:03,894 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 330) no Hoare annotation was computed. [2022-11-20 09:30:03,894 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 380) no Hoare annotation was computed. [2022-11-20 09:30:03,895 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-20 09:30:03,895 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 422) no Hoare annotation was computed. [2022-11-20 09:30:03,895 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-11-20 09:30:03,895 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2022-11-20 09:30:03,895 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 331) no Hoare annotation was computed. [2022-11-20 09:30:03,896 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-11-20 09:30:03,896 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 387) no Hoare annotation was computed. [2022-11-20 09:30:03,896 INFO L899 garLoopResultBuilder]: For program point L212-3(line 212) no Hoare annotation was computed. [2022-11-20 09:30:03,896 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 462) no Hoare annotation was computed. [2022-11-20 09:30:03,896 INFO L899 garLoopResultBuilder]: For program point L212-4(lines 212 221) no Hoare annotation was computed. [2022-11-20 09:30:03,896 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-20 09:30:03,897 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 325) no Hoare annotation was computed. [2022-11-20 09:30:03,897 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-20 09:30:03,897 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 254) no Hoare annotation was computed. [2022-11-20 09:30:03,897 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-20 09:30:03,897 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 375) no Hoare annotation was computed. [2022-11-20 09:30:03,898 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-20 09:30:03,898 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 417) no Hoare annotation was computed. [2022-11-20 09:30:03,898 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 09:30:03,898 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-20 09:30:03,898 INFO L895 garLoopResultBuilder]: At program point L379(lines 360 380) 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-20 09:30:03,899 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-11-20 09:30:03,899 INFO L899 garLoopResultBuilder]: For program point L181-1(line 181) no Hoare annotation was computed. [2022-11-20 09:30:03,899 INFO L899 garLoopResultBuilder]: For program point L181-2(line 181) no Hoare annotation was computed. [2022-11-20 09:30:03,899 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 457) no Hoare annotation was computed. [2022-11-20 09:30:03,899 INFO L899 garLoopResultBuilder]: For program point L181-3(line 181) no Hoare annotation was computed. [2022-11-20 09:30:03,900 INFO L899 garLoopResultBuilder]: For program point L181-4(lines 181 241) no Hoare annotation was computed. [2022-11-20 09:30:03,900 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 260) no Hoare annotation was computed. [2022-11-20 09:30:03,900 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-11-20 09:30:03,900 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-20 09:30:03,900 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 285) no Hoare annotation was computed. [2022-11-20 09:30:03,900 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-11-20 09:30:03,900 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 412) no Hoare annotation was computed. [2022-11-20 09:30:03,901 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 235) no Hoare annotation was computed. [2022-11-20 09:30:03,901 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 305) no Hoare annotation was computed. [2022-11-20 09:30:03,901 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 452) no Hoare annotation was computed. [2022-11-20 09:30:03,901 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 255) no Hoare annotation was computed. [2022-11-20 09:30:03,905 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-20 09:30:03,907 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:30:03,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:30:03 BoogieIcfgContainer [2022-11-20 09:30:03,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:30:03,943 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:30:03,943 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:30:03,943 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:30:03,944 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:12" (3/4) ... [2022-11-20 09:30:03,947 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 09:30:03,960 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-20 09:30:03,960 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-20 09:30:03,961 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 09:30:03,961 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 09:30:04,016 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 09:30:04,017 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:30:04,017 INFO L158 Benchmark]: Toolchain (without parser) took 172325.28ms. Allocated memory was 146.8MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 102.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2022-11-20 09:30:04,017 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 146.8MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:30:04,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.47ms. Allocated memory is still 146.8MB. Free memory was 102.1MB in the beginning and 88.6MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 09:30:04,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.58ms. Allocated memory is still 146.8MB. Free memory was 88.6MB in the beginning and 85.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:30:04,018 INFO L158 Benchmark]: Boogie Preprocessor took 28.76ms. Allocated memory is still 146.8MB. Free memory was 85.8MB in the beginning and 84.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:30:04,019 INFO L158 Benchmark]: RCFGBuilder took 642.00ms. Allocated memory is still 146.8MB. Free memory was 84.3MB in the beginning and 63.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 09:30:04,019 INFO L158 Benchmark]: TraceAbstraction took 171196.58ms. Allocated memory was 146.8MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 62.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2022-11-20 09:30:04,019 INFO L158 Benchmark]: Witness Printer took 73.83ms. Allocated memory is still 3.0GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 09:30:04,020 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.31ms. Allocated memory is still 146.8MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.47ms. Allocated memory is still 146.8MB. Free memory was 102.1MB in the beginning and 88.6MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.58ms. Allocated memory is still 146.8MB. Free memory was 88.6MB in the beginning and 85.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.76ms. Allocated memory is still 146.8MB. Free memory was 85.8MB in the beginning and 84.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 642.00ms. Allocated memory is still 146.8MB. Free memory was 84.3MB in the beginning and 63.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 171196.58ms. Allocated memory was 146.8MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 62.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 73.83ms. Allocated memory is still 3.0GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 171.1s, OverallIterations: 35, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 22.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 128.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6405 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6405 mSDsluCounter, 12592 SdHoareTripleChecker+Invalid, 2.9s 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.6s 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: 15.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 10699 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 2103 NumberOfFragments, 2235 HoareAnnotationTreeSize, 17 FomulaSimplifications, 214521 FormulaSimplificationTreeSizeReduction, 74.4s HoareSimplificationTime, 17 FomulaSimplificationsInter, 731155 FormulaSimplificationTreeSizeReductionInter, 54.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s 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: 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: 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: 360]: 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: 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: 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: 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: 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: 58]: Loop Invariant Derived loop invariant: 1 - 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: 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) - InvariantResult [Line: 362]: 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))) RESULT: Ultimate proved your program to be correct! [2022-11-20 09:30:04,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8551c05d-ba7d-4773-b6a2-c37ed7181eb5/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE