./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:34:56,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:34:56,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:34:56,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:34:56,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:34:56,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:34:56,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:34:56,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:34:56,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:34:56,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:34:56,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:34:56,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:34:56,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:34:56,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:34:56,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:34:56,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:34:56,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:34:56,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:34:56,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:34:56,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:34:56,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:34:56,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:34:56,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:34:56,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:34:56,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:34:56,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:34:56,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:34:56,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:34:56,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:34:56,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:34:56,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:34:56,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:34:56,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:34:56,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:34:56,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:34:56,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:34:56,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:34:56,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:34:56,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:34:56,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:34:56,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:34:56,335 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-25 17:34:56,354 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:34:56,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:34:56,354 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:34:56,354 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:34:56,355 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:34:56,355 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:34:56,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:34:56,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:34:56,356 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:34:56,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:34:56,357 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:34:56,357 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:34:56,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:34:56,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:34:56,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:34:56,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:34:56,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:34:56,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:34:56,358 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 17:34:56,359 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:34:56,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:34:56,359 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:34:56,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:34:56,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:34:56,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:34:56,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:34:56,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:34:56,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:34:56,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:34:56,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:34:56,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:34:56,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:34:56,361 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:34:56,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:34:56,362 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:34:56,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:34:56,362 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f [2022-11-25 17:34:56,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:34:56,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:34:56,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:34:56,639 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:34:56,640 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:34:56,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2022-11-25 17:34:59,707 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:34:59,945 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:34:59,946 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2022-11-25 17:34:59,956 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/data/d9bf88bd1/9a2b745a205943ca8dc0555deede629d/FLAGbc9b4456e [2022-11-25 17:34:59,971 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/data/d9bf88bd1/9a2b745a205943ca8dc0555deede629d [2022-11-25 17:34:59,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:34:59,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:34:59,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:34:59,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:34:59,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:34:59,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:34:59" (1/1) ... [2022-11-25 17:34:59,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1675735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:59, skipping insertion in model container [2022-11-25 17:34:59,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:34:59" (1/1) ... [2022-11-25 17:34:59,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:35:00,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:35:00,289 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_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2022-11-25 17:35:00,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:35:00,305 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:35:00,360 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_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2022-11-25 17:35:00,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:35:00,377 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:35:00,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:35:00 WrapperNode [2022-11-25 17:35:00,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:35:00,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:35:00,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:35:00,379 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:35:00,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:35:00" (1/1) ... [2022-11-25 17:35:00,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:35:00" (1/1) ... [2022-11-25 17:35:00,430 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 525 [2022-11-25 17:35:00,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:35:00,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:35:00,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:35:00,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:35:00,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:35:00" (1/1) ... [2022-11-25 17:35:00,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:35:00" (1/1) ... [2022-11-25 17:35:00,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:35:00" (1/1) ... [2022-11-25 17:35:00,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:35:00" (1/1) ... [2022-11-25 17:35:00,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:35:00" (1/1) ... [2022-11-25 17:35:00,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:35:00" (1/1) ... [2022-11-25 17:35:00,463 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:35:00" (1/1) ... [2022-11-25 17:35:00,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:35:00" (1/1) ... [2022-11-25 17:35:00,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:35:00,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:35:00,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:35:00,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:35:00,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:35:00" (1/1) ... [2022-11-25 17:35:00,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:35:00,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:35:00,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:35:00,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:35:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:35:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:35:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:35:00,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:35:00,671 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:35:00,674 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:35:00,690 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 17:35:01,429 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-11-25 17:35:01,429 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-11-25 17:35:01,429 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:35:01,437 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:35:01,438 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 17:35:01,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:35:01 BoogieIcfgContainer [2022-11-25 17:35:01,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:35:01,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:35:01,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:35:01,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:35:01,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:34:59" (1/3) ... [2022-11-25 17:35:01,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575aad89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:35:01, skipping insertion in model container [2022-11-25 17:35:01,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:35:00" (2/3) ... [2022-11-25 17:35:01,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575aad89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:35:01, skipping insertion in model container [2022-11-25 17:35:01,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:35:01" (3/3) ... [2022-11-25 17:35:01,466 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2022-11-25 17:35:01,503 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:35:01,503 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-25 17:35:01,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:35:01,616 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;@269b0ce2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:35:01,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-25 17:35:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 142 states have (on average 1.732394366197183) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 17:35:01,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:01,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:01,629 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:01,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:01,633 INFO L85 PathProgramCache]: Analyzing trace with hash -580333898, now seen corresponding path program 1 times [2022-11-25 17:35:01,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:01,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269897509] [2022-11-25 17:35:01,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:01,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:35:02,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:02,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269897509] [2022-11-25 17:35:02,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269897509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:02,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:02,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:02,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562311824] [2022-11-25 17:35:02,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:02,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:02,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:02,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:02,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:02,100 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.732394366197183) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 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 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:02,380 INFO L93 Difference]: Finished difference Result 312 states and 520 transitions. [2022-11-25 17:35:02,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:02,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-11-25 17:35:02,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:02,401 INFO L225 Difference]: With dead ends: 312 [2022-11-25 17:35:02,401 INFO L226 Difference]: Without dead ends: 150 [2022-11-25 17:35:02,406 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-25 17:35:02,411 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 205 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:02,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 207 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:35:02,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-25 17:35:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-25 17:35:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 149 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2022-11-25 17:35:02,459 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 18 [2022-11-25 17:35:02,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:02,459 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2022-11-25 17:35:02,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2022-11-25 17:35:02,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 17:35:02,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:02,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:02,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:35:02,461 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:02,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:02,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1061870123, now seen corresponding path program 1 times [2022-11-25 17:35:02,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:02,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983896614] [2022-11-25 17:35:02,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:02,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:35:02,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:02,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983896614] [2022-11-25 17:35:02,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983896614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:02,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:02,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:02,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166815407] [2022-11-25 17:35:02,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:02,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:02,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:02,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:02,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:02,656 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:02,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:02,787 INFO L93 Difference]: Finished difference Result 302 states and 451 transitions. [2022-11-25 17:35:02,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:02,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-11-25 17:35:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:02,790 INFO L225 Difference]: With dead ends: 302 [2022-11-25 17:35:02,790 INFO L226 Difference]: Without dead ends: 160 [2022-11-25 17:35:02,791 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-25 17:35:02,793 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 165 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:02,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 151 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:02,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-25 17:35:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2022-11-25 17:35:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 1.5374149659863945) internal successors, (226), 150 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-25 17:35:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 226 transitions. [2022-11-25 17:35:02,810 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 226 transitions. Word has length 19 [2022-11-25 17:35:02,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:02,811 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 226 transitions. [2022-11-25 17:35:02,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 226 transitions. [2022-11-25 17:35:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 17:35:02,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:02,813 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] [2022-11-25 17:35:02,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:35:02,813 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:02,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:02,814 INFO L85 PathProgramCache]: Analyzing trace with hash 323589326, now seen corresponding path program 1 times [2022-11-25 17:35:02,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:02,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540630575] [2022-11-25 17:35:02,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:02,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:35:02,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:02,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540630575] [2022-11-25 17:35:02,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540630575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:02,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:02,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:02,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257609740] [2022-11-25 17:35:02,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:02,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:02,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:02,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:02,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:02,972 INFO L87 Difference]: Start difference. First operand 151 states and 226 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:03,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:03,120 INFO L93 Difference]: Finished difference Result 304 states and 453 transitions. [2022-11-25 17:35:03,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:03,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-11-25 17:35:03,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:03,125 INFO L225 Difference]: With dead ends: 304 [2022-11-25 17:35:03,126 INFO L226 Difference]: Without dead ends: 161 [2022-11-25 17:35:03,133 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-25 17:35:03,135 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 163 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:03,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 152 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-25 17:35:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2022-11-25 17:35:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 151 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 227 transitions. [2022-11-25 17:35:03,157 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 227 transitions. Word has length 20 [2022-11-25 17:35:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:03,158 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 227 transitions. [2022-11-25 17:35:03,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions. [2022-11-25 17:35:03,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 17:35:03,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:03,161 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] [2022-11-25 17:35:03,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:35:03,161 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:03,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:03,163 INFO L85 PathProgramCache]: Analyzing trace with hash -659408240, now seen corresponding path program 1 times [2022-11-25 17:35:03,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:03,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039519422] [2022-11-25 17:35:03,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:03,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:03,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-25 17:35:03,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:03,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039519422] [2022-11-25 17:35:03,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039519422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:03,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:03,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:03,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643704902] [2022-11-25 17:35:03,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:03,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:03,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:03,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:03,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:03,289 INFO L87 Difference]: Start difference. First operand 152 states and 227 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:03,413 INFO L93 Difference]: Finished difference Result 306 states and 455 transitions. [2022-11-25 17:35:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:03,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-11-25 17:35:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:03,415 INFO L225 Difference]: With dead ends: 306 [2022-11-25 17:35:03,416 INFO L226 Difference]: Without dead ends: 162 [2022-11-25 17:35:03,417 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-25 17:35:03,428 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 161 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:03,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 153 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-25 17:35:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2022-11-25 17:35:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 149 states have (on average 1.5302013422818792) internal successors, (228), 152 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 228 transitions. [2022-11-25 17:35:03,446 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 228 transitions. Word has length 21 [2022-11-25 17:35:03,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:03,446 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 228 transitions. [2022-11-25 17:35:03,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 228 transitions. [2022-11-25 17:35:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 17:35:03,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:03,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:03,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:35:03,455 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:03,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:03,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2050129239, now seen corresponding path program 1 times [2022-11-25 17:35:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:03,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923881289] [2022-11-25 17:35:03,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:03,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:35:03,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:03,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923881289] [2022-11-25 17:35:03,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923881289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:03,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:03,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:03,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379270358] [2022-11-25 17:35:03,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:03,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:03,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:03,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:03,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:03,553 INFO L87 Difference]: Start difference. First operand 153 states and 228 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:03,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:03,695 INFO L93 Difference]: Finished difference Result 308 states and 457 transitions. [2022-11-25 17:35:03,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:03,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-25 17:35:03,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:03,697 INFO L225 Difference]: With dead ends: 308 [2022-11-25 17:35:03,697 INFO L226 Difference]: Without dead ends: 163 [2022-11-25 17:35:03,698 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-25 17:35:03,698 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 159 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:03,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 154 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:03,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-25 17:35:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 154. [2022-11-25 17:35:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 150 states have (on average 1.5266666666666666) internal successors, (229), 153 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 229 transitions. [2022-11-25 17:35:03,729 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 229 transitions. Word has length 22 [2022-11-25 17:35:03,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:03,730 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 229 transitions. [2022-11-25 17:35:03,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 229 transitions. [2022-11-25 17:35:03,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 17:35:03,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:03,739 INFO L195 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:03,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:35:03,740 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:03,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:03,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1990190120, now seen corresponding path program 1 times [2022-11-25 17:35:03,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:03,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085283955] [2022-11-25 17:35:03,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:03,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:03,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:35:03,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:03,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085283955] [2022-11-25 17:35:03,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085283955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:03,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:03,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:03,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205223407] [2022-11-25 17:35:03,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:03,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:03,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:03,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:03,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:03,861 INFO L87 Difference]: Start difference. First operand 154 states and 229 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:04,024 INFO L93 Difference]: Finished difference Result 331 states and 499 transitions. [2022-11-25 17:35:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:04,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2022-11-25 17:35:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:04,027 INFO L225 Difference]: With dead ends: 331 [2022-11-25 17:35:04,027 INFO L226 Difference]: Without dead ends: 185 [2022-11-25 17:35:04,028 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-25 17:35:04,029 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 134 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:04,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 165 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-25 17:35:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-11-25 17:35:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 181 states have (on average 1.5524861878453038) internal successors, (281), 184 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:04,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 281 transitions. [2022-11-25 17:35:04,053 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 281 transitions. Word has length 47 [2022-11-25 17:35:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:04,054 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 281 transitions. [2022-11-25 17:35:04,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 281 transitions. [2022-11-25 17:35:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-25 17:35:04,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:04,062 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:04,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:35:04,062 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:04,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:04,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1367947310, now seen corresponding path program 1 times [2022-11-25 17:35:04,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:04,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987846887] [2022-11-25 17:35:04,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:04,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:35:04,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:04,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987846887] [2022-11-25 17:35:04,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987846887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:04,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:04,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:04,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764437539] [2022-11-25 17:35:04,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:04,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:04,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:04,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:04,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:04,201 INFO L87 Difference]: Start difference. First operand 185 states and 281 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:04,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:04,323 INFO L93 Difference]: Finished difference Result 380 states and 575 transitions. [2022-11-25 17:35:04,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:04,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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-25 17:35:04,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:04,325 INFO L225 Difference]: With dead ends: 380 [2022-11-25 17:35:04,325 INFO L226 Difference]: Without dead ends: 203 [2022-11-25 17:35:04,325 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-25 17:35:04,326 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 157 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:04,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 147 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:04,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-25 17:35:04,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2022-11-25 17:35:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.532994923857868) internal successors, (302), 200 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 302 transitions. [2022-11-25 17:35:04,337 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 302 transitions. Word has length 59 [2022-11-25 17:35:04,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:04,338 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 302 transitions. [2022-11-25 17:35:04,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:04,338 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 302 transitions. [2022-11-25 17:35:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 17:35:04,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:04,339 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-25 17:35:04,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:35:04,339 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:04,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2136164213, now seen corresponding path program 1 times [2022-11-25 17:35:04,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:04,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813084735] [2022-11-25 17:35:04,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:35:04,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:04,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813084735] [2022-11-25 17:35:04,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813084735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:04,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:04,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:04,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316137562] [2022-11-25 17:35:04,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:04,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:04,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:04,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:04,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:04,456 INFO L87 Difference]: Start difference. First operand 201 states and 302 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-25 17:35:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:04,585 INFO L93 Difference]: Finished difference Result 397 states and 596 transitions. [2022-11-25 17:35:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:04,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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 60 [2022-11-25 17:35:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:04,586 INFO L225 Difference]: With dead ends: 397 [2022-11-25 17:35:04,587 INFO L226 Difference]: Without dead ends: 204 [2022-11-25 17:35:04,587 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-25 17:35:04,588 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 155 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:04,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 148 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-25 17:35:04,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2022-11-25 17:35:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.5252525252525253) internal successors, (302), 201 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 302 transitions. [2022-11-25 17:35:04,601 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 302 transitions. Word has length 60 [2022-11-25 17:35:04,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:04,601 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 302 transitions. [2022-11-25 17:35:04,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-25 17:35:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 302 transitions. [2022-11-25 17:35:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 17:35:04,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:04,602 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:04,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:35:04,603 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash -956503025, now seen corresponding path program 1 times [2022-11-25 17:35:04,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:04,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197762540] [2022-11-25 17:35:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:04,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:35:04,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:04,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197762540] [2022-11-25 17:35:04,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197762540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:04,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:04,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:04,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341240178] [2022-11-25 17:35:04,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:04,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:04,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:04,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:04,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:04,684 INFO L87 Difference]: Start difference. First operand 202 states and 302 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:04,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:04,813 INFO L93 Difference]: Finished difference Result 440 states and 667 transitions. [2022-11-25 17:35:04,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:04,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-11-25 17:35:04,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:04,815 INFO L225 Difference]: With dead ends: 440 [2022-11-25 17:35:04,815 INFO L226 Difference]: Without dead ends: 246 [2022-11-25 17:35:04,815 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-25 17:35:04,818 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 141 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:04,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 149 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-25 17:35:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2022-11-25 17:35:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 240 states have (on average 1.5541666666666667) internal successors, (373), 243 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 373 transitions. [2022-11-25 17:35:04,838 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 373 transitions. Word has length 73 [2022-11-25 17:35:04,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:04,839 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 373 transitions. [2022-11-25 17:35:04,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 373 transitions. [2022-11-25 17:35:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 17:35:04,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:04,841 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:04,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:35:04,841 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:04,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:04,842 INFO L85 PathProgramCache]: Analyzing trace with hash 603125704, now seen corresponding path program 1 times [2022-11-25 17:35:04,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:04,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243934067] [2022-11-25 17:35:04,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:04,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:35:04,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:04,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243934067] [2022-11-25 17:35:04,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243934067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:04,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:04,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:04,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288750249] [2022-11-25 17:35:04,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:04,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:04,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:04,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:04,932 INFO L87 Difference]: Start difference. First operand 244 states and 373 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:05,081 INFO L93 Difference]: Finished difference Result 514 states and 789 transitions. [2022-11-25 17:35:05,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:05,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-11-25 17:35:05,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:05,083 INFO L225 Difference]: With dead ends: 514 [2022-11-25 17:35:05,083 INFO L226 Difference]: Without dead ends: 278 [2022-11-25 17:35:05,084 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-25 17:35:05,084 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 143 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:05,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 156 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:05,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-25 17:35:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 271. [2022-11-25 17:35:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 267 states have (on average 1.546816479400749) internal successors, (413), 270 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 413 transitions. [2022-11-25 17:35:05,104 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 413 transitions. Word has length 74 [2022-11-25 17:35:05,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:05,106 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 413 transitions. [2022-11-25 17:35:05,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 413 transitions. [2022-11-25 17:35:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 17:35:05,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:05,108 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:05,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:35:05,108 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:05,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:05,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1649015640, now seen corresponding path program 1 times [2022-11-25 17:35:05,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:05,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149301493] [2022-11-25 17:35:05,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:05,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:35:05,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:05,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149301493] [2022-11-25 17:35:05,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149301493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:05,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:05,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:05,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599773920] [2022-11-25 17:35:05,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:05,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:05,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:05,205 INFO L87 Difference]: Start difference. First operand 271 states and 413 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:05,336 INFO L93 Difference]: Finished difference Result 537 states and 818 transitions. [2022-11-25 17:35:05,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:05,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-11-25 17:35:05,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:05,339 INFO L225 Difference]: With dead ends: 537 [2022-11-25 17:35:05,339 INFO L226 Difference]: Without dead ends: 274 [2022-11-25 17:35:05,339 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-25 17:35:05,341 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:05,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 149 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:05,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-25 17:35:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2022-11-25 17:35:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 268 states have (on average 1.541044776119403) internal successors, (413), 271 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 413 transitions. [2022-11-25 17:35:05,358 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 413 transitions. Word has length 74 [2022-11-25 17:35:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:05,359 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 413 transitions. [2022-11-25 17:35:05,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:05,359 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 413 transitions. [2022-11-25 17:35:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-25 17:35:05,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:05,360 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:05,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:35:05,361 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:05,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:05,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1207629393, now seen corresponding path program 1 times [2022-11-25 17:35:05,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:05,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321492943] [2022-11-25 17:35:05,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:05,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:35:05,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:05,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321492943] [2022-11-25 17:35:05,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321492943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:05,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:05,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:05,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137149244] [2022-11-25 17:35:05,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:05,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:05,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:05,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:05,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:05,446 INFO L87 Difference]: Start difference. First operand 272 states and 413 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:05,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:05,585 INFO L93 Difference]: Finished difference Result 543 states and 826 transitions. [2022-11-25 17:35:05,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:05,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-11-25 17:35:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:05,588 INFO L225 Difference]: With dead ends: 543 [2022-11-25 17:35:05,588 INFO L226 Difference]: Without dead ends: 279 [2022-11-25 17:35:05,589 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-25 17:35:05,590 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 142 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:05,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 156 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:05,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-25 17:35:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2022-11-25 17:35:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 268 states have (on average 1.5298507462686568) internal successors, (410), 271 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 410 transitions. [2022-11-25 17:35:05,609 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 410 transitions. Word has length 75 [2022-11-25 17:35:05,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:05,609 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 410 transitions. [2022-11-25 17:35:05,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:05,610 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 410 transitions. [2022-11-25 17:35:05,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-25 17:35:05,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:05,611 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:05,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:35:05,611 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:05,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:05,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1576887455, now seen corresponding path program 1 times [2022-11-25 17:35:05,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:05,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616992193] [2022-11-25 17:35:05,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:35:05,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:05,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616992193] [2022-11-25 17:35:05,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616992193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:05,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:05,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:05,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859040187] [2022-11-25 17:35:05,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:05,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:05,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:05,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:05,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:05,694 INFO L87 Difference]: Start difference. First operand 272 states and 410 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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-25 17:35:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:05,863 INFO L93 Difference]: Finished difference Result 583 states and 882 transitions. [2022-11-25 17:35:05,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:05,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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 90 [2022-11-25 17:35:05,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:05,867 INFO L225 Difference]: With dead ends: 583 [2022-11-25 17:35:05,867 INFO L226 Difference]: Without dead ends: 319 [2022-11-25 17:35:05,868 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-25 17:35:05,868 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 125 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:05,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 154 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-25 17:35:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2022-11-25 17:35:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 311 states have (on average 1.540192926045016) internal successors, (479), 314 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 479 transitions. [2022-11-25 17:35:05,891 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 479 transitions. Word has length 90 [2022-11-25 17:35:05,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:05,893 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 479 transitions. [2022-11-25 17:35:05,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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-25 17:35:05,893 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 479 transitions. [2022-11-25 17:35:05,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-25 17:35:05,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:05,894 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:05,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:35:05,895 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:05,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:05,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1659002301, now seen corresponding path program 1 times [2022-11-25 17:35:05,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:05,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982778747] [2022-11-25 17:35:05,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:05,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:35:05,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:05,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982778747] [2022-11-25 17:35:05,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982778747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:05,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:05,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:05,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177102805] [2022-11-25 17:35:05,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:05,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:05,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:05,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:05,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:05,979 INFO L87 Difference]: Start difference. First operand 315 states and 479 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:06,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:06,146 INFO L93 Difference]: Finished difference Result 638 states and 973 transitions. [2022-11-25 17:35:06,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:06,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-25 17:35:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:06,148 INFO L225 Difference]: With dead ends: 638 [2022-11-25 17:35:06,148 INFO L226 Difference]: Without dead ends: 329 [2022-11-25 17:35:06,149 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-25 17:35:06,149 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 125 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:06,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 153 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:06,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-11-25 17:35:06,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 325. [2022-11-25 17:35:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 321 states have (on average 1.5514018691588785) internal successors, (498), 324 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 498 transitions. [2022-11-25 17:35:06,172 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 498 transitions. Word has length 91 [2022-11-25 17:35:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:06,172 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 498 transitions. [2022-11-25 17:35:06,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 498 transitions. [2022-11-25 17:35:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-25 17:35:06,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:06,174 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 17:35:06,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:35:06,174 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:06,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:06,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1994556924, now seen corresponding path program 1 times [2022-11-25 17:35:06,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:06,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070944289] [2022-11-25 17:35:06,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:06,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-25 17:35:06,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:06,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070944289] [2022-11-25 17:35:06,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070944289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:06,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:06,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:06,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333060186] [2022-11-25 17:35:06,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:06,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:06,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:06,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:06,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:06,287 INFO L87 Difference]: Start difference. First operand 325 states and 498 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:06,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:06,422 INFO L93 Difference]: Finished difference Result 679 states and 1043 transitions. [2022-11-25 17:35:06,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:06,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 100 [2022-11-25 17:35:06,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:06,424 INFO L225 Difference]: With dead ends: 679 [2022-11-25 17:35:06,425 INFO L226 Difference]: Without dead ends: 362 [2022-11-25 17:35:06,425 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-25 17:35:06,426 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 145 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:06,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 167 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:06,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-11-25 17:35:06,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 350. [2022-11-25 17:35:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 346 states have (on average 1.5375722543352601) internal successors, (532), 349 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 532 transitions. [2022-11-25 17:35:06,450 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 532 transitions. Word has length 100 [2022-11-25 17:35:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:06,451 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 532 transitions. [2022-11-25 17:35:06,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 532 transitions. [2022-11-25 17:35:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-25 17:35:06,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:06,453 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 17:35:06,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:35:06,453 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:06,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:06,454 INFO L85 PathProgramCache]: Analyzing trace with hash 98352259, now seen corresponding path program 1 times [2022-11-25 17:35:06,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:06,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999528752] [2022-11-25 17:35:06,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:06,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-25 17:35:06,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:06,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999528752] [2022-11-25 17:35:06,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999528752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:06,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:06,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:06,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424959074] [2022-11-25 17:35:06,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:06,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:06,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:06,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:06,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:06,541 INFO L87 Difference]: Start difference. First operand 350 states and 532 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:06,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:06,675 INFO L93 Difference]: Finished difference Result 704 states and 1072 transitions. [2022-11-25 17:35:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:06,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-11-25 17:35:06,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:06,677 INFO L225 Difference]: With dead ends: 704 [2022-11-25 17:35:06,677 INFO L226 Difference]: Without dead ends: 362 [2022-11-25 17:35:06,678 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-25 17:35:06,679 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 144 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:06,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 167 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:06,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-11-25 17:35:06,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 350. [2022-11-25 17:35:06,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 346 states have (on average 1.523121387283237) internal successors, (527), 349 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 527 transitions. [2022-11-25 17:35:06,703 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 527 transitions. Word has length 101 [2022-11-25 17:35:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:06,704 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 527 transitions. [2022-11-25 17:35:06,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 527 transitions. [2022-11-25 17:35:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-25 17:35:06,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:06,706 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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-25 17:35:06,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:35:06,706 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:06,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:06,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1920296106, now seen corresponding path program 1 times [2022-11-25 17:35:06,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:06,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010087607] [2022-11-25 17:35:06,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:06,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-25 17:35:06,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:06,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010087607] [2022-11-25 17:35:06,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010087607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:06,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:06,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:06,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135986501] [2022-11-25 17:35:06,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:06,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:06,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:06,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:06,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:06,806 INFO L87 Difference]: Start difference. First operand 350 states and 527 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:06,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:06,955 INFO L93 Difference]: Finished difference Result 719 states and 1082 transitions. [2022-11-25 17:35:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:06,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 120 [2022-11-25 17:35:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:06,957 INFO L225 Difference]: With dead ends: 719 [2022-11-25 17:35:06,957 INFO L226 Difference]: Without dead ends: 377 [2022-11-25 17:35:06,958 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-25 17:35:06,958 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 147 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:06,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 152 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-25 17:35:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 374. [2022-11-25 17:35:06,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 370 states have (on average 1.5054054054054054) internal successors, (557), 373 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 557 transitions. [2022-11-25 17:35:06,985 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 557 transitions. Word has length 120 [2022-11-25 17:35:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:06,986 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 557 transitions. [2022-11-25 17:35:06,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 557 transitions. [2022-11-25 17:35:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-25 17:35:06,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:06,988 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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-25 17:35:06,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 17:35:06,988 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:06,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:06,989 INFO L85 PathProgramCache]: Analyzing trace with hash -698248943, now seen corresponding path program 1 times [2022-11-25 17:35:06,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:06,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047890230] [2022-11-25 17:35:06,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:06,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-25 17:35:07,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:07,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047890230] [2022-11-25 17:35:07,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047890230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:07,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:07,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:07,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017808102] [2022-11-25 17:35:07,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:07,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:07,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:07,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:07,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:07,090 INFO L87 Difference]: Start difference. First operand 374 states and 557 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:07,224 INFO L93 Difference]: Finished difference Result 743 states and 1106 transitions. [2022-11-25 17:35:07,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:07,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 121 [2022-11-25 17:35:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:07,227 INFO L225 Difference]: With dead ends: 743 [2022-11-25 17:35:07,227 INFO L226 Difference]: Without dead ends: 377 [2022-11-25 17:35:07,228 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-25 17:35:07,229 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 146 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:07,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 151 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:07,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-25 17:35:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 374. [2022-11-25 17:35:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 370 states have (on average 1.4891891891891893) internal successors, (551), 373 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 551 transitions. [2022-11-25 17:35:07,256 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 551 transitions. Word has length 121 [2022-11-25 17:35:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:07,257 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 551 transitions. [2022-11-25 17:35:07,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 551 transitions. [2022-11-25 17:35:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-25 17:35:07,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:07,259 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 17:35:07,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 17:35:07,259 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:07,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:07,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1095545664, now seen corresponding path program 1 times [2022-11-25 17:35:07,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:07,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770512886] [2022-11-25 17:35:07,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:07,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-25 17:35:07,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:07,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770512886] [2022-11-25 17:35:07,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770512886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:07,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:07,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:07,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736038041] [2022-11-25 17:35:07,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:07,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:07,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:07,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:07,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:07,371 INFO L87 Difference]: Start difference. First operand 374 states and 551 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:07,553 INFO L93 Difference]: Finished difference Result 785 states and 1156 transitions. [2022-11-25 17:35:07,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:07,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 130 [2022-11-25 17:35:07,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:07,556 INFO L225 Difference]: With dead ends: 785 [2022-11-25 17:35:07,556 INFO L226 Difference]: Without dead ends: 419 [2022-11-25 17:35:07,556 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-25 17:35:07,557 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 126 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:07,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 159 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:07,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-11-25 17:35:07,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2022-11-25 17:35:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 411 states have (on average 1.4841849148418491) internal successors, (610), 414 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 610 transitions. [2022-11-25 17:35:07,588 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 610 transitions. Word has length 130 [2022-11-25 17:35:07,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:07,588 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 610 transitions. [2022-11-25 17:35:07,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:07,589 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 610 transitions. [2022-11-25 17:35:07,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-25 17:35:07,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:07,591 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 17:35:07,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 17:35:07,592 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:07,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:07,592 INFO L85 PathProgramCache]: Analyzing trace with hash 850220610, now seen corresponding path program 1 times [2022-11-25 17:35:07,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:07,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064578076] [2022-11-25 17:35:07,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:07,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:07,714 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-25 17:35:07,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:07,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064578076] [2022-11-25 17:35:07,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064578076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:07,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:07,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:07,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127253956] [2022-11-25 17:35:07,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:07,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:07,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:07,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:07,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:07,717 INFO L87 Difference]: Start difference. First operand 415 states and 610 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 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-25 17:35:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:07,893 INFO L93 Difference]: Finished difference Result 826 states and 1213 transitions. [2022-11-25 17:35:07,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:07,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 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 131 [2022-11-25 17:35:07,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:07,896 INFO L225 Difference]: With dead ends: 826 [2022-11-25 17:35:07,896 INFO L226 Difference]: Without dead ends: 417 [2022-11-25 17:35:07,897 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-25 17:35:07,898 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 125 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:07,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 156 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:07,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-11-25 17:35:07,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 413. [2022-11-25 17:35:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 409 states have (on average 1.4792176039119804) internal successors, (605), 412 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 605 transitions. [2022-11-25 17:35:07,935 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 605 transitions. Word has length 131 [2022-11-25 17:35:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:07,936 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 605 transitions. [2022-11-25 17:35:07,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 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-25 17:35:07,936 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 605 transitions. [2022-11-25 17:35:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-25 17:35:07,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:07,938 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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-25 17:35:07,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 17:35:07,939 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:07,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:07,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1977670215, now seen corresponding path program 1 times [2022-11-25 17:35:07,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:07,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828128970] [2022-11-25 17:35:07,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:07,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-11-25 17:35:08,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:08,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828128970] [2022-11-25 17:35:08,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828128970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:08,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:08,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:08,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859849964] [2022-11-25 17:35:08,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:08,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:08,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:08,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:08,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:08,052 INFO L87 Difference]: Start difference. First operand 413 states and 605 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-25 17:35:08,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:08,194 INFO L93 Difference]: Finished difference Result 843 states and 1235 transitions. [2022-11-25 17:35:08,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:08,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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 141 [2022-11-25 17:35:08,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:08,197 INFO L225 Difference]: With dead ends: 843 [2022-11-25 17:35:08,197 INFO L226 Difference]: Without dead ends: 438 [2022-11-25 17:35:08,200 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-25 17:35:08,201 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 149 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:08,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 152 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-11-25 17:35:08,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434. [2022-11-25 17:35:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 430 states have (on average 1.4604651162790698) internal successors, (628), 433 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 628 transitions. [2022-11-25 17:35:08,238 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 628 transitions. Word has length 141 [2022-11-25 17:35:08,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:08,238 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 628 transitions. [2022-11-25 17:35:08,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-25 17:35:08,239 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 628 transitions. [2022-11-25 17:35:08,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-25 17:35:08,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:08,241 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 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-25 17:35:08,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 17:35:08,241 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:08,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:08,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2018786222, now seen corresponding path program 1 times [2022-11-25 17:35:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:08,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130854716] [2022-11-25 17:35:08,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:08,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-11-25 17:35:08,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:08,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130854716] [2022-11-25 17:35:08,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130854716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:08,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:08,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:08,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396743347] [2022-11-25 17:35:08,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:08,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:08,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:08,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:08,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:08,353 INFO L87 Difference]: Start difference. First operand 434 states and 628 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:08,502 INFO L93 Difference]: Finished difference Result 864 states and 1250 transitions. [2022-11-25 17:35:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:08,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 142 [2022-11-25 17:35:08,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:08,505 INFO L225 Difference]: With dead ends: 864 [2022-11-25 17:35:08,505 INFO L226 Difference]: Without dead ends: 438 [2022-11-25 17:35:08,506 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-25 17:35:08,506 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 148 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:08,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 152 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-11-25 17:35:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434. [2022-11-25 17:35:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 430 states have (on average 1.441860465116279) internal successors, (620), 433 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 620 transitions. [2022-11-25 17:35:08,553 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 620 transitions. Word has length 142 [2022-11-25 17:35:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:08,553 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 620 transitions. [2022-11-25 17:35:08,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 620 transitions. [2022-11-25 17:35:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-25 17:35:08,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:08,556 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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-25 17:35:08,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 17:35:08,556 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:08,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:08,557 INFO L85 PathProgramCache]: Analyzing trace with hash -136164042, now seen corresponding path program 1 times [2022-11-25 17:35:08,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:08,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416084909] [2022-11-25 17:35:08,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:08,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:08,633 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-25 17:35:08,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:08,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416084909] [2022-11-25 17:35:08,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416084909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:08,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:08,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:08,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884348611] [2022-11-25 17:35:08,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:08,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:08,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:08,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:08,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:08,636 INFO L87 Difference]: Start difference. First operand 434 states and 620 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:08,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:08,707 INFO L93 Difference]: Finished difference Result 1280 states and 1824 transitions. [2022-11-25 17:35:08,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:08,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-11-25 17:35:08,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:08,711 INFO L225 Difference]: With dead ends: 1280 [2022-11-25 17:35:08,711 INFO L226 Difference]: Without dead ends: 854 [2022-11-25 17:35:08,712 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-25 17:35:08,713 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 173 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:08,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 505 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:35:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-11-25 17:35:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 435. [2022-11-25 17:35:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 431 states have (on average 1.4408352668213458) internal successors, (621), 434 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 621 transitions. [2022-11-25 17:35:08,752 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 621 transitions. Word has length 157 [2022-11-25 17:35:08,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:08,752 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 621 transitions. [2022-11-25 17:35:08,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 621 transitions. [2022-11-25 17:35:08,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-25 17:35:08,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:08,755 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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-25 17:35:08,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 17:35:08,755 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash -877621738, now seen corresponding path program 1 times [2022-11-25 17:35:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:08,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77245170] [2022-11-25 17:35:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:08,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-25 17:35:08,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:08,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77245170] [2022-11-25 17:35:08,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77245170] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:35:08,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469798541] [2022-11-25 17:35:08,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:08,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:35:08,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:35:08,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:35:08,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:35:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:08,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:35:08,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:35:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-25 17:35:09,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:35:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-25 17:35:09,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469798541] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:35:09,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:35:09,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-25 17:35:09,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932233033] [2022-11-25 17:35:09,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:35:09,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:35:09,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:09,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:35:09,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:35:09,192 INFO L87 Difference]: Start difference. First operand 435 states and 621 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:09,791 INFO L93 Difference]: Finished difference Result 1667 states and 2372 transitions. [2022-11-25 17:35:09,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:35:09,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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 157 [2022-11-25 17:35:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:09,796 INFO L225 Difference]: With dead ends: 1667 [2022-11-25 17:35:09,797 INFO L226 Difference]: Without dead ends: 1208 [2022-11-25 17:35:09,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:35:09,798 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 581 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:09,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 585 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:35:09,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2022-11-25 17:35:09,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 505. [2022-11-25 17:35:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 503 states have (on average 1.4353876739562623) internal successors, (722), 504 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 722 transitions. [2022-11-25 17:35:09,851 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 722 transitions. Word has length 157 [2022-11-25 17:35:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:09,852 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 722 transitions. [2022-11-25 17:35:09,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 722 transitions. [2022-11-25 17:35:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-25 17:35:09,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:09,855 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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-25 17:35:09,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:35:10,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-25 17:35:10,061 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:10,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1902183378, now seen corresponding path program 1 times [2022-11-25 17:35:10,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:10,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507388341] [2022-11-25 17:35:10,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:10,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-25 17:35:10,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:10,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507388341] [2022-11-25 17:35:10,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507388341] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:35:10,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808718331] [2022-11-25 17:35:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:10,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:35:10,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:35:10,151 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:35:10,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:35:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:10,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:35:10,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:35:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-25 17:35:10,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:35:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-25 17:35:10,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808718331] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:35:10,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:35:10,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-25 17:35:10,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704465280] [2022-11-25 17:35:10,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:35:10,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:35:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:35:10,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:35:10,411 INFO L87 Difference]: Start difference. First operand 505 states and 722 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:11,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:11,169 INFO L93 Difference]: Finished difference Result 1929 states and 2722 transitions. [2022-11-25 17:35:11,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:35:11,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 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 159 [2022-11-25 17:35:11,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:11,175 INFO L225 Difference]: With dead ends: 1929 [2022-11-25 17:35:11,175 INFO L226 Difference]: Without dead ends: 1432 [2022-11-25 17:35:11,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:35:11,176 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 482 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:11,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 945 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:35:11,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2022-11-25 17:35:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 625. [2022-11-25 17:35:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 623 states have (on average 1.3804173354735152) internal successors, (860), 624 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 860 transitions. [2022-11-25 17:35:11,230 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 860 transitions. Word has length 159 [2022-11-25 17:35:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:11,231 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 860 transitions. [2022-11-25 17:35:11,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 860 transitions. [2022-11-25 17:35:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-25 17:35:11,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:11,234 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2022-11-25 17:35:11,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:35:11,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-25 17:35:11,439 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:11,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:11,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2140887848, now seen corresponding path program 1 times [2022-11-25 17:35:11,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:11,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758578207] [2022-11-25 17:35:11,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:11,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-25 17:35:11,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:11,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758578207] [2022-11-25 17:35:11,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758578207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:11,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:11,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:11,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044831431] [2022-11-25 17:35:11,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:11,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:11,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:11,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:11,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:11,499 INFO L87 Difference]: Start difference. First operand 625 states and 860 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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-25 17:35:11,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:11,578 INFO L93 Difference]: Finished difference Result 1446 states and 1977 transitions. [2022-11-25 17:35:11,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:11,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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) Word has length 169 [2022-11-25 17:35:11,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:11,581 INFO L225 Difference]: With dead ends: 1446 [2022-11-25 17:35:11,581 INFO L226 Difference]: Without dead ends: 544 [2022-11-25 17:35:11,582 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-25 17:35:11,583 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 58 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:11,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 455 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:35:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-11-25 17:35:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2022-11-25 17:35:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 542 states have (on average 1.381918819188192) internal successors, (749), 543 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 749 transitions. [2022-11-25 17:35:11,631 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 749 transitions. Word has length 169 [2022-11-25 17:35:11,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:11,631 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 749 transitions. [2022-11-25 17:35:11,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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-25 17:35:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 749 transitions. [2022-11-25 17:35:11,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-11-25 17:35:11,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:11,635 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 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-25 17:35:11,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 17:35:11,636 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:11,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:11,636 INFO L85 PathProgramCache]: Analyzing trace with hash -873338986, now seen corresponding path program 1 times [2022-11-25 17:35:11,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:11,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018578378] [2022-11-25 17:35:11,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:11,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-11-25 17:35:11,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:11,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018578378] [2022-11-25 17:35:11,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018578378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:11,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:11,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:11,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822533839] [2022-11-25 17:35:11,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:11,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:11,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:11,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:11,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:11,776 INFO L87 Difference]: Start difference. First operand 544 states and 749 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:11,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:11,939 INFO L93 Difference]: Finished difference Result 1098 states and 1507 transitions. [2022-11-25 17:35:11,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:11,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 201 [2022-11-25 17:35:11,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:11,942 INFO L225 Difference]: With dead ends: 1098 [2022-11-25 17:35:11,942 INFO L226 Difference]: Without dead ends: 550 [2022-11-25 17:35:11,943 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-25 17:35:11,944 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 124 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:11,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 150 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-11-25 17:35:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 546. [2022-11-25 17:35:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 544 states have (on average 1.3621323529411764) internal successors, (741), 545 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 741 transitions. [2022-11-25 17:35:11,987 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 741 transitions. Word has length 201 [2022-11-25 17:35:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:11,987 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 741 transitions. [2022-11-25 17:35:11,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 741 transitions. [2022-11-25 17:35:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2022-11-25 17:35:11,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:11,993 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:11,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 17:35:11,994 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:11,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash 840195126, now seen corresponding path program 1 times [2022-11-25 17:35:11,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:11,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200590557] [2022-11-25 17:35:11,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2022-11-25 17:35:12,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:12,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200590557] [2022-11-25 17:35:12,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200590557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:12,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:12,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:12,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164942542] [2022-11-25 17:35:12,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:12,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:12,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:12,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:12,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:12,102 INFO L87 Difference]: Start difference. First operand 546 states and 741 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:12,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:12,256 INFO L93 Difference]: Finished difference Result 1120 states and 1513 transitions. [2022-11-25 17:35:12,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:12,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 340 [2022-11-25 17:35:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:12,259 INFO L225 Difference]: With dead ends: 1120 [2022-11-25 17:35:12,259 INFO L226 Difference]: Without dead ends: 582 [2022-11-25 17:35:12,261 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-25 17:35:12,261 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:12,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 292 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:12,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-11-25 17:35:12,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2022-11-25 17:35:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 578 states have (on average 1.3494809688581315) internal successors, (780), 579 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 780 transitions. [2022-11-25 17:35:12,305 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 780 transitions. Word has length 340 [2022-11-25 17:35:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:12,306 INFO L495 AbstractCegarLoop]: Abstraction has 580 states and 780 transitions. [2022-11-25 17:35:12,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 780 transitions. [2022-11-25 17:35:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2022-11-25 17:35:12,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:12,312 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:12,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 17:35:12,313 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:12,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash 299615116, now seen corresponding path program 1 times [2022-11-25 17:35:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:12,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081250823] [2022-11-25 17:35:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:12,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2022-11-25 17:35:12,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:12,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081250823] [2022-11-25 17:35:12,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081250823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:12,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:12,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:12,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577655790] [2022-11-25 17:35:12,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:12,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:12,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:12,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:12,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:12,426 INFO L87 Difference]: Start difference. First operand 580 states and 780 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:12,600 INFO L93 Difference]: Finished difference Result 1190 states and 1595 transitions. [2022-11-25 17:35:12,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:12,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 371 [2022-11-25 17:35:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:12,603 INFO L225 Difference]: With dead ends: 1190 [2022-11-25 17:35:12,603 INFO L226 Difference]: Without dead ends: 618 [2022-11-25 17:35:12,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:12,605 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:12,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 292 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:35:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-11-25 17:35:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 616. [2022-11-25 17:35:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 614 states have (on average 1.3371335504885993) internal successors, (821), 615 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 821 transitions. [2022-11-25 17:35:12,648 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 821 transitions. Word has length 371 [2022-11-25 17:35:12,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:12,648 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 821 transitions. [2022-11-25 17:35:12,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:12,649 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 821 transitions. [2022-11-25 17:35:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2022-11-25 17:35:12,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:12,656 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:12,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 17:35:12,657 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:12,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:12,657 INFO L85 PathProgramCache]: Analyzing trace with hash 521510171, now seen corresponding path program 1 times [2022-11-25 17:35:12,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:12,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355931901] [2022-11-25 17:35:12,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:12,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 970 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2022-11-25 17:35:12,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:12,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355931901] [2022-11-25 17:35:12,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355931901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:12,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:12,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:35:12,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782082117] [2022-11-25 17:35:12,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:12,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:12,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:12,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:12,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:12,813 INFO L87 Difference]: Start difference. First operand 616 states and 821 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:12,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:12,904 INFO L93 Difference]: Finished difference Result 1635 states and 2161 transitions. [2022-11-25 17:35:12,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:12,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 404 [2022-11-25 17:35:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:12,909 INFO L225 Difference]: With dead ends: 1635 [2022-11-25 17:35:12,909 INFO L226 Difference]: Without dead ends: 1027 [2022-11-25 17:35:12,910 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-25 17:35:12,911 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 63 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:12,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 391 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:35:12,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-11-25 17:35:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1027. [2022-11-25 17:35:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1025 states have (on average 1.3151219512195123) internal successors, (1348), 1026 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1348 transitions. [2022-11-25 17:35:13,017 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1348 transitions. Word has length 404 [2022-11-25 17:35:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:13,018 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1348 transitions. [2022-11-25 17:35:13,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1348 transitions. [2022-11-25 17:35:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2022-11-25 17:35:13,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:35:13,028 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:13,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-25 17:35:13,029 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 17:35:13,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:13,030 INFO L85 PathProgramCache]: Analyzing trace with hash 810329561, now seen corresponding path program 1 times [2022-11-25 17:35:13,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:35:13,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733468217] [2022-11-25 17:35:13,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:13,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:35:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-11-25 17:35:13,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:35:13,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733468217] [2022-11-25 17:35:13,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733468217] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:35:13,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465731286] [2022-11-25 17:35:13,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:13,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:35:13,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:35:13,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:35:13,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:35:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:13,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:35:13,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:35:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-11-25 17:35:13,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:35:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-11-25 17:35:13,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465731286] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:35:13,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:35:13,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-11-25 17:35:13,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058278376] [2022-11-25 17:35:13,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:35:13,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:35:13,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:35:13,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:35:13,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:35:13,602 INFO L87 Difference]: Start difference. First operand 1027 states and 1348 transitions. Second operand has 8 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:35:14,002 INFO L93 Difference]: Finished difference Result 2364 states and 3119 transitions. [2022-11-25 17:35:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:35:14,012 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 0 states have call successors, (0), 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 404 [2022-11-25 17:35:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:35:14,020 INFO L225 Difference]: With dead ends: 2364 [2022-11-25 17:35:14,020 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 17:35:14,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:35:14,023 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 99 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:35:14,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 988 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:35:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 17:35:14,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 17:35:14,026 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-25 17:35:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 17:35:14,026 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 404 [2022-11-25 17:35:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:35:14,026 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 17:35:14,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:35:14,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 17:35:14,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 17:35:14,030 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-25 17:35:14,032 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-25 17:35:14,032 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-25 17:35:14,032 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-25 17:35:14,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:35:14,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:35:14,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 17:35:27,749 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 270) no Hoare annotation was computed. [2022-11-25 17:35:27,750 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 469) no Hoare annotation was computed. [2022-11-25 17:35:27,750 INFO L899 garLoopResultBuilder]: For program point L268(line 268) no Hoare annotation was computed. [2022-11-25 17:35:27,750 INFO L899 garLoopResultBuilder]: For program point L268-1(line 268) no Hoare annotation was computed. [2022-11-25 17:35:27,750 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 608) no Hoare annotation was computed. [2022-11-25 17:35:27,750 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 619) no Hoare annotation was computed. [2022-11-25 17:35:27,751 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 630) no Hoare annotation was computed. [2022-11-25 17:35:27,751 INFO L902 garLoopResultBuilder]: At program point L698(lines 689 700) the Hoare annotation is: true [2022-11-25 17:35:27,751 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2022-11-25 17:35:27,751 INFO L899 garLoopResultBuilder]: For program point L270(line 270) no Hoare annotation was computed. [2022-11-25 17:35:27,751 INFO L899 garLoopResultBuilder]: For program point L270-1(line 270) no Hoare annotation was computed. [2022-11-25 17:35:27,752 INFO L895 garLoopResultBuilder]: At program point L601(lines 109 669) the Hoare annotation is: (let ((.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= 8192 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse16 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse17 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 12292)) (.cse21 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse18 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse22 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse13 .cse14 .cse15) (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse12 .cse15) (and .cse19 .cse0 .cse20 .cse21 .cse22) (and .cse19 .cse20 .cse21 .cse18 .cse22) (and .cse16 .cse17 .cse21 .cse18 .cse22))) [2022-11-25 17:35:27,752 INFO L899 garLoopResultBuilder]: For program point L568(lines 568 572) no Hoare annotation was computed. [2022-11-25 17:35:27,752 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2022-11-25 17:35:27,753 INFO L895 garLoopResultBuilder]: At program point L370(lines 352 388) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-11-25 17:35:27,753 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 607) no Hoare annotation was computed. [2022-11-25 17:35:27,753 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 618) no Hoare annotation was computed. [2022-11-25 17:35:27,753 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 629) no Hoare annotation was computed. [2022-11-25 17:35:27,753 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2022-11-25 17:35:27,754 INFO L899 garLoopResultBuilder]: For program point L470(lines 470 481) no Hoare annotation was computed. [2022-11-25 17:35:27,754 INFO L899 garLoopResultBuilder]: For program point L536-2(lines 219 600) no Hoare annotation was computed. [2022-11-25 17:35:27,754 INFO L895 garLoopResultBuilder]: At program point L404(lines 395 426) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-11-25 17:35:27,754 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 250) no Hoare annotation was computed. [2022-11-25 17:35:27,754 INFO L895 garLoopResultBuilder]: At program point L206(lines 202 608) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse2 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse3))) [2022-11-25 17:35:27,755 INFO L895 garLoopResultBuilder]: At program point L173(lines 169 619) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-11-25 17:35:27,755 INFO L899 garLoopResultBuilder]: For program point L239-2(lines 239 250) no Hoare annotation was computed. [2022-11-25 17:35:27,755 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 376) no Hoare annotation was computed. [2022-11-25 17:35:27,755 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 270) no Hoare annotation was computed. [2022-11-25 17:35:27,755 INFO L902 garLoopResultBuilder]: At program point L670(lines 108 671) the Hoare annotation is: true [2022-11-25 17:35:27,756 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 412) no Hoare annotation was computed. [2022-11-25 17:35:27,756 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 246) no Hoare annotation was computed. [2022-11-25 17:35:27,756 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 606) no Hoare annotation was computed. [2022-11-25 17:35:27,756 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 617) no Hoare annotation was computed. [2022-11-25 17:35:27,756 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 628) no Hoare annotation was computed. [2022-11-25 17:35:27,757 INFO L895 garLoopResultBuilder]: At program point L109-2(lines 109 669) the Hoare annotation is: (let ((.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= 8192 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse16 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse17 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 12292)) (.cse21 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse18 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse22 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse13 .cse14 .cse15) (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse12 .cse15) (and .cse19 .cse0 .cse20 .cse21 .cse22) (and .cse19 .cse20 .cse21 .cse18 .cse22) (and .cse16 .cse17 .cse21 .cse18 .cse22))) [2022-11-25 17:35:27,757 INFO L895 garLoopResultBuilder]: At program point L176(lines 175 617) the Hoare annotation is: (let ((.cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8192 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse10 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse16 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (< 8192 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 12292) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse16 .cse17))) [2022-11-25 17:35:27,757 INFO L895 garLoopResultBuilder]: At program point L143(lines 136 630) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse14 .cse15) (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-25 17:35:27,758 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-11-25 17:35:27,758 INFO L899 garLoopResultBuilder]: For program point L639(lines 639 667) no Hoare annotation was computed. [2022-11-25 17:35:27,758 INFO L899 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2022-11-25 17:35:27,758 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 664) no Hoare annotation was computed. [2022-11-25 17:35:27,758 INFO L899 garLoopResultBuilder]: For program point L574(lines 574 578) no Hoare annotation was computed. [2022-11-25 17:35:27,758 INFO L899 garLoopResultBuilder]: For program point L508(lines 508 512) no Hoare annotation was computed. [2022-11-25 17:35:27,758 INFO L899 garLoopResultBuilder]: For program point L574-2(lines 574 578) no Hoare annotation was computed. [2022-11-25 17:35:27,759 INFO L899 garLoopResultBuilder]: For program point L508-2(lines 219 600) no Hoare annotation was computed. [2022-11-25 17:35:27,759 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 605) no Hoare annotation was computed. [2022-11-25 17:35:27,759 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 616) no Hoare annotation was computed. [2022-11-25 17:35:27,759 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 627) no Hoare annotation was computed. [2022-11-25 17:35:27,759 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 638) no Hoare annotation was computed. [2022-11-25 17:35:27,759 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 678) no Hoare annotation was computed. [2022-11-25 17:35:27,760 INFO L899 garLoopResultBuilder]: For program point L641(lines 641 650) no Hoare annotation was computed. [2022-11-25 17:35:27,760 INFO L899 garLoopResultBuilder]: For program point L674-2(lines 674 678) no Hoare annotation was computed. [2022-11-25 17:35:27,760 INFO L899 garLoopResultBuilder]: For program point L641-2(lines 640 662) no Hoare annotation was computed. [2022-11-25 17:35:27,760 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 282) no Hoare annotation was computed. [2022-11-25 17:35:27,760 INFO L895 garLoopResultBuilder]: At program point L212(lines 208 606) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse1 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse3 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse3) (and (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3))) [2022-11-25 17:35:27,760 INFO L895 garLoopResultBuilder]: At program point L113(lines 112 638) the Hoare annotation is: false [2022-11-25 17:35:27,761 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 316) no Hoare annotation was computed. [2022-11-25 17:35:27,761 INFO L899 garLoopResultBuilder]: For program point L312-2(lines 219 600) no Hoare annotation was computed. [2022-11-25 17:35:27,761 INFO L899 garLoopResultBuilder]: For program point L643(lines 643 647) no Hoare annotation was computed. [2022-11-25 17:35:27,761 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 604) no Hoare annotation was computed. [2022-11-25 17:35:27,761 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 615) no Hoare annotation was computed. [2022-11-25 17:35:27,761 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 626) no Hoare annotation was computed. [2022-11-25 17:35:27,761 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 637) no Hoare annotation was computed. [2022-11-25 17:35:27,762 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2022-11-25 17:35:27,762 INFO L899 garLoopResultBuilder]: For program point L347-2(lines 219 600) no Hoare annotation was computed. [2022-11-25 17:35:27,762 INFO L895 garLoopResultBuilder]: At program point L215(lines 214 604) the Hoare annotation is: (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) [2022-11-25 17:35:27,762 INFO L895 garLoopResultBuilder]: At program point L182(lines 178 616) the Hoare annotation is: (and (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) [2022-11-25 17:35:27,762 INFO L895 garLoopResultBuilder]: At program point L149(lines 145 627) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192))) (.cse5 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse12 .cse13) (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-11-25 17:35:27,763 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2022-11-25 17:35:27,763 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 459) no Hoare annotation was computed. [2022-11-25 17:35:27,763 INFO L895 garLoopResultBuilder]: At program point L414(lines 405 425) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-11-25 17:35:27,763 INFO L899 garLoopResultBuilder]: For program point L447-2(lines 447 459) no Hoare annotation was computed. [2022-11-25 17:35:27,763 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 614) no Hoare annotation was computed. [2022-11-25 17:35:27,764 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 625) no Hoare annotation was computed. [2022-11-25 17:35:27,764 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 636) no Hoare annotation was computed. [2022-11-25 17:35:27,764 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 17:35:27,764 INFO L895 garLoopResultBuilder]: At program point L218(lines 217 603) the Hoare annotation is: (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) [2022-11-25 17:35:27,764 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2022-11-25 17:35:27,764 INFO L899 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2022-11-25 17:35:27,765 INFO L899 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2022-11-25 17:35:27,765 INFO L899 garLoopResultBuilder]: For program point L450(lines 450 455) no Hoare annotation was computed. [2022-11-25 17:35:27,765 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2022-11-25 17:35:27,765 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 257) no Hoare annotation was computed. [2022-11-25 17:35:27,765 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 613) no Hoare annotation was computed. [2022-11-25 17:35:27,765 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 624) no Hoare annotation was computed. [2022-11-25 17:35:27,765 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 635) no Hoare annotation was computed. [2022-11-25 17:35:27,765 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 594) no Hoare annotation was computed. [2022-11-25 17:35:27,766 INFO L899 garLoopResultBuilder]: For program point L584-1(lines 584 594) no Hoare annotation was computed. [2022-11-25 17:35:27,766 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 522) no Hoare annotation was computed. [2022-11-25 17:35:27,766 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2022-11-25 17:35:27,766 INFO L895 garLoopResultBuilder]: At program point L188(lines 184 614) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse5 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse5))) [2022-11-25 17:35:27,766 INFO L895 garLoopResultBuilder]: At program point L155(lines 151 625) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-11-25 17:35:27,767 INFO L899 garLoopResultBuilder]: For program point L486(lines 486 490) no Hoare annotation was computed. [2022-11-25 17:35:27,767 INFO L895 garLoopResultBuilder]: At program point L222(lines 115 637) the Hoare annotation is: false [2022-11-25 17:35:27,767 INFO L902 garLoopResultBuilder]: At program point L685(lines 75 687) the Hoare annotation is: true [2022-11-25 17:35:27,767 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 658) no Hoare annotation was computed. [2022-11-25 17:35:27,767 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 387) no Hoare annotation was computed. [2022-11-25 17:35:27,767 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2022-11-25 17:35:27,767 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:35:27,768 INFO L899 garLoopResultBuilder]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2022-11-25 17:35:27,768 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 612) no Hoare annotation was computed. [2022-11-25 17:35:27,768 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 623) no Hoare annotation was computed. [2022-11-25 17:35:27,768 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 634) no Hoare annotation was computed. [2022-11-25 17:35:27,768 INFO L902 garLoopResultBuilder]: At program point L686(lines 20 688) the Hoare annotation is: true [2022-11-25 17:35:27,768 INFO L899 garLoopResultBuilder]: For program point L587(lines 587 591) no Hoare annotation was computed. [2022-11-25 17:35:27,768 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2022-11-25 17:35:27,769 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 75 687) no Hoare annotation was computed. [2022-11-25 17:35:27,769 INFO L899 garLoopResultBuilder]: For program point L358(lines 358 386) no Hoare annotation was computed. [2022-11-25 17:35:27,769 INFO L899 garLoopResultBuilder]: For program point L358-1(lines 358 386) no Hoare annotation was computed. [2022-11-25 17:35:27,769 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 272) no Hoare annotation was computed. [2022-11-25 17:35:27,769 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 611) no Hoare annotation was computed. [2022-11-25 17:35:27,769 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 622) no Hoare annotation was computed. [2022-11-25 17:35:27,769 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 633) no Hoare annotation was computed. [2022-11-25 17:35:27,770 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 268) no Hoare annotation was computed. [2022-11-25 17:35:27,770 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2022-11-25 17:35:27,770 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 17:35:27,770 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 383) no Hoare annotation was computed. [2022-11-25 17:35:27,770 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 231) no Hoare annotation was computed. [2022-11-25 17:35:27,770 INFO L895 garLoopResultBuilder]: At program point L194(lines 190 612) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse5 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse5))) [2022-11-25 17:35:27,771 INFO L895 garLoopResultBuilder]: At program point L161(lines 157 623) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-11-25 17:35:27,771 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 219 600) no Hoare annotation was computed. [2022-11-25 17:35:27,771 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 268) no Hoare annotation was computed. [2022-11-25 17:35:27,771 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 266) no Hoare annotation was computed. [2022-11-25 17:35:27,771 INFO L899 garLoopResultBuilder]: For program point L559(lines 559 567) no Hoare annotation was computed. [2022-11-25 17:35:27,772 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 299) no Hoare annotation was computed. [2022-11-25 17:35:27,772 INFO L899 garLoopResultBuilder]: For program point L295-2(lines 219 600) no Hoare annotation was computed. [2022-11-25 17:35:27,772 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 610) no Hoare annotation was computed. [2022-11-25 17:35:27,772 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 621) no Hoare annotation was computed. [2022-11-25 17:35:27,772 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 632) no Hoare annotation was computed. [2022-11-25 17:35:27,772 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 426) no Hoare annotation was computed. [2022-11-25 17:35:27,772 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 382) no Hoare annotation was computed. [2022-11-25 17:35:27,773 INFO L895 garLoopResultBuilder]: At program point L131(lines 127 633) the Hoare annotation is: false [2022-11-25 17:35:27,773 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:35:27,773 INFO L899 garLoopResultBuilder]: For program point L396(lines 396 402) no Hoare annotation was computed. [2022-11-25 17:35:27,773 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2022-11-25 17:35:27,773 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2022-11-25 17:35:27,773 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 368) no Hoare annotation was computed. [2022-11-25 17:35:27,774 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 331 340) no Hoare annotation was computed. [2022-11-25 17:35:27,774 INFO L899 garLoopResultBuilder]: For program point L364-2(lines 362 380) no Hoare annotation was computed. [2022-11-25 17:35:27,774 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 609) no Hoare annotation was computed. [2022-11-25 17:35:27,774 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 620) no Hoare annotation was computed. [2022-11-25 17:35:27,774 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 631) no Hoare annotation was computed. [2022-11-25 17:35:27,774 INFO L895 garLoopResultBuilder]: At program point L563(lines 75 687) the Hoare annotation is: (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) [2022-11-25 17:35:27,774 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2022-11-25 17:35:27,775 INFO L895 garLoopResultBuilder]: At program point L200(lines 196 610) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse5 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse5))) [2022-11-25 17:35:27,775 INFO L895 garLoopResultBuilder]: At program point L167(lines 163 621) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-11-25 17:35:27,775 INFO L895 garLoopResultBuilder]: At program point L134(lines 133 631) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse14 .cse15) (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-25 17:35:27,778 INFO L445 BasicCegarLoop]: Path program 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-25 17:35:27,781 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:35:27,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:35:27 BoogieIcfgContainer [2022-11-25 17:35:27,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:35:27,835 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:35:27,836 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:35:27,836 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:35:27,836 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:35:01" (3/4) ... [2022-11-25 17:35:27,839 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 17:35:27,859 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-25 17:35:27,863 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 17:35:27,864 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 17:35:27,864 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:35:27,980 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:35:27,981 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:35:27,981 INFO L158 Benchmark]: Toolchain (without parser) took 28005.48ms. Allocated memory was 218.1MB in the beginning and 421.5MB in the end (delta: 203.4MB). Free memory was 167.3MB in the beginning and 242.2MB in the end (delta: -74.9MB). Peak memory consumption was 128.9MB. Max. memory is 16.1GB. [2022-11-25 17:35:27,982 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 218.1MB. Free memory is still 190.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:35:27,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.38ms. Allocated memory is still 218.1MB. Free memory was 167.3MB in the beginning and 151.4MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 17:35:27,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.91ms. Allocated memory is still 218.1MB. Free memory was 151.4MB in the beginning and 148.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:35:27,989 INFO L158 Benchmark]: Boogie Preprocessor took 39.08ms. Allocated memory is still 218.1MB. Free memory was 148.4MB in the beginning and 146.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:35:27,989 INFO L158 Benchmark]: RCFGBuilder took 969.69ms. Allocated memory is still 218.1MB. Free memory was 146.1MB in the beginning and 111.9MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-25 17:35:27,990 INFO L158 Benchmark]: TraceAbstraction took 26392.13ms. Allocated memory was 218.1MB in the beginning and 421.5MB in the end (delta: 203.4MB). Free memory was 111.3MB in the beginning and 249.5MB in the end (delta: -138.2MB). Peak memory consumption was 185.6MB. Max. memory is 16.1GB. [2022-11-25 17:35:27,991 INFO L158 Benchmark]: Witness Printer took 145.28ms. Allocated memory is still 421.5MB. Free memory was 249.5MB in the beginning and 242.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 17:35:27,992 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.65ms. Allocated memory is still 218.1MB. Free memory is still 190.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.38ms. Allocated memory is still 218.1MB. Free memory was 167.3MB in the beginning and 151.4MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.91ms. Allocated memory is still 218.1MB. Free memory was 151.4MB in the beginning and 148.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.08ms. Allocated memory is still 218.1MB. Free memory was 148.4MB in the beginning and 146.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 969.69ms. Allocated memory is still 218.1MB. Free memory was 146.1MB in the beginning and 111.9MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26392.13ms. Allocated memory was 218.1MB in the beginning and 421.5MB in the end (delta: 203.4MB). Free memory was 111.3MB in the beginning and 249.5MB in the end (delta: -138.2MB). Peak memory consumption was 185.6MB. Max. memory is 16.1GB. * Witness Printer took 145.28ms. Allocated memory is still 421.5MB. Free memory was 249.5MB in the beginning and 242.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 268]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 268]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 270]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 270]: 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, 147 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 26.2s, OverallIterations: 31, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4847 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4847 mSDsluCounter, 8053 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2919 mSDsCounter, 1071 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3704 IncrementalHoareTripleChecker+Invalid, 4775 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1071 mSolverCounterUnsat, 5134 mSDtfsCounter, 3704 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1548 GetRequests, 1497 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1027occurred in iteration=30, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 2049 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 200 NumberOfFragments, 1950 HoareAnnotationTreeSize, 29 FomulaSimplifications, 104 FormulaSimplificationTreeSizeReduction, 5.3s HoareSimplificationTime, 29 FomulaSimplificationsInter, 396884 FormulaSimplificationTreeSizeReductionInter, 8.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 4811 NumberOfCodeBlocks, 4811 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5494 ConstructedInterpolants, 0 QuantifiedInterpolants, 8514 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1321 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 37 InterpolantComputations, 28 PerfectInterpolantSequences, 13015/13072 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 4 specifications checked. All of them hold - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && 8576 <= s__state) || ((((((!(8673 == s__state) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && 8576 <= s__state) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((!(s__state == 8657) && !(12292 <= s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && 8576 <= s__state) || ((((!(8576 == s__state) && !(s__state == 8657)) && !(12292 <= s__state)) && !(s__state == 8656)) && 8576 <= s__state) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(12292 == s__state) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8576 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((!(8576 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8192 < s__state) && 3 == s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576)) || ((((((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 < 12292) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && 8576 <= s__state) || ((((((!(8673 == s__state) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && 8576 <= s__state) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && s__state <= 8576 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(8576 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 3 == s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 < 12292) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576)) || ((((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576)) || (((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8529)) && s__state <= 8576)) || ((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8657)) && !(12292 <= s__state)) && 8576 <= s__state)) || ((((!(8673 == s__state) && !(s__state == 8657)) && !(12292 <= s__state)) && !(0 == s__hit)) && 8576 <= s__state)) || ((((8576 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 < 12292) && !(12292 <= s__state)) && !(0 == s__hit)) && 8576 <= s__state) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(8576 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 3 == s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 < 12292) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576)) || ((((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576)) || (((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8529)) && s__state <= 8576)) || ((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8657)) && !(12292 <= s__state)) && 8576 <= s__state)) || ((((!(8673 == s__state) && !(s__state == 8657)) && !(12292 <= s__state)) && !(0 == s__hit)) && 8576 <= s__state)) || ((((8576 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 < 12292) && !(12292 <= s__state)) && !(0 == s__hit)) && 8576 <= s__state) - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && 8576 <= s__state) || ((((((!(8673 == s__state) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && 8576 <= s__state) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: !(12292 == s__state) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: !(12292 == s__state) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((!(8673 == s__state) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && 8576 <= s__state - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8672)) && !(12292 <= s__state)) && 8576 <= s__state) || ((((!(8673 == s__state) && !(s__state == 8672)) && !(12292 <= s__state)) && !(0 == s__hit)) && 8576 <= s__state) RESULT: Ultimate proved your program to be correct! [2022-11-25 17:35:28,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c128e6ec-47cd-423e-bc59-cdf5a9b56e51/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE