./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.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_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/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_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/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_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/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 e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca --- 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 10:47:13,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:47:13,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:47:13,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:47:13,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:47:13,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:47:13,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:47:13,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:47:13,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:47:13,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:47:13,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:47:13,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:47:13,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:47:13,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:47:13,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:47:13,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:47:13,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:47:13,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:47:13,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:47:13,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:47:13,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:47:13,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:47:13,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:47:13,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:47:13,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:47:13,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:47:13,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:47:13,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:47:13,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:47:13,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:47:13,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:47:13,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:47:13,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:47:13,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:47:13,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:47:13,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:47:13,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:47:13,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:47:13,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:47:13,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:47:13,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:47:13,200 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 10:47:13,251 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:47:13,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:47:13,252 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:47:13,253 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:47:13,254 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:47:13,254 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:47:13,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:47:13,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:47:13,255 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:47:13,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:47:13,257 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:47:13,257 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:47:13,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:47:13,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:47:13,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:47:13,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:47:13,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:47:13,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:47:13,259 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 10:47:13,259 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:47:13,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:47:13,260 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:47:13,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:47:13,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:47:13,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:47:13,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:47:13,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:47:13,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:47:13,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:47:13,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:47:13,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:47:13,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:47:13,263 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:47:13,263 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:47:13,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:47:13,264 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_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/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_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/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 -> e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca [2022-11-20 10:47:13,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:47:13,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:47:13,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:47:13,563 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:47:13,563 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:47:13,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-20 10:47:16,772 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:47:17,084 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:47:17,084 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-20 10:47:17,093 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/bin/uautomizer-ug76WZFUDN/data/df37165f9/38f6254878dc4502b6470381750f9d35/FLAG11f49964d [2022-11-20 10:47:17,110 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/bin/uautomizer-ug76WZFUDN/data/df37165f9/38f6254878dc4502b6470381750f9d35 [2022-11-20 10:47:17,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:47:17,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:47:17,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:47:17,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:47:17,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:47:17,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:47:17" (1/1) ... [2022-11-20 10:47:17,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327f6cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17, skipping insertion in model container [2022-11-20 10:47:17,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:47:17" (1/1) ... [2022-11-20 10:47:17,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:47:17,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:47:17,383 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_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-11-20 10:47:17,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:47:17,396 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:47:17,453 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_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-11-20 10:47:17,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:47:17,471 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:47:17,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17 WrapperNode [2022-11-20 10:47:17,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:47:17,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:47:17,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:47:17,473 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:47:17,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2022-11-20 10:47:17,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2022-11-20 10:47:17,556 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 219 [2022-11-20 10:47:17,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:47:17,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:47:17,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:47:17,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:47:17,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2022-11-20 10:47:17,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2022-11-20 10:47:17,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2022-11-20 10:47:17,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2022-11-20 10:47:17,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2022-11-20 10:47:17,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2022-11-20 10:47:17,621 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2022-11-20 10:47:17,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2022-11-20 10:47:17,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:47:17,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:47:17,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:47:17,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:47:17,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (1/1) ... [2022-11-20 10:47:17,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:47:17,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:47:17,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:47:17,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:47:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:47:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:47:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:47:17,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:47:17,900 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:47:17,903 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:47:18,361 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:47:18,369 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:47:18,370 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 10:47:18,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:18 BoogieIcfgContainer [2022-11-20 10:47:18,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:47:18,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:47:18,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:47:18,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:47:18,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:47:17" (1/3) ... [2022-11-20 10:47:18,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dee5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:47:18, skipping insertion in model container [2022-11-20 10:47:18,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:17" (2/3) ... [2022-11-20 10:47:18,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dee5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:47:18, skipping insertion in model container [2022-11-20 10:47:18,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:18" (3/3) ... [2022-11-20 10:47:18,398 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-20 10:47:18,426 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:47:18,431 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-20 10:47:18,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:47:18,513 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;@255e295b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:47:18,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-20 10:47:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 68 states have (on average 1.75) internal successors, (119), 82 states have internal predecessors, (119), 0 states have call successors, (0), 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 10:47:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 10:47:18,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:18,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:18,531 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 10:47:18,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:18,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1091460306, now seen corresponding path program 1 times [2022-11-20 10:47:18,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:18,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923474993] [2022-11-20 10:47:18,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:18,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:18,790 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 10:47:18,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:18,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923474993] [2022-11-20 10:47:18,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923474993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:18,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:18,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:47:18,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147002354] [2022-11-20 10:47:18,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:18,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:47:18,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:18,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:47:18,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:47:18,863 INFO L87 Difference]: Start difference. First operand has 83 states, 68 states have (on average 1.75) internal successors, (119), 82 states have internal predecessors, (119), 0 states have call successors, (0), 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, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10:47:18,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:18,914 INFO L93 Difference]: Finished difference Result 139 states and 197 transitions. [2022-11-20 10:47:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:47:18,918 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-20 10:47:18,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:18,927 INFO L225 Difference]: With dead ends: 139 [2022-11-20 10:47:18,927 INFO L226 Difference]: Without dead ends: 76 [2022-11-20 10:47:18,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 10:47:18,934 INFO L413 NwaCegarLoop]: 110 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, 110 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 10:47:18,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:47:18,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-20 10:47:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-20 10:47:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.703125) internal successors, (109), 75 states have internal predecessors, (109), 0 states have call successors, (0), 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 10:47:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 109 transitions. [2022-11-20 10:47:18,978 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 109 transitions. Word has length 10 [2022-11-20 10:47:18,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:18,979 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 109 transitions. [2022-11-20 10:47:18,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10:47:18,980 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2022-11-20 10:47:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 10:47:18,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:18,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:18,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:47:18,982 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 10:47:18,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:18,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1340571796, now seen corresponding path program 1 times [2022-11-20 10:47:18,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:18,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185330419] [2022-11-20 10:47:18,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:18,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:19,244 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 10:47:19,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:19,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185330419] [2022-11-20 10:47:19,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185330419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:19,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:19,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:47:19,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076344705] [2022-11-20 10:47:19,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:19,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:19,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:19,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:19,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:19,249 INFO L87 Difference]: Start difference. First operand 76 states and 109 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 10:47:19,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:19,328 INFO L93 Difference]: Finished difference Result 134 states and 184 transitions. [2022-11-20 10:47:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:19,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-11-20 10:47:19,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:19,330 INFO L225 Difference]: With dead ends: 134 [2022-11-20 10:47:19,330 INFO L226 Difference]: Without dead ends: 76 [2022-11-20 10:47:19,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:47:19,333 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 3 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:19,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 409 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:47:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-20 10:47:19,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-20 10:47:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.453125) internal successors, (93), 75 states have internal predecessors, (93), 0 states have call successors, (0), 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 10:47:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2022-11-20 10:47:19,342 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 15 [2022-11-20 10:47:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:19,343 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2022-11-20 10:47:19,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 10:47:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-11-20 10:47:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 10:47:19,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:19,345 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] [2022-11-20 10:47:19,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:47:19,346 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 10:47:19,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash 821705161, now seen corresponding path program 1 times [2022-11-20 10:47:19,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:19,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493639453] [2022-11-20 10:47:19,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:19,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:19,543 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 10:47:19,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:19,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493639453] [2022-11-20 10:47:19,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493639453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:19,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:19,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:47:19,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417672068] [2022-11-20 10:47:19,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:19,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:47:19,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:19,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:47:19,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:47:19,551 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 10:47:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:19,745 INFO L93 Difference]: Finished difference Result 181 states and 235 transitions. [2022-11-20 10:47:19,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:19,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-20 10:47:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:19,748 INFO L225 Difference]: With dead ends: 181 [2022-11-20 10:47:19,748 INFO L226 Difference]: Without dead ends: 178 [2022-11-20 10:47:19,749 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 10:47:19,750 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 210 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:19,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 158 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:19,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-20 10:47:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 118. [2022-11-20 10:47:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 106 states have (on average 1.5188679245283019) internal successors, (161), 117 states have internal predecessors, (161), 0 states have call successors, (0), 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 10:47:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 161 transitions. [2022-11-20 10:47:19,778 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 161 transitions. Word has length 30 [2022-11-20 10:47:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:19,779 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 161 transitions. [2022-11-20 10:47:19,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 10:47:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 161 transitions. [2022-11-20 10:47:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 10:47:19,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:19,781 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] [2022-11-20 10:47:19,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:47:19,783 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 10:47:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:19,789 INFO L85 PathProgramCache]: Analyzing trace with hash -296943552, now seen corresponding path program 1 times [2022-11-20 10:47:19,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:19,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76839872] [2022-11-20 10:47:19,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:19,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:19,969 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 10:47:19,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:19,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76839872] [2022-11-20 10:47:19,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76839872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:19,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:19,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:47:19,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046603502] [2022-11-20 10:47:19,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:19,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:47:19,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:19,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:47:19,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:47:19,973 INFO L87 Difference]: Start difference. First operand 118 states and 161 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 10:47:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:20,143 INFO L93 Difference]: Finished difference Result 169 states and 232 transitions. [2022-11-20 10:47:20,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:47:20,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-20 10:47:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:20,146 INFO L225 Difference]: With dead ends: 169 [2022-11-20 10:47:20,147 INFO L226 Difference]: Without dead ends: 166 [2022-11-20 10:47:20,147 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 10:47:20,149 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 209 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:20,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 109 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-20 10:47:20,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2022-11-20 10:47:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 148 states have (on average 1.527027027027027) internal successors, (226), 159 states have internal predecessors, (226), 0 states have call successors, (0), 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 10:47:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 226 transitions. [2022-11-20 10:47:20,170 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 226 transitions. Word has length 31 [2022-11-20 10:47:20,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:20,171 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 226 transitions. [2022-11-20 10:47:20,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 10:47:20,171 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 226 transitions. [2022-11-20 10:47:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 10:47:20,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:20,172 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] [2022-11-20 10:47:20,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:47:20,173 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 10:47:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash -615315285, now seen corresponding path program 1 times [2022-11-20 10:47:20,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:20,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591504463] [2022-11-20 10:47:20,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:20,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:20,283 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 10:47:20,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:20,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591504463] [2022-11-20 10:47:20,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591504463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:20,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:20,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:20,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174502173] [2022-11-20 10:47:20,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:20,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:20,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:20,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:20,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:20,287 INFO L87 Difference]: Start difference. First operand 160 states and 226 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 10:47:20,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:20,656 INFO L93 Difference]: Finished difference Result 532 states and 770 transitions. [2022-11-20 10:47:20,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:47:20,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-11-20 10:47:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:20,661 INFO L225 Difference]: With dead ends: 532 [2022-11-20 10:47:20,661 INFO L226 Difference]: Without dead ends: 394 [2022-11-20 10:47:20,666 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 10:47:20,675 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 417 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:20,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 332 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:47:20,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-11-20 10:47:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 286. [2022-11-20 10:47:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 274 states have (on average 1.5145985401459854) internal successors, (415), 285 states have internal predecessors, (415), 0 states have call successors, (0), 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 10:47:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 415 transitions. [2022-11-20 10:47:20,732 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 415 transitions. Word has length 32 [2022-11-20 10:47:20,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:20,736 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 415 transitions. [2022-11-20 10:47:20,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 10:47:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 415 transitions. [2022-11-20 10:47:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 10:47:20,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:20,743 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] [2022-11-20 10:47:20,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:47:20,743 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 10:47:20,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:20,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1894904414, now seen corresponding path program 1 times [2022-11-20 10:47:20,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:20,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810864343] [2022-11-20 10:47:20,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:20,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:20,893 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 10:47:20,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:20,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810864343] [2022-11-20 10:47:20,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810864343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:20,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:20,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:20,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850800497] [2022-11-20 10:47:20,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:20,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:20,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:20,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:20,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:20,897 INFO L87 Difference]: Start difference. First operand 286 states and 415 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 10:47:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:21,154 INFO L93 Difference]: Finished difference Result 385 states and 554 transitions. [2022-11-20 10:47:21,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:47:21,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-11-20 10:47:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:21,159 INFO L225 Difference]: With dead ends: 385 [2022-11-20 10:47:21,159 INFO L226 Difference]: Without dead ends: 382 [2022-11-20 10:47:21,161 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 10:47:21,166 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 438 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:21,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 189 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:47:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-11-20 10:47:21,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 370. [2022-11-20 10:47:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 358 states have (on average 1.4972067039106145) internal successors, (536), 369 states have internal predecessors, (536), 0 states have call successors, (0), 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 10:47:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 536 transitions. [2022-11-20 10:47:21,214 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 536 transitions. Word has length 33 [2022-11-20 10:47:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:21,221 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 536 transitions. [2022-11-20 10:47:21,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 10:47:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 536 transitions. [2022-11-20 10:47:21,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 10:47:21,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:21,223 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 10:47:21,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:47:21,223 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 10:47:21,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:21,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2099267263, now seen corresponding path program 1 times [2022-11-20 10:47:21,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:21,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170894172] [2022-11-20 10:47:21,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:21,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:21,284 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 10:47:21,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:21,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170894172] [2022-11-20 10:47:21,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170894172] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:21,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:21,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:47:21,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007679679] [2022-11-20 10:47:21,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:21,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:47:21,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:21,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:47:21,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:47:21,287 INFO L87 Difference]: Start difference. First operand 370 states and 536 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 10:47:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:21,347 INFO L93 Difference]: Finished difference Result 1034 states and 1508 transitions. [2022-11-20 10:47:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:47:21,347 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 10:47:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:21,350 INFO L225 Difference]: With dead ends: 1034 [2022-11-20 10:47:21,351 INFO L226 Difference]: Without dead ends: 686 [2022-11-20 10:47:21,352 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 10:47:21,356 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 59 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:21,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 217 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:47:21,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-11-20 10:47:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 674. [2022-11-20 10:47:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 662 states have (on average 1.4894259818731117) internal successors, (986), 673 states have internal predecessors, (986), 0 states have call successors, (0), 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 10:47:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 986 transitions. [2022-11-20 10:47:21,409 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 986 transitions. Word has length 34 [2022-11-20 10:47:21,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:21,409 INFO L495 AbstractCegarLoop]: Abstraction has 674 states and 986 transitions. [2022-11-20 10:47:21,410 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 10:47:21,410 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 986 transitions. [2022-11-20 10:47:21,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 10:47:21,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:21,414 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 10:47:21,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:47:21,415 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 10:47:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash 574728995, now seen corresponding path program 1 times [2022-11-20 10:47:21,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:21,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657731691] [2022-11-20 10:47:21,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:21,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:21,468 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 10:47:21,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:21,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657731691] [2022-11-20 10:47:21,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657731691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:21,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:21,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:47:21,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507530624] [2022-11-20 10:47:21,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:21,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:47:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:21,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:47:21,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:47:21,474 INFO L87 Difference]: Start difference. First operand 674 states and 986 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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 10:47:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:21,581 INFO L93 Difference]: Finished difference Result 1914 states and 2802 transitions. [2022-11-20 10:47:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:47:21,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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 10:47:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:21,587 INFO L225 Difference]: With dead ends: 1914 [2022-11-20 10:47:21,587 INFO L226 Difference]: Without dead ends: 1262 [2022-11-20 10:47:21,588 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 10:47:21,589 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 57 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:21,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 219 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:47:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2022-11-20 10:47:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1250. [2022-11-20 10:47:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1238 states have (on average 1.4717285945072698) internal successors, (1822), 1249 states have internal predecessors, (1822), 0 states have call successors, (0), 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 10:47:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1822 transitions. [2022-11-20 10:47:21,664 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1822 transitions. Word has length 36 [2022-11-20 10:47:21,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:21,664 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1822 transitions. [2022-11-20 10:47:21,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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 10:47:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1822 transitions. [2022-11-20 10:47:21,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 10:47:21,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:21,665 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 10:47:21,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:47:21,666 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 10:47:21,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:21,667 INFO L85 PathProgramCache]: Analyzing trace with hash 360251775, now seen corresponding path program 1 times [2022-11-20 10:47:21,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:21,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106907120] [2022-11-20 10:47:21,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:21,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:21,708 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 10:47:21,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:21,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106907120] [2022-11-20 10:47:21,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106907120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:21,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:21,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:47:21,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082227815] [2022-11-20 10:47:21,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:21,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:47:21,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:21,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:47:21,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:47:21,711 INFO L87 Difference]: Start difference. First operand 1250 states and 1822 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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 10:47:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:21,876 INFO L93 Difference]: Finished difference Result 3514 states and 5134 transitions. [2022-11-20 10:47:21,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:47:21,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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 10:47:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:21,887 INFO L225 Difference]: With dead ends: 3514 [2022-11-20 10:47:21,888 INFO L226 Difference]: Without dead ends: 2286 [2022-11-20 10:47:21,890 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 10:47:21,891 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:21,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 220 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:47:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2022-11-20 10:47:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2274. [2022-11-20 10:47:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 2262 states have (on average 1.4597701149425288) internal successors, (3302), 2273 states have internal predecessors, (3302), 0 states have call successors, (0), 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 10:47:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 3302 transitions. [2022-11-20 10:47:22,174 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 3302 transitions. Word has length 36 [2022-11-20 10:47:22,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:22,175 INFO L495 AbstractCegarLoop]: Abstraction has 2274 states and 3302 transitions. [2022-11-20 10:47:22,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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 10:47:22,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 3302 transitions. [2022-11-20 10:47:22,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 10:47:22,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:22,176 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] [2022-11-20 10:47:22,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:47:22,177 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 10:47:22,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:22,178 INFO L85 PathProgramCache]: Analyzing trace with hash 197725606, now seen corresponding path program 1 times [2022-11-20 10:47:22,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:22,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930383902] [2022-11-20 10:47:22,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:22,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:22,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:22,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930383902] [2022-11-20 10:47:22,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930383902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:22,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:22,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:47:22,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995750123] [2022-11-20 10:47:22,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:22,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:47:22,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:22,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:47:22,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:47:22,250 INFO L87 Difference]: Start difference. First operand 2274 states and 3302 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 10:47:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:22,457 INFO L93 Difference]: Finished difference Result 5102 states and 7368 transitions. [2022-11-20 10:47:22,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:47:22,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-11-20 10:47:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:22,470 INFO L225 Difference]: With dead ends: 5102 [2022-11-20 10:47:22,470 INFO L226 Difference]: Without dead ends: 2850 [2022-11-20 10:47:22,473 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 10:47:22,474 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 37 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:22,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 156 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:47:22,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2022-11-20 10:47:22,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2804. [2022-11-20 10:47:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2804 states, 2792 states have (on average 1.4398280802292263) internal successors, (4020), 2803 states have internal predecessors, (4020), 0 states have call successors, (0), 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 10:47:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 4020 transitions. [2022-11-20 10:47:22,708 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 4020 transitions. Word has length 52 [2022-11-20 10:47:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:22,708 INFO L495 AbstractCegarLoop]: Abstraction has 2804 states and 4020 transitions. [2022-11-20 10:47:22,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 10:47:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 4020 transitions. [2022-11-20 10:47:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 10:47:22,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:22,710 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] [2022-11-20 10:47:22,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:47:22,710 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 10:47:22,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:22,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1412078642, now seen corresponding path program 1 times [2022-11-20 10:47:22,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:22,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895768342] [2022-11-20 10:47:22,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:22,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:22,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:22,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895768342] [2022-11-20 10:47:22,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895768342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:22,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:22,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:47:22,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566781203] [2022-11-20 10:47:22,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:22,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:22,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:22,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:22,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:22,944 INFO L87 Difference]: Start difference. First operand 2804 states and 4020 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 10:47:23,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:23,289 INFO L93 Difference]: Finished difference Result 5590 states and 8016 transitions. [2022-11-20 10:47:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:23,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-11-20 10:47:23,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:23,299 INFO L225 Difference]: With dead ends: 5590 [2022-11-20 10:47:23,300 INFO L226 Difference]: Without dead ends: 2810 [2022-11-20 10:47:23,304 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 10:47:23,305 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 142 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:23,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 162 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:23,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2022-11-20 10:47:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2804. [2022-11-20 10:47:23,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2804 states, 2792 states have (on average 1.4283667621776504) internal successors, (3988), 2803 states have internal predecessors, (3988), 0 states have call successors, (0), 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 10:47:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 3988 transitions. [2022-11-20 10:47:23,505 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 3988 transitions. Word has length 56 [2022-11-20 10:47:23,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:23,507 INFO L495 AbstractCegarLoop]: Abstraction has 2804 states and 3988 transitions. [2022-11-20 10:47:23,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 10:47:23,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 3988 transitions. [2022-11-20 10:47:23,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 10:47:23,511 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:23,511 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] [2022-11-20 10:47:23,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:47:23,511 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 10:47:23,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:23,512 INFO L85 PathProgramCache]: Analyzing trace with hash 743076310, now seen corresponding path program 1 times [2022-11-20 10:47:23,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:23,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455795907] [2022-11-20 10:47:23,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:23,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:47:23,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:23,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455795907] [2022-11-20 10:47:23,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455795907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:23,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:23,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:47:23,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914595989] [2022-11-20 10:47:23,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:23,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:47:23,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:23,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:47:23,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:47:23,633 INFO L87 Difference]: Start difference. First operand 2804 states and 3988 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 10:47:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:23,933 INFO L93 Difference]: Finished difference Result 3656 states and 5212 transitions. [2022-11-20 10:47:23,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:47:23,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 57 [2022-11-20 10:47:23,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:23,947 INFO L225 Difference]: With dead ends: 3656 [2022-11-20 10:47:23,947 INFO L226 Difference]: Without dead ends: 3653 [2022-11-20 10:47:23,949 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 10:47:23,950 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 94 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:23,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 212 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:23,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3653 states. [2022-11-20 10:47:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3653 to 2872. [2022-11-20 10:47:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2872 states, 2860 states have (on average 1.4377622377622377) internal successors, (4112), 2871 states have internal predecessors, (4112), 0 states have call successors, (0), 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 10:47:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2872 states and 4112 transitions. [2022-11-20 10:47:24,234 INFO L78 Accepts]: Start accepts. Automaton has 2872 states and 4112 transitions. Word has length 57 [2022-11-20 10:47:24,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:24,234 INFO L495 AbstractCegarLoop]: Abstraction has 2872 states and 4112 transitions. [2022-11-20 10:47:24,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 10:47:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2872 states and 4112 transitions. [2022-11-20 10:47:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 10:47:24,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:24,236 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] [2022-11-20 10:47:24,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:47:24,237 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 10:47:24,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:24,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1131770232, now seen corresponding path program 1 times [2022-11-20 10:47:24,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:24,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018456274] [2022-11-20 10:47:24,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:24,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:47:24,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:24,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018456274] [2022-11-20 10:47:24,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018456274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:24,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:24,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:24,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316779059] [2022-11-20 10:47:24,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:24,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:24,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:24,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:24,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:24,399 INFO L87 Difference]: Start difference. First operand 2872 states and 4112 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 10:47:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:24,843 INFO L93 Difference]: Finished difference Result 7169 states and 10100 transitions. [2022-11-20 10:47:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:24,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 59 [2022-11-20 10:47:24,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:24,857 INFO L225 Difference]: With dead ends: 7169 [2022-11-20 10:47:24,857 INFO L226 Difference]: Without dead ends: 4321 [2022-11-20 10:47:24,861 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 10:47:24,862 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 214 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:24,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 280 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4321 states. [2022-11-20 10:47:25,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4321 to 3924. [2022-11-20 10:47:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3924 states, 3912 states have (on average 1.3967280163599183) internal successors, (5464), 3923 states have internal predecessors, (5464), 0 states have call successors, (0), 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 10:47:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 5464 transitions. [2022-11-20 10:47:25,123 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 5464 transitions. Word has length 59 [2022-11-20 10:47:25,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:25,124 INFO L495 AbstractCegarLoop]: Abstraction has 3924 states and 5464 transitions. [2022-11-20 10:47:25,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 10:47:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 5464 transitions. [2022-11-20 10:47:25,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 10:47:25,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:25,125 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] [2022-11-20 10:47:25,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:47:25,126 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 10:47:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:25,127 INFO L85 PathProgramCache]: Analyzing trace with hash 467702392, now seen corresponding path program 1 times [2022-11-20 10:47:25,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:25,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717319752] [2022-11-20 10:47:25,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:25,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 10:47:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:25,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717319752] [2022-11-20 10:47:25,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717319752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:25,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:25,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:25,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746184344] [2022-11-20 10:47:25,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:25,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:25,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:25,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:25,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:25,254 INFO L87 Difference]: Start difference. First operand 3924 states and 5464 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 10:47:25,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:25,727 INFO L93 Difference]: Finished difference Result 7938 states and 11028 transitions. [2022-11-20 10:47:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:47:25,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 59 [2022-11-20 10:47:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:25,743 INFO L225 Difference]: With dead ends: 7938 [2022-11-20 10:47:25,743 INFO L226 Difference]: Without dead ends: 5090 [2022-11-20 10:47:25,747 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 10:47:25,748 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 214 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:25,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 270 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5090 states. [2022-11-20 10:47:26,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5090 to 5084. [2022-11-20 10:47:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5084 states, 5072 states have (on average 1.359621451104101) internal successors, (6896), 5083 states have internal predecessors, (6896), 0 states have call successors, (0), 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 10:47:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5084 states to 5084 states and 6896 transitions. [2022-11-20 10:47:26,133 INFO L78 Accepts]: Start accepts. Automaton has 5084 states and 6896 transitions. Word has length 59 [2022-11-20 10:47:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:26,133 INFO L495 AbstractCegarLoop]: Abstraction has 5084 states and 6896 transitions. [2022-11-20 10:47:26,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 10:47:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 5084 states and 6896 transitions. [2022-11-20 10:47:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 10:47:26,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:26,135 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] [2022-11-20 10:47:26,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:47:26,136 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 10:47:26,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:26,137 INFO L85 PathProgramCache]: Analyzing trace with hash 253225172, now seen corresponding path program 1 times [2022-11-20 10:47:26,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:26,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757959160] [2022-11-20 10:47:26,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:26,249 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 10:47:26,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:26,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757959160] [2022-11-20 10:47:26,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757959160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:26,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:26,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:47:26,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064742362] [2022-11-20 10:47:26,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:26,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:47:26,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:26,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:47:26,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:47:26,252 INFO L87 Difference]: Start difference. First operand 5084 states and 6896 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 10:47:26,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:26,660 INFO L93 Difference]: Finished difference Result 5936 states and 8192 transitions. [2022-11-20 10:47:26,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:47:26,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 59 [2022-11-20 10:47:26,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:26,732 INFO L225 Difference]: With dead ends: 5936 [2022-11-20 10:47:26,732 INFO L226 Difference]: Without dead ends: 5933 [2022-11-20 10:47:26,734 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 10:47:26,735 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 100 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:26,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 208 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5933 states. [2022-11-20 10:47:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5933 to 5924. [2022-11-20 10:47:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5924 states, 5912 states have (on average 1.3734776725304465) internal successors, (8120), 5923 states have internal predecessors, (8120), 0 states have call successors, (0), 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 10:47:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5924 states to 5924 states and 8120 transitions. [2022-11-20 10:47:27,086 INFO L78 Accepts]: Start accepts. Automaton has 5924 states and 8120 transitions. Word has length 59 [2022-11-20 10:47:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:27,087 INFO L495 AbstractCegarLoop]: Abstraction has 5924 states and 8120 transitions. [2022-11-20 10:47:27,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 10:47:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5924 states and 8120 transitions. [2022-11-20 10:47:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-20 10:47:27,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:27,088 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:27,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:47:27,089 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 10:47:27,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:27,090 INFO L85 PathProgramCache]: Analyzing trace with hash 725139061, now seen corresponding path program 1 times [2022-11-20 10:47:27,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:27,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381749928] [2022-11-20 10:47:27,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:27,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:47:27,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:27,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381749928] [2022-11-20 10:47:27,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381749928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:27,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:27,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:27,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95948492] [2022-11-20 10:47:27,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:27,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:27,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:27,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:27,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:27,207 INFO L87 Difference]: Start difference. First operand 5924 states and 8120 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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 10:47:27,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:27,746 INFO L93 Difference]: Finished difference Result 11866 states and 16776 transitions. [2022-11-20 10:47:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:27,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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 60 [2022-11-20 10:47:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:27,767 INFO L225 Difference]: With dead ends: 11866 [2022-11-20 10:47:27,767 INFO L226 Difference]: Without dead ends: 7966 [2022-11-20 10:47:27,772 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 10:47:27,773 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 239 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:27,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 201 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:27,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7966 states. [2022-11-20 10:47:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7966 to 7004. [2022-11-20 10:47:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7004 states, 6992 states have (on average 1.4170480549199085) internal successors, (9908), 7003 states have internal predecessors, (9908), 0 states have call successors, (0), 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 10:47:28,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7004 states to 7004 states and 9908 transitions. [2022-11-20 10:47:28,240 INFO L78 Accepts]: Start accepts. Automaton has 7004 states and 9908 transitions. Word has length 60 [2022-11-20 10:47:28,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:28,240 INFO L495 AbstractCegarLoop]: Abstraction has 7004 states and 9908 transitions. [2022-11-20 10:47:28,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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 10:47:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7004 states and 9908 transitions. [2022-11-20 10:47:28,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-20 10:47:28,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:28,249 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] [2022-11-20 10:47:28,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 10:47:28,250 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 10:47:28,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:28,250 INFO L85 PathProgramCache]: Analyzing trace with hash -739954027, now seen corresponding path program 1 times [2022-11-20 10:47:28,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:28,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526771664] [2022-11-20 10:47:28,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:28,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:28,375 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 10:47:28,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:28,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526771664] [2022-11-20 10:47:28,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526771664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:28,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:28,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:47:28,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274769449] [2022-11-20 10:47:28,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:28,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:47:28,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:28,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:47:28,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:47:28,379 INFO L87 Difference]: Start difference. First operand 7004 states and 9908 transitions. Second operand has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 10:47:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:28,886 INFO L93 Difference]: Finished difference Result 7007 states and 9908 transitions. [2022-11-20 10:47:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:47:28,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 60 [2022-11-20 10:47:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:28,903 INFO L225 Difference]: With dead ends: 7007 [2022-11-20 10:47:28,903 INFO L226 Difference]: Without dead ends: 7004 [2022-11-20 10:47:28,933 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 10:47:28,934 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 103 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:28,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 162 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:28,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7004 states. [2022-11-20 10:47:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7004 to 7001. [2022-11-20 10:47:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7001 states, 6992 states have (on average 1.375858123569794) internal successors, (9620), 7000 states have internal predecessors, (9620), 0 states have call successors, (0), 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 10:47:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7001 states to 7001 states and 9620 transitions. [2022-11-20 10:47:29,301 INFO L78 Accepts]: Start accepts. Automaton has 7001 states and 9620 transitions. Word has length 60 [2022-11-20 10:47:29,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:29,301 INFO L495 AbstractCegarLoop]: Abstraction has 7001 states and 9620 transitions. [2022-11-20 10:47:29,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 10:47:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 7001 states and 9620 transitions. [2022-11-20 10:47:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-20 10:47:29,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:29,303 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 10:47:29,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 10:47:29,303 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 10:47:29,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1463738122, now seen corresponding path program 1 times [2022-11-20 10:47:29,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:29,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940173171] [2022-11-20 10:47:29,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:29,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:29,414 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 10:47:29,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:29,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940173171] [2022-11-20 10:47:29,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940173171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:29,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:29,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:29,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729760940] [2022-11-20 10:47:29,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:29,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:29,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:29,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:29,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:29,417 INFO L87 Difference]: Start difference. First operand 7001 states and 9620 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 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 10:47:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:29,959 INFO L93 Difference]: Finished difference Result 12899 states and 17940 transitions. [2022-11-20 10:47:29,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:29,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 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 61 [2022-11-20 10:47:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:29,976 INFO L225 Difference]: With dead ends: 12899 [2022-11-20 10:47:29,976 INFO L226 Difference]: Without dead ends: 7850 [2022-11-20 10:47:29,983 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 10:47:29,984 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 209 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:29,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 293 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7850 states. [2022-11-20 10:47:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7850 to 7841. [2022-11-20 10:47:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7841 states, 7832 states have (on average 1.367211440245148) internal successors, (10708), 7840 states have internal predecessors, (10708), 0 states have call successors, (0), 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 10:47:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7841 states to 7841 states and 10708 transitions. [2022-11-20 10:47:30,429 INFO L78 Accepts]: Start accepts. Automaton has 7841 states and 10708 transitions. Word has length 61 [2022-11-20 10:47:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:30,429 INFO L495 AbstractCegarLoop]: Abstraction has 7841 states and 10708 transitions. [2022-11-20 10:47:30,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 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 10:47:30,430 INFO L276 IsEmpty]: Start isEmpty. Operand 7841 states and 10708 transitions. [2022-11-20 10:47:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-20 10:47:30,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:30,431 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 10:47:30,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 10:47:30,431 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 10:47:30,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1868758711, now seen corresponding path program 1 times [2022-11-20 10:47:30,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:30,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073581684] [2022-11-20 10:47:30,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:30,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:30,537 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 10:47:30,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:30,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073581684] [2022-11-20 10:47:30,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073581684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:30,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:30,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:30,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855989130] [2022-11-20 10:47:30,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:30,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:30,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:30,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:30,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:30,541 INFO L87 Difference]: Start difference. First operand 7841 states and 10708 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 10:47:31,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:31,049 INFO L93 Difference]: Finished difference Result 14689 states and 20572 transitions. [2022-11-20 10:47:31,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:31,050 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 62 [2022-11-20 10:47:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:31,071 INFO L225 Difference]: With dead ends: 14689 [2022-11-20 10:47:31,072 INFO L226 Difference]: Without dead ends: 8800 [2022-11-20 10:47:31,079 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 10:47:31,080 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 226 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:31,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 213 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:31,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8800 states. [2022-11-20 10:47:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8800 to 7105. [2022-11-20 10:47:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7105 states, 7096 states have (on average 1.3771138669673055) internal successors, (9772), 7104 states have internal predecessors, (9772), 0 states have call successors, (0), 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 10:47:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 9772 transitions. [2022-11-20 10:47:31,676 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 9772 transitions. Word has length 62 [2022-11-20 10:47:31,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:31,677 INFO L495 AbstractCegarLoop]: Abstraction has 7105 states and 9772 transitions. [2022-11-20 10:47:31,677 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 10:47:31,677 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 9772 transitions. [2022-11-20 10:47:31,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 10:47:31,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:31,679 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] [2022-11-20 10:47:31,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 10:47:31,679 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 10:47:31,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:31,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1849222512, now seen corresponding path program 1 times [2022-11-20 10:47:31,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:31,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80125172] [2022-11-20 10:47:31,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:31,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:47:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:31,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80125172] [2022-11-20 10:47:31,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80125172] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:31,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:31,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461183841] [2022-11-20 10:47:31,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:31,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:31,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:31,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:31,810 INFO L87 Difference]: Start difference. First operand 7105 states and 9772 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 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 10:47:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:32,270 INFO L93 Difference]: Finished difference Result 7495 states and 10292 transitions. [2022-11-20 10:47:32,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:32,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 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 63 [2022-11-20 10:47:32,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:32,287 INFO L225 Difference]: With dead ends: 7495 [2022-11-20 10:47:32,287 INFO L226 Difference]: Without dead ends: 7492 [2022-11-20 10:47:32,289 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 10:47:32,289 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 160 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:32,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 267 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:32,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2022-11-20 10:47:32,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 7489. [2022-11-20 10:47:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7489 states, 7480 states have (on average 1.367379679144385) internal successors, (10228), 7488 states have internal predecessors, (10228), 0 states have call successors, (0), 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 10:47:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7489 states to 7489 states and 10228 transitions. [2022-11-20 10:47:32,714 INFO L78 Accepts]: Start accepts. Automaton has 7489 states and 10228 transitions. Word has length 63 [2022-11-20 10:47:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:32,715 INFO L495 AbstractCegarLoop]: Abstraction has 7489 states and 10228 transitions. [2022-11-20 10:47:32,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 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 10:47:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 7489 states and 10228 transitions. [2022-11-20 10:47:32,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 10:47:32,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:32,716 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] [2022-11-20 10:47:32,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 10:47:32,718 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 10:47:32,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:32,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1389827380, now seen corresponding path program 1 times [2022-11-20 10:47:32,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:32,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719887616] [2022-11-20 10:47:32,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:32,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:32,804 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 10:47:32,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:32,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719887616] [2022-11-20 10:47:32,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719887616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:32,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:32,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:47:32,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044574781] [2022-11-20 10:47:32,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:32,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:47:32,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:32,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:47:32,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:47:32,808 INFO L87 Difference]: Start difference. First operand 7489 states and 10228 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 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 10:47:33,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:33,439 INFO L93 Difference]: Finished difference Result 9741 states and 13492 transitions. [2022-11-20 10:47:33,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:47:33,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 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 63 [2022-11-20 10:47:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:33,456 INFO L225 Difference]: With dead ends: 9741 [2022-11-20 10:47:33,456 INFO L226 Difference]: Without dead ends: 9738 [2022-11-20 10:47:33,458 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 10:47:33,460 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 137 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:33,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 251 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9738 states. [2022-11-20 10:47:33,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9738 to 9169. [2022-11-20 10:47:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9169 states, 9160 states have (on average 1.3524017467248908) internal successors, (12388), 9168 states have internal predecessors, (12388), 0 states have call successors, (0), 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 10:47:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9169 states to 9169 states and 12388 transitions. [2022-11-20 10:47:33,955 INFO L78 Accepts]: Start accepts. Automaton has 9169 states and 12388 transitions. Word has length 63 [2022-11-20 10:47:33,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:33,956 INFO L495 AbstractCegarLoop]: Abstraction has 9169 states and 12388 transitions. [2022-11-20 10:47:33,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 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 10:47:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 9169 states and 12388 transitions. [2022-11-20 10:47:33,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 10:47:33,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:33,958 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] [2022-11-20 10:47:33,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 10:47:33,958 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 10:47:33,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:33,959 INFO L85 PathProgramCache]: Analyzing trace with hash 110724334, now seen corresponding path program 1 times [2022-11-20 10:47:33,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:33,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296190295] [2022-11-20 10:47:33,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:33,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:34,066 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 10:47:34,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:34,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296190295] [2022-11-20 10:47:34,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296190295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:34,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:34,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:34,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063044330] [2022-11-20 10:47:34,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:34,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:34,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:34,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:34,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:34,068 INFO L87 Difference]: Start difference. First operand 9169 states and 12388 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 10:47:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:34,658 INFO L93 Difference]: Finished difference Result 11704 states and 15916 transitions. [2022-11-20 10:47:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:34,660 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 65 [2022-11-20 10:47:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:34,673 INFO L225 Difference]: With dead ends: 11704 [2022-11-20 10:47:34,673 INFO L226 Difference]: Without dead ends: 11701 [2022-11-20 10:47:34,676 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 10:47:34,677 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 156 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:34,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 303 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11701 states. [2022-11-20 10:47:35,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11701 to 11689. [2022-11-20 10:47:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11689 states, 11680 states have (on average 1.3544520547945205) internal successors, (15820), 11688 states have internal predecessors, (15820), 0 states have call successors, (0), 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 10:47:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11689 states to 11689 states and 15820 transitions. [2022-11-20 10:47:35,306 INFO L78 Accepts]: Start accepts. Automaton has 11689 states and 15820 transitions. Word has length 65 [2022-11-20 10:47:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:35,307 INFO L495 AbstractCegarLoop]: Abstraction has 11689 states and 15820 transitions. [2022-11-20 10:47:35,307 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 10:47:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 11689 states and 15820 transitions. [2022-11-20 10:47:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 10:47:35,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:35,310 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] [2022-11-20 10:47:35,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 10:47:35,310 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 10:47:35,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:35,311 INFO L85 PathProgramCache]: Analyzing trace with hash -553343506, now seen corresponding path program 1 times [2022-11-20 10:47:35,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:35,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616777329] [2022-11-20 10:47:35,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:35,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:35,435 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 10:47:35,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:35,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616777329] [2022-11-20 10:47:35,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616777329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:35,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:35,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:35,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966453437] [2022-11-20 10:47:35,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:35,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:35,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:35,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:35,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:35,438 INFO L87 Difference]: Start difference. First operand 11689 states and 15820 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 10:47:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:36,226 INFO L93 Difference]: Finished difference Result 12535 states and 16972 transitions. [2022-11-20 10:47:36,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:36,227 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 65 [2022-11-20 10:47:36,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:36,245 INFO L225 Difference]: With dead ends: 12535 [2022-11-20 10:47:36,246 INFO L226 Difference]: Without dead ends: 12532 [2022-11-20 10:47:36,249 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 10:47:36,250 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 132 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:36,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 343 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:47:36,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12532 states. [2022-11-20 10:47:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12532 to 12529. [2022-11-20 10:47:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12529 states, 12520 states have (on average 1.3517571884984025) internal successors, (16924), 12528 states have internal predecessors, (16924), 0 states have call successors, (0), 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 10:47:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12529 states to 12529 states and 16924 transitions. [2022-11-20 10:47:36,809 INFO L78 Accepts]: Start accepts. Automaton has 12529 states and 16924 transitions. Word has length 65 [2022-11-20 10:47:36,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:36,809 INFO L495 AbstractCegarLoop]: Abstraction has 12529 states and 16924 transitions. [2022-11-20 10:47:36,809 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 10:47:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 12529 states and 16924 transitions. [2022-11-20 10:47:36,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-20 10:47:36,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:36,811 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 10:47:36,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 10:47:36,812 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 10:47:36,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:36,812 INFO L85 PathProgramCache]: Analyzing trace with hash -862512705, now seen corresponding path program 1 times [2022-11-20 10:47:36,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:36,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459581420] [2022-11-20 10:47:36,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:36,924 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 10:47:36,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:36,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459581420] [2022-11-20 10:47:36,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459581420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:36,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:36,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:36,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615010173] [2022-11-20 10:47:36,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:36,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:36,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:36,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:36,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:36,927 INFO L87 Difference]: Start difference. First operand 12529 states and 16924 transitions. Second operand has 5 states, 4 states have (on average 16.25) 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 10:47:37,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:37,550 INFO L93 Difference]: Finished difference Result 14431 states and 19476 transitions. [2022-11-20 10:47:37,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:37,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) 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 66 [2022-11-20 10:47:37,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:37,562 INFO L225 Difference]: With dead ends: 14431 [2022-11-20 10:47:37,562 INFO L226 Difference]: Without dead ends: 8825 [2022-11-20 10:47:37,570 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 10:47:37,570 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 138 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:37,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 281 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:37,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8825 states. [2022-11-20 10:47:37,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8825 to 6737. [2022-11-20 10:47:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6737 states, 6728 states have (on average 1.348989298454221) internal successors, (9076), 6736 states have internal predecessors, (9076), 0 states have call successors, (0), 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 10:47:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6737 states to 6737 states and 9076 transitions. [2022-11-20 10:47:37,989 INFO L78 Accepts]: Start accepts. Automaton has 6737 states and 9076 transitions. Word has length 66 [2022-11-20 10:47:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:37,989 INFO L495 AbstractCegarLoop]: Abstraction has 6737 states and 9076 transitions. [2022-11-20 10:47:37,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) 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 10:47:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 6737 states and 9076 transitions. [2022-11-20 10:47:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-20 10:47:37,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:37,991 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] [2022-11-20 10:47:37,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 10:47:37,992 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 10:47:37,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:37,992 INFO L85 PathProgramCache]: Analyzing trace with hash 295325158, now seen corresponding path program 1 times [2022-11-20 10:47:37,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:37,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362324112] [2022-11-20 10:47:37,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:37,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:38,096 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 10:47:38,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:38,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362324112] [2022-11-20 10:47:38,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362324112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:38,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:38,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:38,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537785394] [2022-11-20 10:47:38,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:38,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:38,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:38,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:38,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:38,100 INFO L87 Difference]: Start difference. First operand 6737 states and 9076 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 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 10:47:38,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:38,477 INFO L93 Difference]: Finished difference Result 6926 states and 9316 transitions. [2022-11-20 10:47:38,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:38,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 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 10:47:38,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:38,486 INFO L225 Difference]: With dead ends: 6926 [2022-11-20 10:47:38,486 INFO L226 Difference]: Without dead ends: 6557 [2022-11-20 10:47:38,488 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 10:47:38,489 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 142 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:38,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 318 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:38,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2022-11-20 10:47:38,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 6553. [2022-11-20 10:47:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6553 states, 6544 states have (on average 1.3484107579462103) internal successors, (8824), 6552 states have internal predecessors, (8824), 0 states have call successors, (0), 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 10:47:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 8824 transitions. [2022-11-20 10:47:38,843 INFO L78 Accepts]: Start accepts. Automaton has 6553 states and 8824 transitions. Word has length 69 [2022-11-20 10:47:38,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:38,843 INFO L495 AbstractCegarLoop]: Abstraction has 6553 states and 8824 transitions. [2022-11-20 10:47:38,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 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 10:47:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 6553 states and 8824 transitions. [2022-11-20 10:47:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 10:47:38,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:38,847 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:38,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 10:47:38,847 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 10:47:38,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:38,848 INFO L85 PathProgramCache]: Analyzing trace with hash 857425953, now seen corresponding path program 1 times [2022-11-20 10:47:38,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:38,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691106263] [2022-11-20 10:47:38,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:38,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:47:38,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:38,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691106263] [2022-11-20 10:47:38,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691106263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:38,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:38,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:47:38,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456305163] [2022-11-20 10:47:38,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:38,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:47:38,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:38,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:47:38,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:47:38,947 INFO L87 Difference]: Start difference. First operand 6553 states and 8824 transitions. Second operand has 4 states, 3 states have (on average 26.666666666666668) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 10:47:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:39,404 INFO L93 Difference]: Finished difference Result 6743 states and 9060 transitions. [2022-11-20 10:47:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:47:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 26.666666666666668) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 83 [2022-11-20 10:47:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:39,412 INFO L225 Difference]: With dead ends: 6743 [2022-11-20 10:47:39,412 INFO L226 Difference]: Without dead ends: 6740 [2022-11-20 10:47:39,414 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 10:47:39,414 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 94 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:39,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 316 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2022-11-20 10:47:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 6550. [2022-11-20 10:47:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6550 states, 6544 states have (on average 1.3117359413202934) internal successors, (8584), 6549 states have internal predecessors, (8584), 0 states have call successors, (0), 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 10:47:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6550 states to 6550 states and 8584 transitions. [2022-11-20 10:47:39,759 INFO L78 Accepts]: Start accepts. Automaton has 6550 states and 8584 transitions. Word has length 83 [2022-11-20 10:47:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:39,759 INFO L495 AbstractCegarLoop]: Abstraction has 6550 states and 8584 transitions. [2022-11-20 10:47:39,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 26.666666666666668) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 10:47:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6550 states and 8584 transitions. [2022-11-20 10:47:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-20 10:47:39,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:39,763 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-20 10:47:39,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 10:47:39,764 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 10:47:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:39,764 INFO L85 PathProgramCache]: Analyzing trace with hash -647372541, now seen corresponding path program 1 times [2022-11-20 10:47:39,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:39,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465413990] [2022-11-20 10:47:39,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:39,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:47:39,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:39,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465413990] [2022-11-20 10:47:39,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465413990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:39,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:39,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:39,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091852515] [2022-11-20 10:47:39,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:39,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:39,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:39,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:39,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:39,887 INFO L87 Difference]: Start difference. First operand 6550 states and 8584 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 10:47:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:40,464 INFO L93 Difference]: Finished difference Result 9437 states and 12468 transitions. [2022-11-20 10:47:40,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:40,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 85 [2022-11-20 10:47:40,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:40,470 INFO L225 Difference]: With dead ends: 9437 [2022-11-20 10:47:40,470 INFO L226 Difference]: Without dead ends: 5695 [2022-11-20 10:47:40,474 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 10:47:40,475 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 161 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:40,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 379 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:47:40,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5695 states. [2022-11-20 10:47:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5695 to 5686. [2022-11-20 10:47:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5686 states, 5680 states have (on average 1.3084507042253521) internal successors, (7432), 5685 states have internal predecessors, (7432), 0 states have call successors, (0), 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 10:47:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5686 states to 5686 states and 7432 transitions. [2022-11-20 10:47:40,695 INFO L78 Accepts]: Start accepts. Automaton has 5686 states and 7432 transitions. Word has length 85 [2022-11-20 10:47:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:40,695 INFO L495 AbstractCegarLoop]: Abstraction has 5686 states and 7432 transitions. [2022-11-20 10:47:40,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 10:47:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand 5686 states and 7432 transitions. [2022-11-20 10:47:40,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-20 10:47:40,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:40,699 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:40,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 10:47:40,699 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 10:47:40,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:40,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1239209887, now seen corresponding path program 1 times [2022-11-20 10:47:40,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:40,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590561751] [2022-11-20 10:47:40,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:40,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 10:47:40,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:40,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590561751] [2022-11-20 10:47:40,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590561751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:40,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:40,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:40,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498375012] [2022-11-20 10:47:40,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:40,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:40,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:40,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:40,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:40,818 INFO L87 Difference]: Start difference. First operand 5686 states and 7432 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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 10:47:41,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:41,218 INFO L93 Difference]: Finished difference Result 5689 states and 7432 transitions. [2022-11-20 10:47:41,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:41,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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 85 [2022-11-20 10:47:41,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:41,224 INFO L225 Difference]: With dead ends: 5689 [2022-11-20 10:47:41,224 INFO L226 Difference]: Without dead ends: 5686 [2022-11-20 10:47:41,226 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 10:47:41,226 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 114 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:41,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 289 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5686 states. [2022-11-20 10:47:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5686 to 5686. [2022-11-20 10:47:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5686 states, 5680 states have (on average 1.3028169014084507) internal successors, (7400), 5685 states have internal predecessors, (7400), 0 states have call successors, (0), 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 10:47:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5686 states to 5686 states and 7400 transitions. [2022-11-20 10:47:41,455 INFO L78 Accepts]: Start accepts. Automaton has 5686 states and 7400 transitions. Word has length 85 [2022-11-20 10:47:41,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:41,456 INFO L495 AbstractCegarLoop]: Abstraction has 5686 states and 7400 transitions. [2022-11-20 10:47:41,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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 10:47:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5686 states and 7400 transitions. [2022-11-20 10:47:41,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-20 10:47:41,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:41,459 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-20 10:47:41,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-20 10:47:41,460 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 10:47:41,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1882023491, now seen corresponding path program 2 times [2022-11-20 10:47:41,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:41,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412539281] [2022-11-20 10:47:41,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:41,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:41,604 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:47:41,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:41,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412539281] [2022-11-20 10:47:41,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412539281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:41,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:41,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:41,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110491436] [2022-11-20 10:47:41,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:41,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:41,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:41,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:41,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:41,607 INFO L87 Difference]: Start difference. First operand 5686 states and 7400 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 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 10:47:42,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:42,276 INFO L93 Difference]: Finished difference Result 5877 states and 7636 transitions. [2022-11-20 10:47:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:42,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 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 85 [2022-11-20 10:47:42,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:42,284 INFO L225 Difference]: With dead ends: 5877 [2022-11-20 10:47:42,284 INFO L226 Difference]: Without dead ends: 4948 [2022-11-20 10:47:42,287 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 10:47:42,288 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 137 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:42,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 465 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:47:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4948 states. [2022-11-20 10:47:42,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4948 to 4942. [2022-11-20 10:47:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4942 states, 4936 states have (on average 1.3047001620745542) internal successors, (6440), 4941 states have internal predecessors, (6440), 0 states have call successors, (0), 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 10:47:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4942 states to 4942 states and 6440 transitions. [2022-11-20 10:47:42,731 INFO L78 Accepts]: Start accepts. Automaton has 4942 states and 6440 transitions. Word has length 85 [2022-11-20 10:47:42,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:42,732 INFO L495 AbstractCegarLoop]: Abstraction has 4942 states and 6440 transitions. [2022-11-20 10:47:42,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 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 10:47:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 4942 states and 6440 transitions. [2022-11-20 10:47:42,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-20 10:47:42,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:42,736 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:42,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-20 10:47:42,736 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 10:47:42,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:42,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2139283297, now seen corresponding path program 1 times [2022-11-20 10:47:42,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:42,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54753390] [2022-11-20 10:47:42,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:42,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:47:42,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:42,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54753390] [2022-11-20 10:47:42,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54753390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:42,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:42,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:42,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961208277] [2022-11-20 10:47:42,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:42,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:42,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:42,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:42,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:42,882 INFO L87 Difference]: Start difference. First operand 4942 states and 6440 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 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 10:47:43,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:43,224 INFO L93 Difference]: Finished difference Result 4948 states and 6440 transitions. [2022-11-20 10:47:43,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:43,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 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 87 [2022-11-20 10:47:43,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:43,231 INFO L225 Difference]: With dead ends: 4948 [2022-11-20 10:47:43,231 INFO L226 Difference]: Without dead ends: 4945 [2022-11-20 10:47:43,233 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 10:47:43,234 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 121 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 293 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 10:47:43,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 293 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:43,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4945 states. [2022-11-20 10:47:43,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4945 to 4942. [2022-11-20 10:47:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4942 states, 4936 states have (on average 1.2949756888168558) internal successors, (6392), 4941 states have internal predecessors, (6392), 0 states have call successors, (0), 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 10:47:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4942 states to 4942 states and 6392 transitions. [2022-11-20 10:47:43,405 INFO L78 Accepts]: Start accepts. Automaton has 4942 states and 6392 transitions. Word has length 87 [2022-11-20 10:47:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:43,406 INFO L495 AbstractCegarLoop]: Abstraction has 4942 states and 6392 transitions. [2022-11-20 10:47:43,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 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 10:47:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4942 states and 6392 transitions. [2022-11-20 10:47:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-20 10:47:43,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:43,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:43,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-20 10:47:43,409 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 10:47:43,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:43,409 INFO L85 PathProgramCache]: Analyzing trace with hash 652001695, now seen corresponding path program 1 times [2022-11-20 10:47:43,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:43,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298505974] [2022-11-20 10:47:43,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:43,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 10:47:43,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:43,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298505974] [2022-11-20 10:47:43,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298505974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:43,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:43,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:43,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120573866] [2022-11-20 10:47:43,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:43,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:43,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:43,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:43,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:43,525 INFO L87 Difference]: Start difference. First operand 4942 states and 6392 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 10:47:43,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:43,905 INFO L93 Difference]: Finished difference Result 4945 states and 6392 transitions. [2022-11-20 10:47:43,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:43,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 87 [2022-11-20 10:47:43,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:43,912 INFO L225 Difference]: With dead ends: 4945 [2022-11-20 10:47:43,912 INFO L226 Difference]: Without dead ends: 4942 [2022-11-20 10:47:43,914 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 10:47:43,915 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 111 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:43,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 342 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4942 states. [2022-11-20 10:47:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4942 to 4942. [2022-11-20 10:47:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4942 states, 4936 states have (on average 1.2901134521880064) internal successors, (6368), 4941 states have internal predecessors, (6368), 0 states have call successors, (0), 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 10:47:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4942 states to 4942 states and 6368 transitions. [2022-11-20 10:47:44,236 INFO L78 Accepts]: Start accepts. Automaton has 4942 states and 6368 transitions. Word has length 87 [2022-11-20 10:47:44,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:44,237 INFO L495 AbstractCegarLoop]: Abstraction has 4942 states and 6368 transitions. [2022-11-20 10:47:44,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 10:47:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4942 states and 6368 transitions. [2022-11-20 10:47:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-20 10:47:44,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:44,239 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-20 10:47:44,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-20 10:47:44,240 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 10:47:44,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:44,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1893272530, now seen corresponding path program 1 times [2022-11-20 10:47:44,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:44,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872883845] [2022-11-20 10:47:44,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:44,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:47:44,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:44,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872883845] [2022-11-20 10:47:44,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872883845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:44,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:44,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:44,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011520138] [2022-11-20 10:47:44,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:44,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:44,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:44,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:44,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:44,379 INFO L87 Difference]: Start difference. First operand 4942 states and 6368 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 10:47:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:44,696 INFO L93 Difference]: Finished difference Result 6012 states and 7774 transitions. [2022-11-20 10:47:44,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:44,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 88 [2022-11-20 10:47:44,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:44,700 INFO L225 Difference]: With dead ends: 6012 [2022-11-20 10:47:44,700 INFO L226 Difference]: Without dead ends: 3302 [2022-11-20 10:47:44,702 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 10:47:44,703 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 100 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:44,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 296 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2022-11-20 10:47:44,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 2969. [2022-11-20 10:47:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2969 states, 2968 states have (on average 1.2452830188679245) internal successors, (3696), 2968 states have internal predecessors, (3696), 0 states have call successors, (0), 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 10:47:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2969 states and 3696 transitions. [2022-11-20 10:47:44,879 INFO L78 Accepts]: Start accepts. Automaton has 2969 states and 3696 transitions. Word has length 88 [2022-11-20 10:47:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:44,880 INFO L495 AbstractCegarLoop]: Abstraction has 2969 states and 3696 transitions. [2022-11-20 10:47:44,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 10:47:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2969 states and 3696 transitions. [2022-11-20 10:47:44,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-20 10:47:44,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:44,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:44,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-20 10:47:44,882 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 10:47:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:44,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1945544983, now seen corresponding path program 1 times [2022-11-20 10:47:44,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:44,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020898873] [2022-11-20 10:47:44,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:44,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:47:45,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:45,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020898873] [2022-11-20 10:47:45,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020898873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:45,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:45,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:45,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643841323] [2022-11-20 10:47:45,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:45,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:45,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:45,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:45,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:45,015 INFO L87 Difference]: Start difference. First operand 2969 states and 3696 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 10:47:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:45,297 INFO L93 Difference]: Finished difference Result 3155 states and 3932 transitions. [2022-11-20 10:47:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:45,297 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 91 [2022-11-20 10:47:45,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:45,300 INFO L225 Difference]: With dead ends: 3155 [2022-11-20 10:47:45,300 INFO L226 Difference]: Without dead ends: 2402 [2022-11-20 10:47:45,301 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 10:47:45,301 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 102 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:45,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 358 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2022-11-20 10:47:45,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 2033. [2022-11-20 10:47:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2033 states, 2032 states have (on average 1.2401574803149606) internal successors, (2520), 2032 states have internal predecessors, (2520), 0 states have call successors, (0), 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 10:47:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 2520 transitions. [2022-11-20 10:47:45,427 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 2520 transitions. Word has length 91 [2022-11-20 10:47:45,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:45,427 INFO L495 AbstractCegarLoop]: Abstraction has 2033 states and 2520 transitions. [2022-11-20 10:47:45,427 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 10:47:45,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2520 transitions. [2022-11-20 10:47:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-20 10:47:45,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:45,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:45,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-20 10:47:45,429 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 10:47:45,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:45,430 INFO L85 PathProgramCache]: Analyzing trace with hash -684545769, now seen corresponding path program 2 times [2022-11-20 10:47:45,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:45,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79425417] [2022-11-20 10:47:45,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:45,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 10:47:45,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:45,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79425417] [2022-11-20 10:47:45,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79425417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:45,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:45,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:45,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353249169] [2022-11-20 10:47:45,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:45,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:45,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:45,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:45,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:45,556 INFO L87 Difference]: Start difference. First operand 2033 states and 2520 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 10:47:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:45,836 INFO L93 Difference]: Finished difference Result 2218 states and 2756 transitions. [2022-11-20 10:47:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:45,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 91 [2022-11-20 10:47:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:45,838 INFO L225 Difference]: With dead ends: 2218 [2022-11-20 10:47:45,839 INFO L226 Difference]: Without dead ends: 1753 [2022-11-20 10:47:45,840 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 10:47:45,841 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 120 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:45,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 395 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2022-11-20 10:47:45,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1753. [2022-11-20 10:47:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1752 states have (on average 1.2283105022831051) internal successors, (2152), 1752 states have internal predecessors, (2152), 0 states have call successors, (0), 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 10:47:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2152 transitions. [2022-11-20 10:47:45,939 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2152 transitions. Word has length 91 [2022-11-20 10:47:45,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:45,939 INFO L495 AbstractCegarLoop]: Abstraction has 1753 states and 2152 transitions. [2022-11-20 10:47:45,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 10:47:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2152 transitions. [2022-11-20 10:47:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-20 10:47:45,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:45,941 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-20 10:47:45,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-20 10:47:45,942 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 10:47:45,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:45,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1744312012, now seen corresponding path program 1 times [2022-11-20 10:47:45,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:45,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356833809] [2022-11-20 10:47:45,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:45,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 10:47:46,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:46,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356833809] [2022-11-20 10:47:46,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356833809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:46,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:46,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:46,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344775094] [2022-11-20 10:47:46,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:46,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:46,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:46,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:46,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:46,073 INFO L87 Difference]: Start difference. First operand 1753 states and 2152 transitions. Second operand has 5 states, 4 states have (on average 25.5) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 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 10:47:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:46,280 INFO L93 Difference]: Finished difference Result 1753 states and 2152 transitions. [2022-11-20 10:47:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:46,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.5) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 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 107 [2022-11-20 10:47:46,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:46,281 INFO L225 Difference]: With dead ends: 1753 [2022-11-20 10:47:46,282 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 10:47:46,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 10:47:46,284 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 103 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:46,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 336 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:46,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 10:47:46,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 10:47:46,285 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 10:47:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 10:47:46,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2022-11-20 10:47:46,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:46,285 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 10:47:46,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.5) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 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 10:47:46,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 10:47:46,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 10:47:46,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-20 10:47:46,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-20 10:47:46,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-20 10:47:46,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-20 10:47:46,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-20 10:47:46,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-20 10:47:46,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-20 10:47:46,291 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-20 10:47:46,291 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-20 10:47:46,291 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-20 10:47:46,291 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-20 10:47:46,292 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-20 10:47:46,292 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-20 10:47:46,292 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-20 10:47:46,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-20 10:47:46,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 10:48:09,755 WARN L233 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 760 DAG size of output: 758 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 10:48:15,144 WARN L233 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 742 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-20 10:48:36,455 WARN L233 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 758 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-20 10:48:36,458 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-20 10:48:36,458 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 100) no Hoare annotation was computed. [2022-11-20 10:48:36,459 INFO L895 garLoopResultBuilder]: At program point L85-2(lines 79 103) 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 10:48:36,459 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 195) no Hoare annotation was computed. [2022-11-20 10:48:36,459 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 10:48:36,459 INFO L899 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2022-11-20 10:48:36,459 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-20 10:48:36,459 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 192) no Hoare annotation was computed. [2022-11-20 10:48:36,461 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-20 10:48:36,461 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 189) no Hoare annotation was computed. [2022-11-20 10:48:36,461 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 95) no Hoare annotation was computed. [2022-11-20 10:48:36,461 INFO L899 garLoopResultBuilder]: For program point L88-1(lines 88 95) no Hoare annotation was computed. [2022-11-20 10:48:36,462 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 186) no Hoare annotation was computed. [2022-11-20 10:48:36,462 INFO L899 garLoopResultBuilder]: For program point L89(lines 89 94) no Hoare annotation was computed. [2022-11-20 10:48:36,462 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 25) no Hoare annotation was computed. [2022-11-20 10:48:36,462 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 183) no Hoare annotation was computed. [2022-11-20 10:48:36,462 INFO L899 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2022-11-20 10:48:36,462 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-20 10:48:36,463 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 180) no Hoare annotation was computed. [2022-11-20 10:48:36,463 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 10:48:36,463 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-20 10:48:36,463 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-11-20 10:48:36,463 INFO L899 garLoopResultBuilder]: For program point L207-1(line 207) no Hoare annotation was computed. [2022-11-20 10:48:36,463 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 177) no Hoare annotation was computed. [2022-11-20 10:48:36,464 INFO L899 garLoopResultBuilder]: For program point L207-2(line 207) no Hoare annotation was computed. [2022-11-20 10:48:36,464 INFO L899 garLoopResultBuilder]: For program point L207-3(line 207) no Hoare annotation was computed. [2022-11-20 10:48:36,464 INFO L899 garLoopResultBuilder]: For program point L207-4(lines 207 226) no Hoare annotation was computed. [2022-11-20 10:48:36,464 INFO L899 garLoopResultBuilder]: For program point L207-5(lines 207 226) no Hoare annotation was computed. [2022-11-20 10:48:36,464 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-20 10:48:36,464 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 94) no Hoare annotation was computed. [2022-11-20 10:48:36,465 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 75) no Hoare annotation was computed. [2022-11-20 10:48:36,465 INFO L895 garLoopResultBuilder]: At program point L59-2(lines 53 78) 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 10:48:36,465 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 223) no Hoare annotation was computed. [2022-11-20 10:48:36,465 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 174) no Hoare annotation was computed. [2022-11-20 10:48:36,465 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-20 10:48:36,466 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2022-11-20 10:48:36,466 INFO L899 garLoopResultBuilder]: For program point L60-1(line 60) no Hoare annotation was computed. [2022-11-20 10:48:36,466 INFO L895 garLoopResultBuilder]: At program point L275(lines 230 276) the Hoare annotation is: false [2022-11-20 10:48:36,466 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 171) no Hoare annotation was computed. [2022-11-20 10:48:36,466 INFO L899 garLoopResultBuilder]: For program point L110(lines 110 125) no Hoare annotation was computed. [2022-11-20 10:48:36,467 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 104 128) 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 10:48:36,467 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-20 10:48:36,467 INFO L895 garLoopResultBuilder]: At program point L259-2(lines 259 273) 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 10:48:36,467 INFO L899 garLoopResultBuilder]: For program point L259-3(lines 259 273) no Hoare annotation was computed. [2022-11-20 10:48:36,467 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 60) no Hoare annotation was computed. [2022-11-20 10:48:36,468 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 10:48:36,468 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 168) no Hoare annotation was computed. [2022-11-20 10:48:36,468 INFO L895 garLoopResultBuilder]: At program point L227(lines 202 229) 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 10:48:36,468 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 60) no Hoare annotation was computed. [2022-11-20 10:48:36,468 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 288) no Hoare annotation was computed. [2022-11-20 10:48:36,469 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-20 10:48:36,469 INFO L899 garLoopResultBuilder]: For program point L211-1(line 211) no Hoare annotation was computed. [2022-11-20 10:48:36,469 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 165) no Hoare annotation was computed. [2022-11-20 10:48:36,469 INFO L899 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2022-11-20 10:48:36,469 INFO L899 garLoopResultBuilder]: For program point L211-3(line 211) no Hoare annotation was computed. [2022-11-20 10:48:36,469 INFO L899 garLoopResultBuilder]: For program point L211-4(lines 211 223) no Hoare annotation was computed. [2022-11-20 10:48:36,469 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 70) no Hoare annotation was computed. [2022-11-20 10:48:36,470 INFO L899 garLoopResultBuilder]: For program point L63-1(lines 63 70) no Hoare annotation was computed. [2022-11-20 10:48:36,470 INFO L895 garLoopResultBuilder]: At program point L212(lines 208 223) the Hoare annotation is: (let ((.cse0 (= ~st1~0 1)) (.cse3 (<= ~st2~0 0)) (.cse6 (<= 0 ~st3~0)) (.cse4 (= ~st2~0 1)) (.cse8 (<= ~st1~0 0)) (.cse5 (<= 0 ~st1~0)) (.cse1 (<= 0 ~st2~0)) (.cse2 (= ~st3~0 1)) (.cse9 (+ ~st2~0 ~st1~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 (<= (+ ~st3~0 ~st1~0) 0) .cse6) (let ((.cse7 (+ ~st3~0 ~st2~0 ~st1~0))) (and (<= 0 .cse7) .cse8 (<= .cse7 0) .cse3 (<= 0 .cse9))) (and .cse0 (<= ~st3~0 0) .cse1 .cse3 .cse6) (and .cse4 .cse8 .cse5 .cse2) (and .cse5 .cse1 .cse2 (<= .cse9 0)))) [2022-11-20 10:48:36,470 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 162) no Hoare annotation was computed. [2022-11-20 10:48:36,470 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 120) no Hoare annotation was computed. [2022-11-20 10:48:36,470 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 113 120) no Hoare annotation was computed. [2022-11-20 10:48:36,471 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-20 10:48:36,471 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 69) no Hoare annotation was computed. [2022-11-20 10:48:36,471 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 159) no Hoare annotation was computed. [2022-11-20 10:48:36,471 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2022-11-20 10:48:36,471 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-20 10:48:36,471 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 10:48:36,472 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-20 10:48:36,472 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 156) no Hoare annotation was computed. [2022-11-20 10:48:36,472 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-20 10:48:36,472 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 153) no Hoare annotation was computed. [2022-11-20 10:48:36,472 INFO L895 garLoopResultBuilder]: At program point L199(lines 129 201) the Hoare annotation is: (or (and (= |ULTIMATE.start_init_~tmp~0#1| 0) (= |ULTIMATE.start_init_#res#1| 0)) (and (= (* 256 (div ~mode2~0 256)) ~mode2~0) (= (* 256 (div ~mode1~0 256)) ~mode1~0) (= (* 256 (div ~mode3~0 256)) ~mode3~0) (<= ~st2~0 0) (<= (+ ~st3~0 ~st1~0) 0) (<= ~r1~0 (* (div ~r1~0 256) 256)) (<= 0 (+ ~st2~0 ~st1~0)) (<= 0 ~st3~0))) [2022-11-20 10:48:36,473 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 69) no Hoare annotation was computed. [2022-11-20 10:48:36,473 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2022-11-20 10:48:36,473 INFO L899 garLoopResultBuilder]: For program point L216(line 216) no Hoare annotation was computed. [2022-11-20 10:48:36,473 INFO L899 garLoopResultBuilder]: For program point L216-1(line 216) no Hoare annotation was computed. [2022-11-20 10:48:36,473 INFO L899 garLoopResultBuilder]: For program point L216-2(line 216) no Hoare annotation was computed. [2022-11-20 10:48:36,473 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 119) no Hoare annotation was computed. [2022-11-20 10:48:36,474 INFO L899 garLoopResultBuilder]: For program point L216-3(line 216) no Hoare annotation was computed. [2022-11-20 10:48:36,474 INFO L899 garLoopResultBuilder]: For program point L216-4(lines 216 220) no Hoare annotation was computed. [2022-11-20 10:48:36,474 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 198) no Hoare annotation was computed. [2022-11-20 10:48:36,474 INFO L899 garLoopResultBuilder]: For program point L134-1(lines 134 198) no Hoare annotation was computed. [2022-11-20 10:48:36,478 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 10:48:36,480 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:48:36,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:48:36 BoogieIcfgContainer [2022-11-20 10:48:36,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:48:36,522 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:48:36,522 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:48:36,522 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:48:36,523 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:18" (3/4) ... [2022-11-20 10:48:36,526 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 10:48:36,539 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-20 10:48:36,540 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-20 10:48:36,540 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 10:48:36,541 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 10:48:36,570 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (tmp == 0 && \result == 0) || (((((((256 * (mode2 / 256) == mode2 && 256 * (mode1 / 256) == mode1) && 256 * (mode3 / 256) == mode3) && st2 <= 0) && st3 + st1 <= 0) && r1 <= r1 / 256 * 256) && 0 <= st2 + st1) && 0 <= st3) [2022-11-20 10:48:36,600 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:48:36,600 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:48:36,601 INFO L158 Benchmark]: Toolchain (without parser) took 79486.13ms. Allocated memory was 195.0MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 161.4MB in the beginning and 1.1GB in the end (delta: -909.7MB). Peak memory consumption was 774.1MB. Max. memory is 16.1GB. [2022-11-20 10:48:36,601 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 140.5MB. Free memory was 82.6MB in the beginning and 82.4MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:48:36,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.12ms. Allocated memory is still 195.0MB. Free memory was 161.4MB in the beginning and 148.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 10:48:36,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.66ms. Allocated memory is still 195.0MB. Free memory was 148.6MB in the beginning and 146.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:48:36,602 INFO L158 Benchmark]: Boogie Preprocessor took 80.26ms. Allocated memory is still 195.0MB. Free memory was 146.5MB in the beginning and 144.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:48:36,602 INFO L158 Benchmark]: RCFGBuilder took 734.39ms. Allocated memory is still 195.0MB. Free memory was 144.6MB in the beginning and 124.9MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 10:48:36,603 INFO L158 Benchmark]: TraceAbstraction took 78145.69ms. Allocated memory was 195.0MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 124.2MB in the beginning and 1.1GB in the end (delta: -952.1MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-20 10:48:36,603 INFO L158 Benchmark]: Witness Printer took 78.56ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:48:36,605 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.34ms. Allocated memory is still 140.5MB. Free memory was 82.6MB in the beginning and 82.4MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.12ms. Allocated memory is still 195.0MB. Free memory was 161.4MB in the beginning and 148.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.66ms. Allocated memory is still 195.0MB. Free memory was 148.6MB in the beginning and 146.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.26ms. Allocated memory is still 195.0MB. Free memory was 146.5MB in the beginning and 144.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 734.39ms. Allocated memory is still 195.0MB. Free memory was 144.6MB in the beginning and 124.9MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 78145.69ms. Allocated memory was 195.0MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 124.2MB in the beginning and 1.1GB in the end (delta: -952.1MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 78.56ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: 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, 83 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 78.0s, OverallIterations: 35, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 50.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5058 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5058 mSDsluCounter, 9352 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4799 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3630 IncrementalHoareTripleChecker+Invalid, 3833 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 4553 mSDtfsCounter, 3630 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12529occurred in iteration=23, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 7725 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 870 NumberOfFragments, 746 HoareAnnotationTreeSize, 8 FomulaSimplifications, 13934 FormulaSimplificationTreeSizeReduction, 23.5s HoareSimplificationTime, 8 FomulaSimplificationsInter, 182211 FormulaSimplificationTreeSizeReductionInter, 26.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2122 NumberOfCodeBlocks, 2122 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2087 ConstructedInterpolants, 0 QuantifiedInterpolants, 8209 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 594/594 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: 129]: Loop Invariant Derived loop invariant: (tmp == 0 && \result == 0) || (((((((256 * (mode2 / 256) == mode2 && 256 * (mode1 / 256) == mode1) && 256 * (mode3 / 256) == mode3) && st2 <= 0) && st3 + st1 <= 0) && r1 <= r1 / 256 * 256) && 0 <= st2 + st1) && 0 <= st3) - InvariantResult [Line: 79]: 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: 202]: 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: 259]: 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: 53]: 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: 208]: Loop Invariant Derived loop invariant: (((((((st1 == 1 && 0 <= st2) && st3 == 1) && st2 <= 0) || (((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3)) || ((((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 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || ((((0 <= st3 + st2 + st1 && st1 <= 0) && st3 + st2 + st1 <= 0) && st2 <= 0) && 0 <= st2 + st1)) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) RESULT: Ultimate proved your program to be correct! [2022-11-20 10:48:36,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd3b8c-86f5-4613-81b1-2459aaa29ee6/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