./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread-divine/ring_1w1r-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a 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_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-divine/ring_1w1r-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc --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 3a956b76a4ba98ce13df4d83ef2fb7ffa0973225ecb152c14bcfbb55b6546601 --- 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-5e519f3 [2022-11-02 20:47:53,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:47:53,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:47:53,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:47:53,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:47:53,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:47:53,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:47:53,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:47:53,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:47:53,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:47:53,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:47:53,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:47:53,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:47:53,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:47:53,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:47:53,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:47:53,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:47:53,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:47:53,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:47:53,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:47:53,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:47:53,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:47:53,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:47:53,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:47:53,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:47:53,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:47:53,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:47:53,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:47:53,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:47:53,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:47:53,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:47:53,122 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:47:53,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:47:53,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:47:53,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:47:53,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:47:53,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:47:53,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:47:53,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:47:53,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:47:53,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:47:53,131 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-02 20:47:53,169 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:47:53,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:47:53,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:47:53,170 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:47:53,170 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:47:53,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:47:53,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:47:53,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:47:53,172 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:47:53,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:47:53,172 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:47:53,172 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:47:53,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:47:53,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:47:53,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:47:53,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:47:53,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:47:53,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:47:53,174 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-02 20:47:53,174 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:47:53,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:47:53,177 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:47:53,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:47:53,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:47:53,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:47:53,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:47:53,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:53,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:47:53,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:47:53,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:47:53,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:47:53,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:47:53,182 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:47:53,182 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/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_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc 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 -> 3a956b76a4ba98ce13df4d83ef2fb7ffa0973225ecb152c14bcfbb55b6546601 [2022-11-02 20:47:53,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:47:53,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:47:53,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:47:53,483 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:47:53,483 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:47:53,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-divine/ring_1w1r-1.i [2022-11-02 20:47:53,566 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/data/7da30eba9/8542138f9bb147009e1c3f272a431906/FLAGc8f12549d [2022-11-02 20:47:54,216 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:47:54,217 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/sv-benchmarks/c/pthread-divine/ring_1w1r-1.i [2022-11-02 20:47:54,234 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/data/7da30eba9/8542138f9bb147009e1c3f272a431906/FLAGc8f12549d [2022-11-02 20:47:54,496 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/data/7da30eba9/8542138f9bb147009e1c3f272a431906 [2022-11-02 20:47:54,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:47:54,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:47:54,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:54,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:47:54,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:47:54,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:54" (1/1) ... [2022-11-02 20:47:54,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f8a8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:54, skipping insertion in model container [2022-11-02 20:47:54,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:54" (1/1) ... [2022-11-02 20:47:54,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:47:54,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:47:54,784 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-02 20:47:55,104 WARN L230 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_dda63f6a-5af3-47ae-ad65-92b0c25cc749/sv-benchmarks/c/pthread-divine/ring_1w1r-1.i[39095,39108] [2022-11-02 20:47:55,106 WARN L230 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_dda63f6a-5af3-47ae-ad65-92b0c25cc749/sv-benchmarks/c/pthread-divine/ring_1w1r-1.i[39180,39193] [2022-11-02 20:47:55,107 WARN L230 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_dda63f6a-5af3-47ae-ad65-92b0c25cc749/sv-benchmarks/c/pthread-divine/ring_1w1r-1.i[39232,39245] [2022-11-02 20:47:55,117 WARN L230 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_dda63f6a-5af3-47ae-ad65-92b0c25cc749/sv-benchmarks/c/pthread-divine/ring_1w1r-1.i[39641,39654] [2022-11-02 20:47:55,118 WARN L230 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_dda63f6a-5af3-47ae-ad65-92b0c25cc749/sv-benchmarks/c/pthread-divine/ring_1w1r-1.i[39726,39739] [2022-11-02 20:47:55,120 WARN L230 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_dda63f6a-5af3-47ae-ad65-92b0c25cc749/sv-benchmarks/c/pthread-divine/ring_1w1r-1.i[39778,39791] [2022-11-02 20:47:55,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:55,140 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:47:55,161 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-02 20:47:55,204 WARN L230 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_dda63f6a-5af3-47ae-ad65-92b0c25cc749/sv-benchmarks/c/pthread-divine/ring_1w1r-1.i[39095,39108] [2022-11-02 20:47:55,206 WARN L230 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_dda63f6a-5af3-47ae-ad65-92b0c25cc749/sv-benchmarks/c/pthread-divine/ring_1w1r-1.i[39180,39193] [2022-11-02 20:47:55,208 WARN L230 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_dda63f6a-5af3-47ae-ad65-92b0c25cc749/sv-benchmarks/c/pthread-divine/ring_1w1r-1.i[39232,39245] [2022-11-02 20:47:55,212 WARN L230 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_dda63f6a-5af3-47ae-ad65-92b0c25cc749/sv-benchmarks/c/pthread-divine/ring_1w1r-1.i[39641,39654] [2022-11-02 20:47:55,213 WARN L230 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_dda63f6a-5af3-47ae-ad65-92b0c25cc749/sv-benchmarks/c/pthread-divine/ring_1w1r-1.i[39726,39739] [2022-11-02 20:47:55,213 WARN L230 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_dda63f6a-5af3-47ae-ad65-92b0c25cc749/sv-benchmarks/c/pthread-divine/ring_1w1r-1.i[39778,39791] [2022-11-02 20:47:55,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:55,270 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:47:55,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55 WrapperNode [2022-11-02 20:47:55,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:55,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:55,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:47:55,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:47:55,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,361 INFO L138 Inliner]: procedures = 225, calls = 43, calls flagged for inlining = 10, calls inlined = 7, statements flattened = 127 [2022-11-02 20:47:55,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:55,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:47:55,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:47:55,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:47:55,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,415 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:47:55,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:47:55,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:47:55,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:47:55,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:55,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:55,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:47:55,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:47:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:47:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:47:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:47:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:47:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:47:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:47:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure reader_nowait_fn [2022-11-02 20:47:55,507 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_nowait_fn [2022-11-02 20:47:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:47:55,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:47:55,509 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:47:55,636 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:47:55,638 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:47:56,054 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:47:56,063 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:47:56,063 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:47:56,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:56 BoogieIcfgContainer [2022-11-02 20:47:56,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:47:56,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:47:56,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:47:56,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:47:56,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:47:54" (1/3) ... [2022-11-02 20:47:56,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647f6e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:56, skipping insertion in model container [2022-11-02 20:47:56,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (2/3) ... [2022-11-02 20:47:56,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647f6e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:56, skipping insertion in model container [2022-11-02 20:47:56,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:56" (3/3) ... [2022-11-02 20:47:56,078 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_1w1r-1.i [2022-11-02 20:47:56,086 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:47:56,097 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:47:56,097 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-02 20:47:56,098 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:47:56,198 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-02 20:47:56,233 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-02 20:47:56,247 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 166 transitions, 340 flow [2022-11-02 20:47:56,250 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 166 transitions, 340 flow [2022-11-02 20:47:56,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 166 transitions, 340 flow [2022-11-02 20:47:56,371 INFO L130 PetriNetUnfolder]: 9/165 cut-off events. [2022-11-02 20:47:56,371 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 20:47:56,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 165 events. 9/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-11-02 20:47:56,383 INFO L118 LiptonReduction]: Number of co-enabled transitions 7638 [2022-11-02 20:48:02,088 INFO L133 LiptonReduction]: Checked pairs total: 10698 [2022-11-02 20:48:02,088 INFO L135 LiptonReduction]: Total number of compositions: 172 [2022-11-02 20:48:02,097 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 37 transitions, 82 flow [2022-11-02 20:48:02,148 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 221 states, 159 states have (on average 2.930817610062893) internal successors, (466), 220 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:02,179 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:48:02,185 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=FINITE_AUTOMATA, 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;@5103343f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:48:02,186 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-02 20:48:02,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 159 states have (on average 2.930817610062893) internal successors, (466), 220 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-02 20:48:02,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:02,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-02 20:48:02,195 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:02,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:02,201 INFO L85 PathProgramCache]: Analyzing trace with hash 19660971, now seen corresponding path program 1 times [2022-11-02 20:48:02,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:02,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839444064] [2022-11-02 20:48:02,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,530 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-02 20:48:02,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:02,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839444064] [2022-11-02 20:48:02,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839444064] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:02,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:02,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:48:02,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678901536] [2022-11-02 20:48:02,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:02,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:48:02,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:02,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:48:02,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:48:02,567 INFO L87 Difference]: Start difference. First operand has 221 states, 159 states have (on average 2.930817610062893) internal successors, (466), 220 states have internal predecessors, (466), 0 states have call successors, (0), 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, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:02,728 INFO L93 Difference]: Finished difference Result 351 states and 726 transitions. [2022-11-02 20:48:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:48:02,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-02 20:48:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:02,753 INFO L225 Difference]: With dead ends: 351 [2022-11-02 20:48:02,753 INFO L226 Difference]: Without dead ends: 351 [2022-11-02 20:48:02,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02 20:48:02,759 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:02,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:48:02,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-02 20:48:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 299. [2022-11-02 20:48:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 244 states have (on average 2.762295081967213) internal successors, (674), 298 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 674 transitions. [2022-11-02 20:48:02,856 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 674 transitions. Word has length 4 [2022-11-02 20:48:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:02,857 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 674 transitions. [2022-11-02 20:48:02,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 674 transitions. [2022-11-02 20:48:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:48:02,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:02,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:48:02,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:48:02,860 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:02,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:02,861 INFO L85 PathProgramCache]: Analyzing trace with hash 609492231, now seen corresponding path program 1 times [2022-11-02 20:48:02,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:02,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895947837] [2022-11-02 20:48:02,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:02,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:03,329 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-02 20:48:03,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:03,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895947837] [2022-11-02 20:48:03,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895947837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:03,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:03,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:48:03,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169023063] [2022-11-02 20:48:03,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:03,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:48:03,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:03,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:48:03,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:03,334 INFO L87 Difference]: Start difference. First operand 299 states and 674 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:03,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:03,612 INFO L93 Difference]: Finished difference Result 347 states and 800 transitions. [2022-11-02 20:48:03,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:48:03,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-02 20:48:03,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:03,615 INFO L225 Difference]: With dead ends: 347 [2022-11-02 20:48:03,615 INFO L226 Difference]: Without dead ends: 347 [2022-11-02 20:48:03,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:48:03,616 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:03,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:48:03,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-11-02 20:48:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 331. [2022-11-02 20:48:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 276 states have (on average 2.753623188405797) internal successors, (760), 330 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 760 transitions. [2022-11-02 20:48:03,640 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 760 transitions. Word has length 5 [2022-11-02 20:48:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:03,640 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 760 transitions. [2022-11-02 20:48:03,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 760 transitions. [2022-11-02 20:48:03,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:48:03,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:03,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:48:03,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:48:03,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:03,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:03,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1713701753, now seen corresponding path program 1 times [2022-11-02 20:48:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:03,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002644712] [2022-11-02 20:48:03,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:03,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:03,960 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-02 20:48:03,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:03,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002644712] [2022-11-02 20:48:03,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002644712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:03,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:03,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:48:03,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135280300] [2022-11-02 20:48:03,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:03,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:48:03,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:03,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:48:03,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:48:03,963 INFO L87 Difference]: Start difference. First operand 331 states and 760 transitions. Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:04,265 INFO L93 Difference]: Finished difference Result 469 states and 981 transitions. [2022-11-02 20:48:04,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:48:04,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-02 20:48:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:04,269 INFO L225 Difference]: With dead ends: 469 [2022-11-02 20:48:04,269 INFO L226 Difference]: Without dead ends: 469 [2022-11-02 20:48:04,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:48:04,270 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:04,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:48:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-11-02 20:48:04,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 329. [2022-11-02 20:48:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 274 states have (on average 2.759124087591241) internal successors, (756), 328 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 756 transitions. [2022-11-02 20:48:04,283 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 756 transitions. Word has length 6 [2022-11-02 20:48:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:04,283 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 756 transitions. [2022-11-02 20:48:04,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 756 transitions. [2022-11-02 20:48:04,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:48:04,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:04,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:04,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:48:04,285 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reader_nowait_fnErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:04,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:04,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1585147421, now seen corresponding path program 1 times [2022-11-02 20:48:04,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:04,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902334826] [2022-11-02 20:48:04,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:04,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:04,350 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-02 20:48:04,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:04,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902334826] [2022-11-02 20:48:04,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902334826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:04,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:04,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:48:04,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056694847] [2022-11-02 20:48:04,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:04,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:48:04,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:04,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:48:04,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:48:04,358 INFO L87 Difference]: Start difference. First operand 329 states and 756 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:04,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:04,450 INFO L93 Difference]: Finished difference Result 425 states and 992 transitions. [2022-11-02 20:48:04,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:48:04,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-02 20:48:04,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:04,453 INFO L225 Difference]: With dead ends: 425 [2022-11-02 20:48:04,453 INFO L226 Difference]: Without dead ends: 425 [2022-11-02 20:48:04,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02 20:48:04,454 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:04,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:48:04,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-11-02 20:48:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 391. [2022-11-02 20:48:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 336 states have (on average 2.8333333333333335) internal successors, (952), 390 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 952 transitions. [2022-11-02 20:48:04,467 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 952 transitions. Word has length 7 [2022-11-02 20:48:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:04,468 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 952 transitions. [2022-11-02 20:48:04,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 952 transitions. [2022-11-02 20:48:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:48:04,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:04,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:04,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:48:04,469 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reader_nowait_fnErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:04,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:04,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1585147437, now seen corresponding path program 1 times [2022-11-02 20:48:04,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:04,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701952985] [2022-11-02 20:48:04,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:04,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:04,504 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-02 20:48:04,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:04,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701952985] [2022-11-02 20:48:04,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701952985] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:04,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:04,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:48:04,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078371759] [2022-11-02 20:48:04,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:04,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:48:04,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:04,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:48:04,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:48:04,506 INFO L87 Difference]: Start difference. First operand 391 states and 952 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:04,592 INFO L93 Difference]: Finished difference Result 425 states and 946 transitions. [2022-11-02 20:48:04,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:48:04,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-02 20:48:04,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:04,595 INFO L225 Difference]: With dead ends: 425 [2022-11-02 20:48:04,595 INFO L226 Difference]: Without dead ends: 425 [2022-11-02 20:48:04,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02 20:48:04,596 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:04,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:48:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-11-02 20:48:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 391. [2022-11-02 20:48:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 336 states have (on average 2.6964285714285716) internal successors, (906), 390 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 906 transitions. [2022-11-02 20:48:04,608 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 906 transitions. Word has length 7 [2022-11-02 20:48:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:04,608 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 906 transitions. [2022-11-02 20:48:04,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 906 transitions. [2022-11-02 20:48:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:48:04,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:04,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:04,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:48:04,610 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:04,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:04,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1766852765, now seen corresponding path program 1 times [2022-11-02 20:48:04,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:04,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74195015] [2022-11-02 20:48:04,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:04,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:04,821 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-02 20:48:04,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:04,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74195015] [2022-11-02 20:48:04,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74195015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:04,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:04,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:48:04,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575596731] [2022-11-02 20:48:04,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:04,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:48:04,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:04,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:48:04,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:48:04,824 INFO L87 Difference]: Start difference. First operand 391 states and 906 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:05,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:05,346 INFO L93 Difference]: Finished difference Result 623 states and 1361 transitions. [2022-11-02 20:48:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:48:05,351 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-02 20:48:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:05,354 INFO L225 Difference]: With dead ends: 623 [2022-11-02 20:48:05,354 INFO L226 Difference]: Without dead ends: 623 [2022-11-02 20:48:05,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:05,355 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 138 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:05,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 3 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:05,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2022-11-02 20:48:05,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 465. [2022-11-02 20:48:05,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 410 states have (on average 2.6853658536585368) internal successors, (1101), 464 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1101 transitions. [2022-11-02 20:48:05,372 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1101 transitions. Word has length 9 [2022-11-02 20:48:05,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:05,373 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 1101 transitions. [2022-11-02 20:48:05,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:05,373 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1101 transitions. [2022-11-02 20:48:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:48:05,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:05,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:05,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:48:05,375 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:05,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1766852817, now seen corresponding path program 1 times [2022-11-02 20:48:05,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:05,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224450739] [2022-11-02 20:48:05,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:05,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:05,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:05,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224450739] [2022-11-02 20:48:05,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224450739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:05,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:05,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:48:05,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868115099] [2022-11-02 20:48:05,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:05,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:48:05,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:05,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:48:05,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:48:05,546 INFO L87 Difference]: Start difference. First operand 465 states and 1101 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:06,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:06,057 INFO L93 Difference]: Finished difference Result 618 states and 1325 transitions. [2022-11-02 20:48:06,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:48:06,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-02 20:48:06,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:06,061 INFO L225 Difference]: With dead ends: 618 [2022-11-02 20:48:06,061 INFO L226 Difference]: Without dead ends: 618 [2022-11-02 20:48:06,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:06,062 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 140 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:06,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 3 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:06,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-11-02 20:48:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 465. [2022-11-02 20:48:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 410 states have (on average 2.6146341463414635) internal successors, (1072), 464 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1072 transitions. [2022-11-02 20:48:06,077 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1072 transitions. Word has length 9 [2022-11-02 20:48:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:06,078 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 1072 transitions. [2022-11-02 20:48:06,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1072 transitions. [2022-11-02 20:48:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:48:06,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:06,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:06,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:48:06,080 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:06,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:06,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1193339293, now seen corresponding path program 1 times [2022-11-02 20:48:06,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:06,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335282722] [2022-11-02 20:48:06,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:06,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,621 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-02 20:48:06,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:06,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335282722] [2022-11-02 20:48:06,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335282722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:06,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:06,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:48:06,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458913156] [2022-11-02 20:48:06,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:06,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:48:06,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:06,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:48:06,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:48:06,632 INFO L87 Difference]: Start difference. First operand 465 states and 1072 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:07,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:07,065 INFO L93 Difference]: Finished difference Result 589 states and 1363 transitions. [2022-11-02 20:48:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:48:07,066 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:48:07,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:07,069 INFO L225 Difference]: With dead ends: 589 [2022-11-02 20:48:07,069 INFO L226 Difference]: Without dead ends: 589 [2022-11-02 20:48:07,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:07,070 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:07,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-11-02 20:48:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 493. [2022-11-02 20:48:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 438 states have (on average 2.65296803652968) internal successors, (1162), 492 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1162 transitions. [2022-11-02 20:48:07,085 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1162 transitions. Word has length 10 [2022-11-02 20:48:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:07,086 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 1162 transitions. [2022-11-02 20:48:07,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1162 transitions. [2022-11-02 20:48:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:48:07,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:07,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:07,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:48:07,088 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:07,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:07,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1042072399, now seen corresponding path program 2 times [2022-11-02 20:48:07,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:07,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741435245] [2022-11-02 20:48:07,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:07,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:07,500 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-02 20:48:07,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:07,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741435245] [2022-11-02 20:48:07,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741435245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:07,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:07,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:48:07,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022851401] [2022-11-02 20:48:07,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:07,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:48:07,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:07,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:48:07,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:48:07,503 INFO L87 Difference]: Start difference. First operand 493 states and 1162 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:08,018 INFO L93 Difference]: Finished difference Result 633 states and 1485 transitions. [2022-11-02 20:48:08,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:48:08,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:48:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:08,022 INFO L225 Difference]: With dead ends: 633 [2022-11-02 20:48:08,023 INFO L226 Difference]: Without dead ends: 633 [2022-11-02 20:48:08,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:08,024 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:08,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:08,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-11-02 20:48:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 509. [2022-11-02 20:48:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 454 states have (on average 2.6299559471365637) internal successors, (1194), 508 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1194 transitions. [2022-11-02 20:48:08,043 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 1194 transitions. Word has length 10 [2022-11-02 20:48:08,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:08,043 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 1194 transitions. [2022-11-02 20:48:08,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 1194 transitions. [2022-11-02 20:48:08,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:48:08,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:08,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:08,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:48:08,047 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:08,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:08,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1450111459, now seen corresponding path program 3 times [2022-11-02 20:48:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:08,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663529137] [2022-11-02 20:48:08,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:08,565 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-02 20:48:08,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:08,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663529137] [2022-11-02 20:48:08,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663529137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:08,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:08,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:48:08,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672466230] [2022-11-02 20:48:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:08,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:48:08,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:08,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:48:08,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:48:08,568 INFO L87 Difference]: Start difference. First operand 509 states and 1194 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:09,201 INFO L93 Difference]: Finished difference Result 658 states and 1537 transitions. [2022-11-02 20:48:09,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:48:09,202 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:48:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:09,205 INFO L225 Difference]: With dead ends: 658 [2022-11-02 20:48:09,206 INFO L226 Difference]: Without dead ends: 658 [2022-11-02 20:48:09,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:48:09,207 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:09,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-11-02 20:48:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 506. [2022-11-02 20:48:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 451 states have (on average 2.631929046563193) internal successors, (1187), 505 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1187 transitions. [2022-11-02 20:48:09,223 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1187 transitions. Word has length 10 [2022-11-02 20:48:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:09,223 INFO L495 AbstractCegarLoop]: Abstraction has 506 states and 1187 transitions. [2022-11-02 20:48:09,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1187 transitions. [2022-11-02 20:48:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:48:09,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:09,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:09,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:48:09,225 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:09,225 INFO L85 PathProgramCache]: Analyzing trace with hash -9418699, now seen corresponding path program 4 times [2022-11-02 20:48:09,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:09,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522378015] [2022-11-02 20:48:09,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:09,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:09,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-02 20:48:09,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:09,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522378015] [2022-11-02 20:48:09,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522378015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:09,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:09,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:48:09,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008566515] [2022-11-02 20:48:09,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:09,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:48:09,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:09,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:48:09,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:48:09,654 INFO L87 Difference]: Start difference. First operand 506 states and 1187 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:10,375 INFO L93 Difference]: Finished difference Result 590 states and 1346 transitions. [2022-11-02 20:48:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:48:10,377 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:48:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:10,380 INFO L225 Difference]: With dead ends: 590 [2022-11-02 20:48:10,380 INFO L226 Difference]: Without dead ends: 590 [2022-11-02 20:48:10,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:48:10,381 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:10,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-11-02 20:48:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 457. [2022-11-02 20:48:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 402 states have (on average 2.584577114427861) internal successors, (1039), 456 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1039 transitions. [2022-11-02 20:48:10,397 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1039 transitions. Word has length 10 [2022-11-02 20:48:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:10,398 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 1039 transitions. [2022-11-02 20:48:10,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1039 transitions. [2022-11-02 20:48:10,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:48:10,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:10,399 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:10,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:48:10,400 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:10,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:10,400 INFO L85 PathProgramCache]: Analyzing trace with hash -37468878, now seen corresponding path program 1 times [2022-11-02 20:48:10,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:10,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690529570] [2022-11-02 20:48:10,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:10,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:10,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:10,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690529570] [2022-11-02 20:48:10,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690529570] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:10,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202745696] [2022-11-02 20:48:10,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:10,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:10,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:10,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:10,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:48:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:10,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-02 20:48:10,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:10,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:48:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:10,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:10,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-02 20:48:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:11,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202745696] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:11,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:11,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-11-02 20:48:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702838123] [2022-11-02 20:48:11,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:11,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:48:11,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:48:11,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:48:11,074 INFO L87 Difference]: Start difference. First operand 457 states and 1039 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 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-02 20:48:11,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:11,436 INFO L93 Difference]: Finished difference Result 666 states and 1495 transitions. [2022-11-02 20:48:11,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:48:11,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 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 10 [2022-11-02 20:48:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:11,440 INFO L225 Difference]: With dead ends: 666 [2022-11-02 20:48:11,440 INFO L226 Difference]: Without dead ends: 666 [2022-11-02 20:48:11,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:48:11,441 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 111 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:11,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 3 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-11-02 20:48:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 502. [2022-11-02 20:48:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 447 states have (on average 2.615212527964206) internal successors, (1169), 501 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1169 transitions. [2022-11-02 20:48:11,457 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1169 transitions. Word has length 10 [2022-11-02 20:48:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:11,458 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 1169 transitions. [2022-11-02 20:48:11,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 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-02 20:48:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1169 transitions. [2022-11-02 20:48:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:48:11,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:11,459 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:11,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:11,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:48:11,675 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:11,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:11,675 INFO L85 PathProgramCache]: Analyzing trace with hash -37468892, now seen corresponding path program 1 times [2022-11-02 20:48:11,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:11,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446144512] [2022-11-02 20:48:11,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:11,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:11,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:11,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446144512] [2022-11-02 20:48:11,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446144512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:11,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388354324] [2022-11-02 20:48:11,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:11,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:11,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:11,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:11,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:48:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:11,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-02 20:48:11,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:12,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:48:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:12,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:12,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-02 20:48:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:12,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388354324] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:12,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:12,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 13 [2022-11-02 20:48:12,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625441942] [2022-11-02 20:48:12,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:12,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:48:12,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:12,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:48:12,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:48:12,243 INFO L87 Difference]: Start difference. First operand 502 states and 1169 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:12,820 INFO L93 Difference]: Finished difference Result 689 states and 1585 transitions. [2022-11-02 20:48:12,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:48:12,820 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:48:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:12,824 INFO L225 Difference]: With dead ends: 689 [2022-11-02 20:48:12,824 INFO L226 Difference]: Without dead ends: 689 [2022-11-02 20:48:12,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:48:12,826 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 242 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:12,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 6 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:12,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-11-02 20:48:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 493. [2022-11-02 20:48:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 438 states have (on average 2.577625570776256) internal successors, (1129), 492 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1129 transitions. [2022-11-02 20:48:12,847 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1129 transitions. Word has length 10 [2022-11-02 20:48:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:12,848 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 1129 transitions. [2022-11-02 20:48:12,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1129 transitions. [2022-11-02 20:48:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:48:12,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:12,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:12,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:13,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:48:13,071 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:13,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:13,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1433495642, now seen corresponding path program 1 times [2022-11-02 20:48:13,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:13,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595196050] [2022-11-02 20:48:13,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:13,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:13,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:13,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595196050] [2022-11-02 20:48:13,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595196050] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:13,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064718125] [2022-11-02 20:48:13,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:13,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:13,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:13,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:13,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:48:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:13,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:48:13,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:13,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:13,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064718125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:13,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:48:13,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-11-02 20:48:13,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366862107] [2022-11-02 20:48:13,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:13,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:13,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:13,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:13,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:13,272 INFO L87 Difference]: Start difference. First operand 493 states and 1129 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:13,382 INFO L93 Difference]: Finished difference Result 483 states and 1075 transitions. [2022-11-02 20:48:13,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:48:13,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-02 20:48:13,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:13,385 INFO L225 Difference]: With dead ends: 483 [2022-11-02 20:48:13,385 INFO L226 Difference]: Without dead ends: 483 [2022-11-02 20:48:13,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:13,386 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 46 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:13,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:48:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-11-02 20:48:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 453. [2022-11-02 20:48:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 412 states have (on average 2.5315533980582523) internal successors, (1043), 452 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1043 transitions. [2022-11-02 20:48:13,399 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1043 transitions. Word has length 11 [2022-11-02 20:48:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:13,399 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 1043 transitions. [2022-11-02 20:48:13,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1043 transitions. [2022-11-02 20:48:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:48:13,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:13,400 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-02 20:48:13,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:13,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:13,627 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reader_nowait_fnErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:13,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:13,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1161534588, now seen corresponding path program 1 times [2022-11-02 20:48:13,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:13,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144978710] [2022-11-02 20:48:13,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:13,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:13,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:13,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144978710] [2022-11-02 20:48:13,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144978710] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:13,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122522539] [2022-11-02 20:48:13,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:13,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:13,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:13,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:13,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:48:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:13,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:48:13,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:13,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:13,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122522539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:13,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:48:13,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-11-02 20:48:13,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232221618] [2022-11-02 20:48:13,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:13,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:13,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:13,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:13,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:13,816 INFO L87 Difference]: Start difference. First operand 453 states and 1043 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:13,932 INFO L93 Difference]: Finished difference Result 458 states and 1018 transitions. [2022-11-02 20:48:13,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:48:13,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-02 20:48:13,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:13,935 INFO L225 Difference]: With dead ends: 458 [2022-11-02 20:48:13,935 INFO L226 Difference]: Without dead ends: 458 [2022-11-02 20:48:13,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:13,936 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 37 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:13,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 6 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:48:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-11-02 20:48:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 428. [2022-11-02 20:48:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 393 states have (on average 2.508905852417303) internal successors, (986), 427 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 986 transitions. [2022-11-02 20:48:13,949 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 986 transitions. Word has length 11 [2022-11-02 20:48:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:13,949 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 986 transitions. [2022-11-02 20:48:13,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 986 transitions. [2022-11-02 20:48:13,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:48:13,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:13,950 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-02 20:48:13,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:14,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:48:14,164 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reader_nowait_fnErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1161534572, now seen corresponding path program 1 times [2022-11-02 20:48:14,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:14,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436242686] [2022-11-02 20:48:14,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:14,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:14,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:14,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436242686] [2022-11-02 20:48:14,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436242686] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:14,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520969376] [2022-11-02 20:48:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:14,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:14,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:14,215 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:14,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:48:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:14,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:48:14,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:14,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:14,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520969376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:14,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:48:14,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-11-02 20:48:14,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968914145] [2022-11-02 20:48:14,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:14,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:14,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:14,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:14,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:14,331 INFO L87 Difference]: Start difference. First operand 428 states and 986 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:14,429 INFO L93 Difference]: Finished difference Result 433 states and 961 transitions. [2022-11-02 20:48:14,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:48:14,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-02 20:48:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:14,431 INFO L225 Difference]: With dead ends: 433 [2022-11-02 20:48:14,432 INFO L226 Difference]: Without dead ends: 433 [2022-11-02 20:48:14,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:14,432 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 44 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:14,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 5 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:48:14,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-11-02 20:48:14,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 403. [2022-11-02 20:48:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 374 states have (on average 2.483957219251337) internal successors, (929), 402 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 929 transitions. [2022-11-02 20:48:14,443 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 929 transitions. Word has length 11 [2022-11-02 20:48:14,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:14,444 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 929 transitions. [2022-11-02 20:48:14,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 929 transitions. [2022-11-02 20:48:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:48:14,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:14,445 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-02 20:48:14,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:14,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:14,658 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reader_nowait_fnErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:14,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:14,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1161534571, now seen corresponding path program 1 times [2022-11-02 20:48:14,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:14,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494916739] [2022-11-02 20:48:14,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:14,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:48:14,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:14,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494916739] [2022-11-02 20:48:14,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494916739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:14,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:14,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:48:14,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112094927] [2022-11-02 20:48:14,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:14,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:48:14,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:14,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:48:14,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:48:14,690 INFO L87 Difference]: Start difference. First operand 403 states and 929 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:14,751 INFO L93 Difference]: Finished difference Result 378 states and 872 transitions. [2022-11-02 20:48:14,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:48:14,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-02 20:48:14,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:14,753 INFO L225 Difference]: With dead ends: 378 [2022-11-02 20:48:14,753 INFO L226 Difference]: Without dead ends: 378 [2022-11-02 20:48:14,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02 20:48:14,754 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:14,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 3 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:48:14,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-11-02 20:48:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2022-11-02 20:48:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 355 states have (on average 2.456338028169014) internal successors, (872), 377 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 872 transitions. [2022-11-02 20:48:14,764 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 872 transitions. Word has length 11 [2022-11-02 20:48:14,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:14,764 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 872 transitions. [2022-11-02 20:48:14,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 872 transitions. [2022-11-02 20:48:14,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:48:14,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:14,765 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-02 20:48:14,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:48:14,766 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:14,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:14,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1161534587, now seen corresponding path program 1 times [2022-11-02 20:48:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:14,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993697631] [2022-11-02 20:48:14,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:14,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:14,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:14,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993697631] [2022-11-02 20:48:14,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993697631] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:14,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592630722] [2022-11-02 20:48:14,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:14,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:14,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:14,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:14,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:48:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:14,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:48:14,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:14,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:14,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592630722] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:14,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:14,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-02 20:48:14,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690737248] [2022-11-02 20:48:14,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:14,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:48:14,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:14,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:48:14,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:48:14,958 INFO L87 Difference]: Start difference. First operand 378 states and 872 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:15,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:15,135 INFO L93 Difference]: Finished difference Result 969 states and 2219 transitions. [2022-11-02 20:48:15,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:48:15,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 11 [2022-11-02 20:48:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:15,140 INFO L225 Difference]: With dead ends: 969 [2022-11-02 20:48:15,140 INFO L226 Difference]: Without dead ends: 969 [2022-11-02 20:48:15,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:48:15,140 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 102 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:15,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 8 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:48:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-11-02 20:48:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 843. [2022-11-02 20:48:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 820 states have (on average 2.5280487804878047) internal successors, (2073), 842 states have internal predecessors, (2073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 2073 transitions. [2022-11-02 20:48:15,168 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 2073 transitions. Word has length 11 [2022-11-02 20:48:15,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:15,168 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 2073 transitions. [2022-11-02 20:48:15,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 2073 transitions. [2022-11-02 20:48:15,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:48:15,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:15,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:15,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:15,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:48:15,385 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:15,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:15,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1489637263, now seen corresponding path program 1 times [2022-11-02 20:48:15,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:15,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473757180] [2022-11-02 20:48:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:15,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,850 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-02 20:48:15,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:15,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473757180] [2022-11-02 20:48:15,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473757180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:15,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:15,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:48:15,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992549351] [2022-11-02 20:48:15,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:15,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:48:15,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:15,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:48:15,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:48:15,852 INFO L87 Difference]: Start difference. First operand 843 states and 2073 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:16,676 INFO L93 Difference]: Finished difference Result 932 states and 2226 transitions. [2022-11-02 20:48:16,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:48:16,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:48:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:16,682 INFO L225 Difference]: With dead ends: 932 [2022-11-02 20:48:16,682 INFO L226 Difference]: Without dead ends: 932 [2022-11-02 20:48:16,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:48:16,683 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:16,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-11-02 20:48:16,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 859. [2022-11-02 20:48:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 836 states have (on average 2.527511961722488) internal successors, (2113), 858 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 2113 transitions. [2022-11-02 20:48:16,715 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 2113 transitions. Word has length 12 [2022-11-02 20:48:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:16,715 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 2113 transitions. [2022-11-02 20:48:16,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 2113 transitions. [2022-11-02 20:48:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:48:16,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:16,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:16,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:48:16,717 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:16,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:16,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1489637249, now seen corresponding path program 1 times [2022-11-02 20:48:16,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:16,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797960516] [2022-11-02 20:48:16,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:16,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:17,120 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-02 20:48:17,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:17,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797960516] [2022-11-02 20:48:17,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797960516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:17,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:17,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:48:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620820121] [2022-11-02 20:48:17,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:17,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:48:17,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:17,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:48:17,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:48:17,122 INFO L87 Difference]: Start difference. First operand 859 states and 2113 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:17,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:17,851 INFO L93 Difference]: Finished difference Result 999 states and 2378 transitions. [2022-11-02 20:48:17,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:48:17,852 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:48:17,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:17,856 INFO L225 Difference]: With dead ends: 999 [2022-11-02 20:48:17,856 INFO L226 Difference]: Without dead ends: 999 [2022-11-02 20:48:17,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:48:17,857 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:17,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:17,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-11-02 20:48:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 859. [2022-11-02 20:48:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 836 states have (on average 2.5155502392344498) internal successors, (2103), 858 states have internal predecessors, (2103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 2103 transitions. [2022-11-02 20:48:17,882 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 2103 transitions. Word has length 12 [2022-11-02 20:48:17,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:17,882 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 2103 transitions. [2022-11-02 20:48:17,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 2103 transitions. [2022-11-02 20:48:17,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:48:17,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:17,883 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:17,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:48:17,884 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:17,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:17,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1488694072, now seen corresponding path program 1 times [2022-11-02 20:48:17,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:17,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989183709] [2022-11-02 20:48:17,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:17,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:18,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:18,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:18,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989183709] [2022-11-02 20:48:18,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989183709] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:18,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039592187] [2022-11-02 20:48:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:18,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:18,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:18,386 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:18,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:48:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:18,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-02 20:48:18,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:18,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:48:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:18,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:18,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-11-02 20:48:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:18,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039592187] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:18,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:18,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 14 [2022-11-02 20:48:18,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981513595] [2022-11-02 20:48:18,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:18,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:18,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:18,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:18,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:18,698 INFO L87 Difference]: Start difference. First operand 859 states and 2103 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:19,392 INFO L93 Difference]: Finished difference Result 1260 states and 2976 transitions. [2022-11-02 20:48:19,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:48:19,393 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 12 [2022-11-02 20:48:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:19,399 INFO L225 Difference]: With dead ends: 1260 [2022-11-02 20:48:19,399 INFO L226 Difference]: Without dead ends: 1260 [2022-11-02 20:48:19,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:48:19,400 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 212 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:19,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 0 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:48:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-11-02 20:48:19,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 819. [2022-11-02 20:48:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 800 states have (on average 2.5125) internal successors, (2010), 818 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2010 transitions. [2022-11-02 20:48:19,428 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2010 transitions. Word has length 12 [2022-11-02 20:48:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:19,428 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 2010 transitions. [2022-11-02 20:48:19,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2010 transitions. [2022-11-02 20:48:19,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:48:19,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:19,429 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:19,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:19,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:19,654 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:19,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:19,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1488694026, now seen corresponding path program 1 times [2022-11-02 20:48:19,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:19,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826026637] [2022-11-02 20:48:19,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:19,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:19,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826026637] [2022-11-02 20:48:19,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826026637] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:19,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001497041] [2022-11-02 20:48:19,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:19,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:19,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:19,932 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:19,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:48:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:20,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-02 20:48:20,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:20,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:48:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:20,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:20,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-11-02 20:48:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:20,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001497041] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:20,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:20,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-11-02 20:48:20,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195933654] [2022-11-02 20:48:20,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:20,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:48:20,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:20,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:48:20,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:48:20,217 INFO L87 Difference]: Start difference. First operand 819 states and 2010 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:20,503 INFO L93 Difference]: Finished difference Result 779 states and 1917 transitions. [2022-11-02 20:48:20,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:48:20,504 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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 12 [2022-11-02 20:48:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:20,507 INFO L225 Difference]: With dead ends: 779 [2022-11-02 20:48:20,507 INFO L226 Difference]: Without dead ends: 779 [2022-11-02 20:48:20,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:48:20,509 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:20,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:48:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-11-02 20:48:20,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 779. [2022-11-02 20:48:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 764 states have (on average 2.5091623036649215) internal successors, (1917), 778 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1917 transitions. [2022-11-02 20:48:20,530 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1917 transitions. Word has length 12 [2022-11-02 20:48:20,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:20,530 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1917 transitions. [2022-11-02 20:48:20,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1917 transitions. [2022-11-02 20:48:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:20,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:20,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:20,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:20,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:48:20,746 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:20,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:20,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1265367308, now seen corresponding path program 1 times [2022-11-02 20:48:20,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:20,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046931229] [2022-11-02 20:48:20,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:20,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:21,433 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-02 20:48:21,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:21,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046931229] [2022-11-02 20:48:21,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046931229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:21,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:21,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:48:21,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708347365] [2022-11-02 20:48:21,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:21,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:48:21,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:21,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:48:21,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:48:21,435 INFO L87 Difference]: Start difference. First operand 779 states and 1917 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:23,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:23,067 INFO L93 Difference]: Finished difference Result 918 states and 2183 transitions. [2022-11-02 20:48:23,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:48:23,067 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:23,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:23,072 INFO L225 Difference]: With dead ends: 918 [2022-11-02 20:48:23,072 INFO L226 Difference]: Without dead ends: 918 [2022-11-02 20:48:23,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:48:23,073 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:23,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:48:23,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-11-02 20:48:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 805. [2022-11-02 20:48:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 790 states have (on average 2.5063291139240507) internal successors, (1980), 804 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1980 transitions. [2022-11-02 20:48:23,102 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1980 transitions. Word has length 14 [2022-11-02 20:48:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:23,103 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 1980 transitions. [2022-11-02 20:48:23,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:23,103 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1980 transitions. [2022-11-02 20:48:23,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:23,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:23,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:23,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:48:23,105 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:23,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:23,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1265367294, now seen corresponding path program 1 times [2022-11-02 20:48:23,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:23,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145971751] [2022-11-02 20:48:23,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:23,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:23,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:23,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145971751] [2022-11-02 20:48:23,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145971751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:23,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:23,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:48:23,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845826153] [2022-11-02 20:48:23,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:23,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:48:23,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:23,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:48:23,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:48:23,662 INFO L87 Difference]: Start difference. First operand 805 states and 1980 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:25,125 INFO L93 Difference]: Finished difference Result 973 states and 2318 transitions. [2022-11-02 20:48:25,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:48:25,125 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:25,130 INFO L225 Difference]: With dead ends: 973 [2022-11-02 20:48:25,130 INFO L226 Difference]: Without dead ends: 973 [2022-11-02 20:48:25,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:48:25,131 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:25,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:48:25,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-11-02 20:48:25,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 793. [2022-11-02 20:48:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 778 states have (on average 2.5038560411311055) internal successors, (1948), 792 states have internal predecessors, (1948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1948 transitions. [2022-11-02 20:48:25,155 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1948 transitions. Word has length 14 [2022-11-02 20:48:25,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:25,155 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1948 transitions. [2022-11-02 20:48:25,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:25,156 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1948 transitions. [2022-11-02 20:48:25,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:25,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:25,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:25,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:48:25,157 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:25,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:25,157 INFO L85 PathProgramCache]: Analyzing trace with hash 410067698, now seen corresponding path program 2 times [2022-11-02 20:48:25,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:25,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444279725] [2022-11-02 20:48:25,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:25,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:25,682 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-02 20:48:25,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:25,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444279725] [2022-11-02 20:48:25,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444279725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:25,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:25,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:48:25,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737406709] [2022-11-02 20:48:25,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:25,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:48:25,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:25,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:48:25,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:48:25,684 INFO L87 Difference]: Start difference. First operand 793 states and 1948 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:26,720 INFO L93 Difference]: Finished difference Result 938 states and 2225 transitions. [2022-11-02 20:48:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:48:26,721 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:26,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:26,726 INFO L225 Difference]: With dead ends: 938 [2022-11-02 20:48:26,726 INFO L226 Difference]: Without dead ends: 938 [2022-11-02 20:48:26,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:48:26,727 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:26,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-11-02 20:48:26,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 817. [2022-11-02 20:48:26,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 802 states have (on average 2.5012468827930174) internal successors, (2006), 816 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 2006 transitions. [2022-11-02 20:48:26,750 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 2006 transitions. Word has length 14 [2022-11-02 20:48:26,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:26,751 INFO L495 AbstractCegarLoop]: Abstraction has 817 states and 2006 transitions. [2022-11-02 20:48:26,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:26,751 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 2006 transitions. [2022-11-02 20:48:26,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:26,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:26,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:26,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:48:26,752 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:26,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:26,753 INFO L85 PathProgramCache]: Analyzing trace with hash 410067684, now seen corresponding path program 2 times [2022-11-02 20:48:26,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:26,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575709846] [2022-11-02 20:48:26,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:26,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:27,319 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-02 20:48:27,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:27,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575709846] [2022-11-02 20:48:27,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575709846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:27,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:27,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:48:27,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150189700] [2022-11-02 20:48:27,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:27,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:48:27,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:27,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:48:27,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:48:27,321 INFO L87 Difference]: Start difference. First operand 817 states and 2006 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:28,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:28,206 INFO L93 Difference]: Finished difference Result 993 states and 2360 transitions. [2022-11-02 20:48:28,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:48:28,206 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:28,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:28,212 INFO L225 Difference]: With dead ends: 993 [2022-11-02 20:48:28,212 INFO L226 Difference]: Without dead ends: 993 [2022-11-02 20:48:28,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:48:28,213 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:28,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:28,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2022-11-02 20:48:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 799. [2022-11-02 20:48:28,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 784 states have (on average 2.501275510204082) internal successors, (1961), 798 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1961 transitions. [2022-11-02 20:48:28,237 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1961 transitions. Word has length 14 [2022-11-02 20:48:28,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:28,237 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 1961 transitions. [2022-11-02 20:48:28,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1961 transitions. [2022-11-02 20:48:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:28,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:28,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:28,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:48:28,238 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:28,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:28,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1821822585, now seen corresponding path program 1 times [2022-11-02 20:48:28,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:28,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43482692] [2022-11-02 20:48:28,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:28,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:28,658 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-02 20:48:28,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:28,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43482692] [2022-11-02 20:48:28,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43482692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:28,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:28,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:28,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739033685] [2022-11-02 20:48:28,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:28,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:28,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:28,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:28,661 INFO L87 Difference]: Start difference. First operand 799 states and 1961 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:29,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:29,380 INFO L93 Difference]: Finished difference Result 1174 states and 2856 transitions. [2022-11-02 20:48:29,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:48:29,381 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:29,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:29,386 INFO L225 Difference]: With dead ends: 1174 [2022-11-02 20:48:29,386 INFO L226 Difference]: Without dead ends: 1174 [2022-11-02 20:48:29,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:48:29,387 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 220 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:29,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:29,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2022-11-02 20:48:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 922. [2022-11-02 20:48:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 907 states have (on average 2.5369349503858873) internal successors, (2301), 921 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 2301 transitions. [2022-11-02 20:48:29,415 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 2301 transitions. Word has length 14 [2022-11-02 20:48:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:29,416 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 2301 transitions. [2022-11-02 20:48:29,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 2301 transitions. [2022-11-02 20:48:29,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:29,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:29,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:29,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:48:29,417 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:29,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:29,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1821822533, now seen corresponding path program 1 times [2022-11-02 20:48:29,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:29,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998505299] [2022-11-02 20:48:29,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:29,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:29,830 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-02 20:48:29,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:29,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998505299] [2022-11-02 20:48:29,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998505299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:29,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:29,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:29,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864235456] [2022-11-02 20:48:29,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:29,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:29,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:29,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:29,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:29,832 INFO L87 Difference]: Start difference. First operand 922 states and 2301 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:30,576 INFO L93 Difference]: Finished difference Result 1174 states and 2826 transitions. [2022-11-02 20:48:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:48:30,576 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:30,581 INFO L225 Difference]: With dead ends: 1174 [2022-11-02 20:48:30,581 INFO L226 Difference]: Without dead ends: 1174 [2022-11-02 20:48:30,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:48:30,582 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 181 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:30,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2022-11-02 20:48:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 798. [2022-11-02 20:48:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 783 states have (on average 2.500638569604087) internal successors, (1958), 797 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:30,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1958 transitions. [2022-11-02 20:48:30,635 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1958 transitions. Word has length 14 [2022-11-02 20:48:30,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:30,635 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 1958 transitions. [2022-11-02 20:48:30,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1958 transitions. [2022-11-02 20:48:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:30,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:30,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:30,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:48:30,638 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:30,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:30,638 INFO L85 PathProgramCache]: Analyzing trace with hash -857756243, now seen corresponding path program 2 times [2022-11-02 20:48:30,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:30,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679779763] [2022-11-02 20:48:30,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:30,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:31,037 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-02 20:48:31,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:31,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679779763] [2022-11-02 20:48:31,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679779763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:31,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:31,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:31,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827822336] [2022-11-02 20:48:31,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:31,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:31,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:31,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:31,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:31,040 INFO L87 Difference]: Start difference. First operand 798 states and 1958 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:32,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:32,128 INFO L93 Difference]: Finished difference Result 1433 states and 3441 transitions. [2022-11-02 20:48:32,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:48:32,129 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:32,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:32,134 INFO L225 Difference]: With dead ends: 1433 [2022-11-02 20:48:32,134 INFO L226 Difference]: Without dead ends: 1433 [2022-11-02 20:48:32,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:48:32,135 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 304 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:32,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:48:32,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2022-11-02 20:48:32,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 923. [2022-11-02 20:48:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 908 states have (on average 2.5341409691629955) internal successors, (2301), 922 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 2301 transitions. [2022-11-02 20:48:32,172 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 2301 transitions. Word has length 14 [2022-11-02 20:48:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:32,172 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 2301 transitions. [2022-11-02 20:48:32,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 2301 transitions. [2022-11-02 20:48:32,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:32,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:32,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:32,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:48:32,174 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:32,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:32,175 INFO L85 PathProgramCache]: Analyzing trace with hash -857756191, now seen corresponding path program 2 times [2022-11-02 20:48:32,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:32,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521020993] [2022-11-02 20:48:32,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:32,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,584 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-02 20:48:32,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:32,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521020993] [2022-11-02 20:48:32,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521020993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:32,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:32,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:32,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861200226] [2022-11-02 20:48:32,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:32,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:32,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:32,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:32,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:32,586 INFO L87 Difference]: Start difference. First operand 923 states and 2301 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:33,735 INFO L93 Difference]: Finished difference Result 1403 states and 3370 transitions. [2022-11-02 20:48:33,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:48:33,736 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:33,740 INFO L225 Difference]: With dead ends: 1403 [2022-11-02 20:48:33,740 INFO L226 Difference]: Without dead ends: 1403 [2022-11-02 20:48:33,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:48:33,741 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 278 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:33,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:48:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2022-11-02 20:48:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 795. [2022-11-02 20:48:33,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 780 states have (on average 2.5012820512820513) internal successors, (1951), 794 states have internal predecessors, (1951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1951 transitions. [2022-11-02 20:48:33,767 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1951 transitions. Word has length 14 [2022-11-02 20:48:33,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:33,767 INFO L495 AbstractCegarLoop]: Abstraction has 795 states and 1951 transitions. [2022-11-02 20:48:33,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1951 transitions. [2022-11-02 20:48:33,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:33,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:33,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:33,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:48:33,768 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:33,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1673707207, now seen corresponding path program 3 times [2022-11-02 20:48:33,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:33,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607184713] [2022-11-02 20:48:33,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:33,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:34,157 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-02 20:48:34,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:34,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607184713] [2022-11-02 20:48:34,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607184713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:34,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:34,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:34,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570885131] [2022-11-02 20:48:34,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:34,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:34,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:34,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:34,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:34,159 INFO L87 Difference]: Start difference. First operand 795 states and 1951 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:34,992 INFO L93 Difference]: Finished difference Result 1723 states and 4107 transitions. [2022-11-02 20:48:34,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:48:34,993 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:34,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:34,998 INFO L225 Difference]: With dead ends: 1723 [2022-11-02 20:48:34,998 INFO L226 Difference]: Without dead ends: 1723 [2022-11-02 20:48:34,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:48:34,999 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 223 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:34,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 7 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:48:35,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2022-11-02 20:48:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 940. [2022-11-02 20:48:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 925 states have (on average 2.5275675675675675) internal successors, (2338), 939 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 2338 transitions. [2022-11-02 20:48:35,032 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 2338 transitions. Word has length 14 [2022-11-02 20:48:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:35,032 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 2338 transitions. [2022-11-02 20:48:35,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 2338 transitions. [2022-11-02 20:48:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:35,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:35,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:35,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:48:35,034 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:35,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1673707259, now seen corresponding path program 3 times [2022-11-02 20:48:35,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:35,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665222845] [2022-11-02 20:48:35,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:35,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:35,460 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-02 20:48:35,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:35,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665222845] [2022-11-02 20:48:35,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665222845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:35,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:35,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:35,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514539142] [2022-11-02 20:48:35,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:35,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:35,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:35,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:35,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:35,461 INFO L87 Difference]: Start difference. First operand 940 states and 2338 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:36,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:36,388 INFO L93 Difference]: Finished difference Result 1693 states and 4036 transitions. [2022-11-02 20:48:36,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:48:36,389 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:36,393 INFO L225 Difference]: With dead ends: 1693 [2022-11-02 20:48:36,393 INFO L226 Difference]: Without dead ends: 1693 [2022-11-02 20:48:36,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:48:36,394 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 176 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:36,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 7 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:48:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2022-11-02 20:48:36,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 815. [2022-11-02 20:48:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 800 states have (on average 2.49375) internal successors, (1995), 814 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1995 transitions. [2022-11-02 20:48:36,424 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1995 transitions. Word has length 14 [2022-11-02 20:48:36,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:36,424 INFO L495 AbstractCegarLoop]: Abstraction has 815 states and 1995 transitions. [2022-11-02 20:48:36,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1995 transitions. [2022-11-02 20:48:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:36,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:36,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:36,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:48:36,426 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:36,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:36,427 INFO L85 PathProgramCache]: Analyzing trace with hash -89260879, now seen corresponding path program 4 times [2022-11-02 20:48:36,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:36,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460529260] [2022-11-02 20:48:36,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:36,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:36,835 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-02 20:48:36,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:36,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460529260] [2022-11-02 20:48:36,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460529260] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:36,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:36,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:36,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268979252] [2022-11-02 20:48:36,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:36,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:36,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:36,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:36,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:36,839 INFO L87 Difference]: Start difference. First operand 815 states and 1995 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:38,054 INFO L93 Difference]: Finished difference Result 1923 states and 4607 transitions. [2022-11-02 20:48:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:48:38,058 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:38,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:38,064 INFO L225 Difference]: With dead ends: 1923 [2022-11-02 20:48:38,064 INFO L226 Difference]: Without dead ends: 1923 [2022-11-02 20:48:38,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=544, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:48:38,067 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 236 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:38,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 4 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:48:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2022-11-02 20:48:38,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 942. [2022-11-02 20:48:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 927 states have (on average 2.527508090614887) internal successors, (2343), 941 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 2343 transitions. [2022-11-02 20:48:38,101 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 2343 transitions. Word has length 14 [2022-11-02 20:48:38,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:38,101 INFO L495 AbstractCegarLoop]: Abstraction has 942 states and 2343 transitions. [2022-11-02 20:48:38,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 2343 transitions. [2022-11-02 20:48:38,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:38,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:38,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:38,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:48:38,103 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:38,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:38,103 INFO L85 PathProgramCache]: Analyzing trace with hash -89260827, now seen corresponding path program 4 times [2022-11-02 20:48:38,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:38,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650578128] [2022-11-02 20:48:38,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:38,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:38,519 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-02 20:48:38,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:38,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650578128] [2022-11-02 20:48:38,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650578128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:38,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:38,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:38,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415331017] [2022-11-02 20:48:38,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:38,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:38,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:38,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:38,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:38,520 INFO L87 Difference]: Start difference. First operand 942 states and 2343 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:39,607 INFO L93 Difference]: Finished difference Result 1893 states and 4536 transitions. [2022-11-02 20:48:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:48:39,608 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:39,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:39,612 INFO L225 Difference]: With dead ends: 1893 [2022-11-02 20:48:39,612 INFO L226 Difference]: Without dead ends: 1893 [2022-11-02 20:48:39,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=544, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:48:39,613 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 234 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:39,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 4 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:48:39,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2022-11-02 20:48:39,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 815. [2022-11-02 20:48:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 800 states have (on average 2.49375) internal successors, (1995), 814 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1995 transitions. [2022-11-02 20:48:39,641 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1995 transitions. Word has length 14 [2022-11-02 20:48:39,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:39,642 INFO L495 AbstractCegarLoop]: Abstraction has 815 states and 1995 transitions. [2022-11-02 20:48:39,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:39,642 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1995 transitions. [2022-11-02 20:48:39,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:39,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:39,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:39,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:48:39,643 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:39,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:39,644 INFO L85 PathProgramCache]: Analyzing trace with hash -839385582, now seen corresponding path program 3 times [2022-11-02 20:48:39,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:39,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786476552] [2022-11-02 20:48:39,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:39,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:40,167 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-02 20:48:40,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:40,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786476552] [2022-11-02 20:48:40,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786476552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:40,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:40,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:48:40,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393615295] [2022-11-02 20:48:40,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:40,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:48:40,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:40,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:48:40,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:48:40,168 INFO L87 Difference]: Start difference. First operand 815 states and 1995 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:41,164 INFO L93 Difference]: Finished difference Result 948 states and 2247 transitions. [2022-11-02 20:48:41,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:48:41,165 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:41,167 INFO L225 Difference]: With dead ends: 948 [2022-11-02 20:48:41,168 INFO L226 Difference]: Without dead ends: 948 [2022-11-02 20:48:41,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=226, Invalid=586, Unknown=0, NotChecked=0, Total=812 [2022-11-02 20:48:41,169 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:41,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2022-11-02 20:48:41,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 839. [2022-11-02 20:48:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 824 states have (on average 2.491504854368932) internal successors, (2053), 838 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 2053 transitions. [2022-11-02 20:48:41,189 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 2053 transitions. Word has length 14 [2022-11-02 20:48:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:41,190 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 2053 transitions. [2022-11-02 20:48:41,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 2053 transitions. [2022-11-02 20:48:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:41,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:41,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:41,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:48:41,191 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:41,192 INFO L85 PathProgramCache]: Analyzing trace with hash -839385596, now seen corresponding path program 3 times [2022-11-02 20:48:41,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:41,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062860345] [2022-11-02 20:48:41,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:41,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:41,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-02 20:48:41,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:41,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062860345] [2022-11-02 20:48:41,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062860345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:41,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:41,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:48:41,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247038700] [2022-11-02 20:48:41,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:41,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:48:41,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:41,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:48:41,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:48:41,653 INFO L87 Difference]: Start difference. First operand 839 states and 2053 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:42,581 INFO L93 Difference]: Finished difference Result 1011 states and 2399 transitions. [2022-11-02 20:48:42,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:48:42,581 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:42,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:42,584 INFO L225 Difference]: With dead ends: 1011 [2022-11-02 20:48:42,584 INFO L226 Difference]: Without dead ends: 1011 [2022-11-02 20:48:42,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=586, Unknown=0, NotChecked=0, Total=812 [2022-11-02 20:48:42,585 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:42,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-11-02 20:48:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 815. [2022-11-02 20:48:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 800 states have (on average 2.49375) internal successors, (1995), 814 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1995 transitions. [2022-11-02 20:48:42,605 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1995 transitions. Word has length 14 [2022-11-02 20:48:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:42,606 INFO L495 AbstractCegarLoop]: Abstraction has 815 states and 1995 transitions. [2022-11-02 20:48:42,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1995 transitions. [2022-11-02 20:48:42,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:42,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:42,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:42,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:48:42,607 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:42,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:42,608 INFO L85 PathProgramCache]: Analyzing trace with hash 324596373, now seen corresponding path program 5 times [2022-11-02 20:48:42,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:42,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409178401] [2022-11-02 20:48:42,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:42,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:42,978 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-02 20:48:42,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:42,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409178401] [2022-11-02 20:48:42,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409178401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:42,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:42,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:42,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831634124] [2022-11-02 20:48:42,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:42,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:42,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:42,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:42,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:42,979 INFO L87 Difference]: Start difference. First operand 815 states and 1995 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:43,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:43,850 INFO L93 Difference]: Finished difference Result 1776 states and 4220 transitions. [2022-11-02 20:48:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:48:43,850 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:43,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:43,855 INFO L225 Difference]: With dead ends: 1776 [2022-11-02 20:48:43,855 INFO L226 Difference]: Without dead ends: 1776 [2022-11-02 20:48:43,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:48:43,856 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 206 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:43,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 9 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:48:43,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2022-11-02 20:48:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 959. [2022-11-02 20:48:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 944 states have (on average 2.5211864406779663) internal successors, (2380), 958 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 2380 transitions. [2022-11-02 20:48:43,885 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 2380 transitions. Word has length 14 [2022-11-02 20:48:43,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:43,885 INFO L495 AbstractCegarLoop]: Abstraction has 959 states and 2380 transitions. [2022-11-02 20:48:43,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 2380 transitions. [2022-11-02 20:48:43,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:43,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:43,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:43,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:48:43,887 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:43,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:43,887 INFO L85 PathProgramCache]: Analyzing trace with hash 324596425, now seen corresponding path program 5 times [2022-11-02 20:48:43,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:43,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101873766] [2022-11-02 20:48:43,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:43,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:44,238 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-02 20:48:44,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:44,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101873766] [2022-11-02 20:48:44,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101873766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:44,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:44,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:44,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881968561] [2022-11-02 20:48:44,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:44,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:44,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:44,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:44,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:44,240 INFO L87 Difference]: Start difference. First operand 959 states and 2380 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:45,135 INFO L93 Difference]: Finished difference Result 1746 states and 4149 transitions. [2022-11-02 20:48:45,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:48:45,135 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:45,141 INFO L225 Difference]: With dead ends: 1746 [2022-11-02 20:48:45,141 INFO L226 Difference]: Without dead ends: 1746 [2022-11-02 20:48:45,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:48:45,142 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 171 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:45,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 9 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:48:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2022-11-02 20:48:45,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 815. [2022-11-02 20:48:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 800 states have (on average 2.49375) internal successors, (1995), 814 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1995 transitions. [2022-11-02 20:48:45,167 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1995 transitions. Word has length 14 [2022-11-02 20:48:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:45,167 INFO L495 AbstractCegarLoop]: Abstraction has 815 states and 1995 transitions. [2022-11-02 20:48:45,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1995 transitions. [2022-11-02 20:48:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:45,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:45,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:45,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:48:45,168 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:45,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1438371713, now seen corresponding path program 6 times [2022-11-02 20:48:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:45,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931668348] [2022-11-02 20:48:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:45,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:45,529 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-02 20:48:45,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:45,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931668348] [2022-11-02 20:48:45,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931668348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:45,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:45,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:45,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574217064] [2022-11-02 20:48:45,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:45,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:45,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:45,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:45,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:45,533 INFO L87 Difference]: Start difference. First operand 815 states and 1995 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:46,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:46,596 INFO L93 Difference]: Finished difference Result 1781 states and 4303 transitions. [2022-11-02 20:48:46,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:48:46,596 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:46,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:46,601 INFO L225 Difference]: With dead ends: 1781 [2022-11-02 20:48:46,601 INFO L226 Difference]: Without dead ends: 1781 [2022-11-02 20:48:46,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:48:46,602 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 202 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:46,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 5 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:48:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2022-11-02 20:48:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 932. [2022-11-02 20:48:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 917 states have (on average 2.5212649945474372) internal successors, (2312), 931 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 2312 transitions. [2022-11-02 20:48:46,629 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 2312 transitions. Word has length 14 [2022-11-02 20:48:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:46,630 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 2312 transitions. [2022-11-02 20:48:46,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 2312 transitions. [2022-11-02 20:48:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:46,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:46,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:46,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:48:46,631 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:46,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:46,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1438371661, now seen corresponding path program 6 times [2022-11-02 20:48:46,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:46,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128340240] [2022-11-02 20:48:46,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:46,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:46,981 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-02 20:48:46,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:46,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128340240] [2022-11-02 20:48:46,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128340240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:46,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:46,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:46,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067692732] [2022-11-02 20:48:46,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:46,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:46,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:46,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:46,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:46,983 INFO L87 Difference]: Start difference. First operand 932 states and 2312 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:47,941 INFO L93 Difference]: Finished difference Result 1780 states and 4272 transitions. [2022-11-02 20:48:47,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:48:47,941 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:47,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:47,946 INFO L225 Difference]: With dead ends: 1780 [2022-11-02 20:48:47,946 INFO L226 Difference]: Without dead ends: 1780 [2022-11-02 20:48:47,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:48:47,947 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 220 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:47,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 5 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:48:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2022-11-02 20:48:47,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 801. [2022-11-02 20:48:47,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 786 states have (on average 2.484732824427481) internal successors, (1953), 800 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:47,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1953 transitions. [2022-11-02 20:48:47,971 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1953 transitions. Word has length 14 [2022-11-02 20:48:47,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:47,972 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 1953 transitions. [2022-11-02 20:48:47,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:47,972 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1953 transitions. [2022-11-02 20:48:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:47,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:47,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:47,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:48:47,973 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:47,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:47,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2106470880, now seen corresponding path program 4 times [2022-11-02 20:48:47,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:47,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54754324] [2022-11-02 20:48:47,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:47,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:48,454 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-02 20:48:48,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:48,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54754324] [2022-11-02 20:48:48,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54754324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:48,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:48,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:48:48,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018765507] [2022-11-02 20:48:48,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:48,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:48:48,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:48,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:48:48,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:48:48,457 INFO L87 Difference]: Start difference. First operand 801 states and 1953 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:49,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:49,235 INFO L93 Difference]: Finished difference Result 919 states and 2171 transitions. [2022-11-02 20:48:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:48:49,236 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:49,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:49,238 INFO L225 Difference]: With dead ends: 919 [2022-11-02 20:48:49,238 INFO L226 Difference]: Without dead ends: 919 [2022-11-02 20:48:49,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:48:49,239 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:49,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:49,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-11-02 20:48:49,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 819. [2022-11-02 20:48:49,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 804 states have (on average 2.485074626865672) internal successors, (1998), 818 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:49,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1998 transitions. [2022-11-02 20:48:49,255 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1998 transitions. Word has length 14 [2022-11-02 20:48:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:49,255 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1998 transitions. [2022-11-02 20:48:49,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1998 transitions. [2022-11-02 20:48:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:49,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:49,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:49,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:48:49,256 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:49,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:49,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2106470866, now seen corresponding path program 4 times [2022-11-02 20:48:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:49,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722951766] [2022-11-02 20:48:49,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:49,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:49,691 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-02 20:48:49,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:49,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722951766] [2022-11-02 20:48:49,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722951766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:49,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:49,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:48:49,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557775081] [2022-11-02 20:48:49,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:49,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:48:49,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:49,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:48:49,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:48:49,693 INFO L87 Difference]: Start difference. First operand 819 states and 1998 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:50,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:50,478 INFO L93 Difference]: Finished difference Result 982 states and 2323 transitions. [2022-11-02 20:48:50,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:48:50,478 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:50,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:50,480 INFO L225 Difference]: With dead ends: 982 [2022-11-02 20:48:50,480 INFO L226 Difference]: Without dead ends: 982 [2022-11-02 20:48:50,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:48:50,481 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:50,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-11-02 20:48:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 794. [2022-11-02 20:48:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 779 states have (on average 2.4878048780487805) internal successors, (1938), 793 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1938 transitions. [2022-11-02 20:48:50,500 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1938 transitions. Word has length 14 [2022-11-02 20:48:50,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:50,500 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1938 transitions. [2022-11-02 20:48:50,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1938 transitions. [2022-11-02 20:48:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:50,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:50,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:50,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 20:48:50,501 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:50,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:50,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1805819731, now seen corresponding path program 7 times [2022-11-02 20:48:50,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:50,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262690227] [2022-11-02 20:48:50,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:50,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:50,848 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-02 20:48:50,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:50,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262690227] [2022-11-02 20:48:50,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262690227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:50,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:50,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:50,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634484172] [2022-11-02 20:48:50,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:50,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:50,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:50,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:50,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:50,850 INFO L87 Difference]: Start difference. First operand 794 states and 1938 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:51,699 INFO L93 Difference]: Finished difference Result 1111 states and 2617 transitions. [2022-11-02 20:48:51,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:48:51,699 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:51,701 INFO L225 Difference]: With dead ends: 1111 [2022-11-02 20:48:51,702 INFO L226 Difference]: Without dead ends: 1111 [2022-11-02 20:48:51,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:48:51,703 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 138 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:51,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 9 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:48:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-11-02 20:48:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 794. [2022-11-02 20:48:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 779 states have (on average 2.449293966623877) internal successors, (1908), 793 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1908 transitions. [2022-11-02 20:48:51,721 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1908 transitions. Word has length 14 [2022-11-02 20:48:51,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:51,721 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1908 transitions. [2022-11-02 20:48:51,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1908 transitions. [2022-11-02 20:48:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:51,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:51,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:51,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 20:48:51,722 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:51,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1805819679, now seen corresponding path program 7 times [2022-11-02 20:48:51,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:51,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395824242] [2022-11-02 20:48:51,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:51,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:52,071 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-02 20:48:52,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:52,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395824242] [2022-11-02 20:48:52,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395824242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:52,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:52,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:52,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355685931] [2022-11-02 20:48:52,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:52,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:52,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:52,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:52,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:52,073 INFO L87 Difference]: Start difference. First operand 794 states and 1908 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:52,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:52,845 INFO L93 Difference]: Finished difference Result 1081 states and 2546 transitions. [2022-11-02 20:48:52,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:48:52,846 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:48:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:52,847 INFO L225 Difference]: With dead ends: 1081 [2022-11-02 20:48:52,847 INFO L226 Difference]: Without dead ends: 1081 [2022-11-02 20:48:52,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:48:52,848 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 132 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:52,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 9 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:52,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2022-11-02 20:48:52,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 662. [2022-11-02 20:48:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 647 states have (on average 2.41112828438949) internal successors, (1560), 661 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1560 transitions. [2022-11-02 20:48:52,864 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1560 transitions. Word has length 14 [2022-11-02 20:48:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:52,864 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 1560 transitions. [2022-11-02 20:48:52,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1560 transitions. [2022-11-02 20:48:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:52,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:52,865 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:52,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 20:48:52,866 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:52,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash -437053874, now seen corresponding path program 1 times [2022-11-02 20:48:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:52,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085113803] [2022-11-02 20:48:52,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:52,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:53,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:53,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085113803] [2022-11-02 20:48:53,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085113803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:53,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795159223] [2022-11-02 20:48:53,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:53,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:53,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:53,027 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:53,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:48:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:53,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-02 20:48:53,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:53,246 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-02 20:48:53,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 31 [2022-11-02 20:48:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:53,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:53,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2022-11-02 20:48:53,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-11-02 20:48:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:54,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795159223] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:54,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:54,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2022-11-02 20:48:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757389223] [2022-11-02 20:48:54,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:54,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:48:54,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:54,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:48:54,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=233, Unknown=2, NotChecked=0, Total=306 [2022-11-02 20:48:54,490 INFO L87 Difference]: Start difference. First operand 662 states and 1560 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:57,283 INFO L93 Difference]: Finished difference Result 1752 states and 4422 transitions. [2022-11-02 20:48:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:48:57,283 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:57,286 INFO L225 Difference]: With dead ends: 1752 [2022-11-02 20:48:57,286 INFO L226 Difference]: Without dead ends: 1752 [2022-11-02 20:48:57,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=302, Invalid=814, Unknown=6, NotChecked=0, Total=1122 [2022-11-02 20:48:57,287 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 245 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:57,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 7 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 487 Invalid, 0 Unknown, 314 Unchecked, 0.4s Time] [2022-11-02 20:48:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2022-11-02 20:48:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1208. [2022-11-02 20:48:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 1193 states have (on average 2.5875943000838224) internal successors, (3087), 1207 states have internal predecessors, (3087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 3087 transitions. [2022-11-02 20:48:57,317 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 3087 transitions. Word has length 16 [2022-11-02 20:48:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:57,318 INFO L495 AbstractCegarLoop]: Abstraction has 1208 states and 3087 transitions. [2022-11-02 20:48:57,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 3087 transitions. [2022-11-02 20:48:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:57,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:57,319 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:57,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:57,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-11-02 20:48:57,534 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:48:57,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:57,535 INFO L85 PathProgramCache]: Analyzing trace with hash -437053822, now seen corresponding path program 1 times [2022-11-02 20:48:57,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:57,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222250301] [2022-11-02 20:48:57,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:57,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:57,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:57,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222250301] [2022-11-02 20:48:57,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222250301] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:57,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877218851] [2022-11-02 20:48:57,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:57,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:57,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:57,712 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:57,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:48:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:57,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-02 20:48:57,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:57,937 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-02 20:48:57,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 33 [2022-11-02 20:48:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:57,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:00,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-11-02 20:49:00,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2022-11-02 20:49:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:00,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877218851] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:00,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:00,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2022-11-02 20:49:00,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696911699] [2022-11-02 20:49:00,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:00,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:49:00,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:00,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:49:00,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=234, Unknown=1, NotChecked=0, Total=306 [2022-11-02 20:49:00,198 INFO L87 Difference]: Start difference. First operand 1208 states and 3087 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:08,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:08,758 INFO L93 Difference]: Finished difference Result 2918 states and 7253 transitions. [2022-11-02 20:49:08,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:49:08,758 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 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 16 [2022-11-02 20:49:08,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:08,764 INFO L225 Difference]: With dead ends: 2918 [2022-11-02 20:49:08,764 INFO L226 Difference]: Without dead ends: 2918 [2022-11-02 20:49:08,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=240, Invalid=876, Unknown=6, NotChecked=0, Total=1122 [2022-11-02 20:49:08,765 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 305 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 519 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:08,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 10 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 529 Invalid, 0 Unknown, 519 Unchecked, 0.4s Time] [2022-11-02 20:49:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2022-11-02 20:49:08,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 2070. [2022-11-02 20:49:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2070 states, 2055 states have (on average 2.634549878345499) internal successors, (5414), 2069 states have internal predecessors, (5414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 5414 transitions. [2022-11-02 20:49:08,819 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 5414 transitions. Word has length 16 [2022-11-02 20:49:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:08,819 INFO L495 AbstractCegarLoop]: Abstraction has 2070 states and 5414 transitions. [2022-11-02 20:49:08,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 5414 transitions. [2022-11-02 20:49:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:49:08,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:08,821 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:08,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:09,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-11-02 20:49:09,036 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:49:09,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:09,037 INFO L85 PathProgramCache]: Analyzing trace with hash -31196928, now seen corresponding path program 1 times [2022-11-02 20:49:09,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:09,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354882005] [2022-11-02 20:49:09,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:09,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:09,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:09,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354882005] [2022-11-02 20:49:09,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354882005] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:09,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648147026] [2022-11-02 20:49:09,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:09,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:09,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:09,403 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:09,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:49:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:09,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-02 20:49:09,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:09,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:09,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:49:09,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:09,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-02 20:49:09,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-02 20:49:10,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 72 [2022-11-02 20:49:10,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:10,288 INFO L356 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-11-02 20:49:10,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 44 [2022-11-02 20:49:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:10,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:11,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648147026] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:11,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:11,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 34 [2022-11-02 20:49:11,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472064036] [2022-11-02 20:49:11,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:11,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-02 20:49:11,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:11,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-02 20:49:11,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2022-11-02 20:49:11,806 INFO L87 Difference]: Start difference. First operand 2070 states and 5414 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:16,422 INFO L93 Difference]: Finished difference Result 3261 states and 8141 transitions. [2022-11-02 20:49:16,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-02 20:49:16,423 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 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 16 [2022-11-02 20:49:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:16,428 INFO L225 Difference]: With dead ends: 3261 [2022-11-02 20:49:16,428 INFO L226 Difference]: Without dead ends: 3261 [2022-11-02 20:49:16,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 7 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1000, Invalid=5006, Unknown=0, NotChecked=0, Total=6006 [2022-11-02 20:49:16,430 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 611 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1111 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:16,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 951 Invalid, 0 Unknown, 1111 Unchecked, 0.9s Time] [2022-11-02 20:49:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2022-11-02 20:49:16,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 2413. [2022-11-02 20:49:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2413 states, 2398 states have (on average 2.622602168473728) internal successors, (6289), 2412 states have internal predecessors, (6289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 6289 transitions. [2022-11-02 20:49:16,488 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 6289 transitions. Word has length 16 [2022-11-02 20:49:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:16,488 INFO L495 AbstractCegarLoop]: Abstraction has 2413 states and 6289 transitions. [2022-11-02 20:49:16,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 6289 transitions. [2022-11-02 20:49:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:49:16,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:16,489 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:16,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:16,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-11-02 20:49:16,705 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_nowait_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_nowait_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-02 20:49:16,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:16,706 INFO L85 PathProgramCache]: Analyzing trace with hash -31196942, now seen corresponding path program 1 times [2022-11-02 20:49:16,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:16,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221691508] [2022-11-02 20:49:16,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:16,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:17,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:17,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221691508] [2022-11-02 20:49:17,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221691508] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:17,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005645582] [2022-11-02 20:49:17,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:17,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:17,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:17,155 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:17,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dda63f6a-5af3-47ae-ad65-92b0c25cc749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:49:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:17,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-02 20:49:17,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:17,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:17,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:49:17,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:17,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:49:17,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-02 20:49:17,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-02 20:49:17,760 INFO L356 Elim1Store]: treesize reduction 18, result has 47.1 percent of original size [2022-11-02 20:49:17,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 32 [2022-11-02 20:49:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:17,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:22,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1021 Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_1021)) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base|) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset|) 2147483647) (not (<= v_ArrVal_1021 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) is different from false [2022-11-02 20:49:34,262 WARN L234 SmtUtils]: Spent 11.37s on a formula simplification. DAG size of input: 48 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:49:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-02 20:49:40,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005645582] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:40,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:40,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2022-11-02 20:49:40,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142051752] [2022-11-02 20:49:40,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:40,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-02 20:49:40,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:40,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-02 20:49:40,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=705, Unknown=9, NotChecked=54, Total=870 [2022-11-02 20:49:40,108 INFO L87 Difference]: Start difference. First operand 2413 states and 6289 transitions. Second operand has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:41,535 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= |c_ULTIMATE.start_ring_enqueue_~x#1| 1) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (<= (select (select |c_#memory_int| |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base|) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset|) 3) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|) (<= (select .cse0 0) 3) (<= 0 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.offset|)) (= |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset| 0) (<= 0 (select .cse1 |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.offset|)) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.offset| 0) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (<= |c_ULTIMATE.start_writer_fn_~i~1#1| 0) (<= 0 (select (select |c_#memory_int| |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base|) |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.offset|)) (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) (= |c_ULTIMATE.start_writer_fn_~i~1#1| 0) (forall ((v_ArrVal_1021 Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse0 (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_1021)) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base|) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset|) 2147483647) (not (<= v_ArrVal_1021 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (= |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| 0))) is different from false [2022-11-02 20:49:42,058 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|))) (and (= |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base| |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= |c_ULTIMATE.start_ring_enqueue_~x#1| 1) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|) (<= 0 (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|)) (= |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset| 0) (<= (select (select |c_#memory_int| |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset|) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1|) (<= 0 (select .cse0 |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.offset|)) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.offset| 0) (forall ((v_ArrVal_1021 Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_1021)) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset|) 2147483647) (not (<= v_ArrVal_1021 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (<= 0 (select (select |c_#memory_int| |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base|) 0)) (<= |c_ULTIMATE.start_writer_fn_~i~1#1| 0) (= |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset| |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset|) (<= 0 (select (select |c_#memory_int| |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base|) |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.offset|)) (= |c_ULTIMATE.start_writer_fn_~i~1#1| 0) (= |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) is different from false [2022-11-02 20:49:44,603 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ring_enqueue_~x#1| 1) (<= (select (select |c_#memory_int| |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base|) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset|) 3) (= |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset| 0) (forall ((v_ArrVal_1021 Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_1021)) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base|) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset|) 2147483647) (not (<= v_ArrVal_1021 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (= |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) is different from false [2022-11-02 20:49:57,875 WARN L234 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:50:00,556 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= |c_ULTIMATE.start_ring_enqueue_~x#1| 1) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.offset| 0) (forall ((v_ArrVal_1021 Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_1021)) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset|) 2147483647) (not (<= v_ArrVal_1021 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (forall ((v_ArrVal_1020 Int) (v_ArrVal_1021 Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (not (<= (+ v_ArrVal_1020 4) (mod (+ |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| 1) 4))) (< (select (select (let ((.cse0 (store |c_#memory_int| |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base| (store (select |c_#memory_int| |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| v_ArrVal_1020)))) (store .cse0 |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select .cse0 |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_1021))) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base|) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset|) 2147483647) (not (<= v_ArrVal_1021 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (= |c_ULTIMATE.start_writer_fn_~i~1#1| 0)) is different from false [2022-11-02 20:50:36,132 WARN L234 SmtUtils]: Spent 35.52s on a formula simplification. DAG size of input: 63 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:50:45,077 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.offset| 0) (let ((.cse3 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (let ((.cse1 (= |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset| .cse3)) (.cse2 (= |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (or (and (<= (select .cse0 |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset|) 3) (not .cse1) .cse2) (and (<= |c_ULTIMATE.start_ring_enqueue_~x#1| 1) .cse1 (= .cse3 0) .cse2)))) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (= |c_ULTIMATE.start_writer_fn_~i~1#1| 0) (forall ((v_ArrVal_1021 Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse0 (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_1021)) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base|) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset|) 2147483647) (not (<= v_ArrVal_1021 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (<= (select (select |c_#memory_int| |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset|) 3))) is different from false [2022-11-02 20:50:47,090 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.offset| 0) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (= |c_ULTIMATE.start_writer_fn_~i~1#1| 0) (forall ((v_ArrVal_1021 Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_1021)) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base|) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset|) 2147483647) (not (<= v_ArrVal_1021 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (<= (select (select |c_#memory_int| |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset|) 3)) is different from false [2022-11-02 20:50:49,200 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_1021)) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base|) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset|) 2147483647) (not (<= v_ArrVal_1021 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (<= (select (select |c_#memory_int| |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset|) 3)) is different from false [2022-11-02 20:51:00,528 WARN L234 SmtUtils]: Spent 10.36s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:51:01,479 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (and (forall ((v_ArrVal_1021 Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse0 (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_1021)) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset|) 2147483647) (not (<= v_ArrVal_1021 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (let ((.cse3 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4))) (let ((.cse1 (= |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| .cse3)) (.cse2 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base|))) (or (and (<= (select .cse0 |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset|) 3) (not .cse1) .cse2) (and (<= |c_ULTIMATE.start_ring_enqueue_~x#1| 1) .cse1 (= .cse3 0) .cse2)))))) is different from false [2022-11-02 20:51:35,507 WARN L234 SmtUtils]: Spent 33.81s on a formula simplification. DAG size of input: 59 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:51:47,029 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ring_enqueue_~x#1| 1) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.offset| 0) (forall ((v_ArrVal_1021 Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_1021)) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset|) 2147483647) (not (<= v_ArrVal_1021 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (forall ((v_ArrVal_1020 Int) (v_ArrVal_1021 Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (not (<= (+ v_ArrVal_1020 4) (mod (+ |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| 1) 4))) (< (select (select (let ((.cse0 (store |c_#memory_int| |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base| (store (select |c_#memory_int| |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| v_ArrVal_1020)))) (store .cse0 |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select .cse0 |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_1021))) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base|) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset|) 2147483647) (not (<= v_ArrVal_1021 |c_ULTIMATE.start_ring_enqueue_~x#1|))))) is different from false [2022-11-02 20:51:48,403 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= |c_ULTIMATE.start_ring_enqueue_~x#1| 1) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= |c_reader_nowait_fnThread1of1ForFork0_#in~arg#1.offset| 0) (forall ((v_ArrVal_1021 Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_1021)) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset|) 2147483647) (not (<= v_ArrVal_1021 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (forall ((v_ArrVal_1020 Int) (v_ArrVal_1021 Int) (|ULTIMATE.start_ring_enqueue_~r#1.offset| Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (not (<= (+ v_ArrVal_1020 4) (mod (+ |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| 1) 4))) (< (select (select (let ((.cse0 (store |c_#memory_int| |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base| (store (select |c_#memory_int| |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.base|) |c_reader_nowait_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| v_ArrVal_1020)))) (store .cse0 |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (select .cse0 |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |ULTIMATE.start_ring_enqueue_~r#1.offset| 4) v_ArrVal_1021))) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.base|) |c_reader_nowait_fnThread1of1ForFork0_~r~2#1.offset|) 2147483647) (not (<= v_ArrVal_1021 |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (= |c_ULTIMATE.start_writer_fn_~i~1#1| 0)) is different from false