./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue.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_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/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_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/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_a1200f41-5422-4eac-bc86-8bf9ab036866/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 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- 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:45:53,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:45:53,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:45:53,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:45:53,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:45:53,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:45:53,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:45:53,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:45:53,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:45:53,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:45:53,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:45:53,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:45:53,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:45:53,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:45:53,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:45:53,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:45:53,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:45:53,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:45:53,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:45:53,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:45:53,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:45:53,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:45:53,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:45:53,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:45:53,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:45:53,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:45:53,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:45:53,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:45:53,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:45:53,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:45:53,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:45:53,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:45:53,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:45:53,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:45:53,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:45:53,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:45:53,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:45:53,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:45:53,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:45:53,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:45:53,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:45:53,608 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-02 20:45:53,653 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:45:53,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:45:53,654 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:45:53,654 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:45:53,655 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:45:53,656 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:45:53,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:45:53,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:45:53,657 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:45:53,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:45:53,659 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:45:53,659 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:45:53,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:45:53,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:45:53,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:45:53,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:45:53,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:45:53,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:45:53,660 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-02 20:45:53,661 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:45:53,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:45:53,661 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:45:53,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:45:53,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:45:53,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:45:53,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:45:53,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:45:53,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:45:53,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:45:53,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:45:53,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:45:53,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:45:53,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:45:53,664 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_a1200f41-5422-4eac-bc86-8bf9ab036866/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_a1200f41-5422-4eac-bc86-8bf9ab036866/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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2022-11-02 20:45:53,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:45:53,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:45:53,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:45:53,995 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:45:53,995 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:45:53,997 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread/queue.i [2022-11-02 20:45:54,078 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/data/6ca6a6210/5f7673f53cc84dd58d4a51bade7feecf/FLAG503a16060 [2022-11-02 20:45:54,714 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:45:54,714 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/sv-benchmarks/c/pthread/queue.i [2022-11-02 20:45:54,745 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/data/6ca6a6210/5f7673f53cc84dd58d4a51bade7feecf/FLAG503a16060 [2022-11-02 20:45:54,970 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/data/6ca6a6210/5f7673f53cc84dd58d4a51bade7feecf [2022-11-02 20:45:54,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:45:54,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:45:54,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:45:54,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:45:54,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:45:54,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:45:54" (1/1) ... [2022-11-02 20:45:54,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5f3899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:54, skipping insertion in model container [2022-11-02 20:45:54,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:45:54" (1/1) ... [2022-11-02 20:45:54,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:45:55,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:45:55,601 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_a1200f41-5422-4eac-bc86-8bf9ab036866/sv-benchmarks/c/pthread/queue.i[43284,43297] [2022-11-02 20:45:55,605 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_a1200f41-5422-4eac-bc86-8bf9ab036866/sv-benchmarks/c/pthread/queue.i[43491,43504] [2022-11-02 20:45:55,607 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_a1200f41-5422-4eac-bc86-8bf9ab036866/sv-benchmarks/c/pthread/queue.i[43772,43785] [2022-11-02 20:45:55,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:45:55,629 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:45:55,674 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_a1200f41-5422-4eac-bc86-8bf9ab036866/sv-benchmarks/c/pthread/queue.i[43284,43297] [2022-11-02 20:45:55,676 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_a1200f41-5422-4eac-bc86-8bf9ab036866/sv-benchmarks/c/pthread/queue.i[43491,43504] [2022-11-02 20:45:55,679 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_a1200f41-5422-4eac-bc86-8bf9ab036866/sv-benchmarks/c/pthread/queue.i[43772,43785] [2022-11-02 20:45:55,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:45:55,732 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:45:55,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:55 WrapperNode [2022-11-02 20:45:55,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:45:55,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:45:55,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:45:55,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:45:55,742 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:45:55" (1/1) ... [2022-11-02 20:45:55,761 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:45:55" (1/1) ... [2022-11-02 20:45:55,800 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 262 [2022-11-02 20:45:55,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:45:55,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:45:55,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:45:55,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:45:55,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:55" (1/1) ... [2022-11-02 20:45:55,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:55" (1/1) ... [2022-11-02 20:45:55,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:55" (1/1) ... [2022-11-02 20:45:55,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:55" (1/1) ... [2022-11-02 20:45:55,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:55" (1/1) ... [2022-11-02 20:45:55,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:55" (1/1) ... [2022-11-02 20:45:55,869 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:55" (1/1) ... [2022-11-02 20:45:55,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:55" (1/1) ... [2022-11-02 20:45:55,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:45:55,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:45:55,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:45:55,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:45:55,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:55" (1/1) ... [2022-11-02 20:45:55,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:45:55,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:55,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:45:55,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:45:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-02 20:45:55,961 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-02 20:45:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-02 20:45:55,961 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-02 20:45:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:45:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:45:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:45:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:45:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-02 20:45:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:45:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:45:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:45:55,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:45:55,964 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:45:56,114 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:45:56,117 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:45:56,664 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:45:56,675 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:45:56,682 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:45:56,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:45:56 BoogieIcfgContainer [2022-11-02 20:45:56,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:45:56,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:45:56,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:45:56,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:45:56,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:45:54" (1/3) ... [2022-11-02 20:45:56,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a139dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:45:56, skipping insertion in model container [2022-11-02 20:45:56,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:55" (2/3) ... [2022-11-02 20:45:56,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a139dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:45:56, skipping insertion in model container [2022-11-02 20:45:56,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:45:56" (3/3) ... [2022-11-02 20:45:56,698 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2022-11-02 20:45:56,707 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:45:56,717 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:45:56,718 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-02 20:45:56,718 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:45:56,904 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-02 20:45:56,972 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-02 20:45:56,990 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 307 transitions, 630 flow [2022-11-02 20:45:56,993 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 307 transitions, 630 flow [2022-11-02 20:45:56,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 307 transitions, 630 flow [2022-11-02 20:45:57,125 INFO L130 PetriNetUnfolder]: 15/305 cut-off events. [2022-11-02 20:45:57,126 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:45:57,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 305 events. 15/305 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 461 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-11-02 20:45:57,149 INFO L118 LiptonReduction]: Number of co-enabled transitions 23276 [2022-11-02 20:46:11,594 INFO L133 LiptonReduction]: Checked pairs total: 50876 [2022-11-02 20:46:11,594 INFO L135 LiptonReduction]: Total number of compositions: 290 [2022-11-02 20:46:11,603 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 82 transitions, 180 flow [2022-11-02 20:46:11,714 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1882 states, 1792 states have (on average 2.8286830357142856) internal successors, (5069), 1881 states have internal predecessors, (5069), 0 states have call successors, (0), 0 states 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:46:11,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:46:11,740 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;@4f0f0233, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:46:11,740 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-11-02 20:46:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 1882 states, 1792 states have (on average 2.8286830357142856) internal successors, (5069), 1881 states have internal predecessors, (5069), 0 states have call successors, (0), 0 states 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:46:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:46:11,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:11,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:46:11,754 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:11,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1253414157, now seen corresponding path program 1 times [2022-11-02 20:46:11,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:11,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292381657] [2022-11-02 20:46:11,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:11,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,020 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:46:13,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:13,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292381657] [2022-11-02 20:46:13,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292381657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:13,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:13,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:46:13,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475600971] [2022-11-02 20:46:13,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:13,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:46:13,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:13,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:46:13,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:46:13,063 INFO L87 Difference]: Start difference. First operand has 1882 states, 1792 states have (on average 2.8286830357142856) internal successors, (5069), 1881 states have internal predecessors, (5069), 0 states have call successors, (0), 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 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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:46:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:13,576 INFO L93 Difference]: Finished difference Result 1880 states and 4939 transitions. [2022-11-02 20:46:13,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:46:13,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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:46:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:13,603 INFO L225 Difference]: With dead ends: 1880 [2022-11-02 20:46:13,604 INFO L226 Difference]: Without dead ends: 1880 [2022-11-02 20:46:13,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:46:13,608 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:13,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:46:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-11-02 20:46:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1880. [2022-11-02 20:46:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1790 states have (on average 2.7592178770949722) internal successors, (4939), 1879 states have internal predecessors, (4939), 0 states have call successors, (0), 0 states 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:46:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 4939 transitions. [2022-11-02 20:46:13,729 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 4939 transitions. Word has length 6 [2022-11-02 20:46:13,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:13,729 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 4939 transitions. [2022-11-02 20:46:13,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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:46:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 4939 transitions. [2022-11-02 20:46:13,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:46:13,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:13,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:13,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:46:13,732 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:13,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:13,732 INFO L85 PathProgramCache]: Analyzing trace with hash 203514151, now seen corresponding path program 1 times [2022-11-02 20:46:13,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:13,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14820998] [2022-11-02 20:46:13,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:13,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:14,458 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:46:14,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:14,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14820998] [2022-11-02 20:46:14,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14820998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:14,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:14,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:46:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742845767] [2022-11-02 20:46:14,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:14,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:46:14,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:14,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:46:14,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:46:14,468 INFO L87 Difference]: Start difference. First operand 1880 states and 4939 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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:46:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:14,996 INFO L93 Difference]: Finished difference Result 2141 states and 5608 transitions. [2022-11-02 20:46:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:46:14,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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:46:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:15,015 INFO L225 Difference]: With dead ends: 2141 [2022-11-02 20:46:15,015 INFO L226 Difference]: Without dead ends: 2141 [2022-11-02 20:46:15,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:46:15,018 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 87 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:15,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 30 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:46:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2022-11-02 20:46:15,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1982. [2022-11-02 20:46:15,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1892 states have (on average 2.7489429175475686) internal successors, (5201), 1981 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states 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:46:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 5201 transitions. [2022-11-02 20:46:15,095 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 5201 transitions. Word has length 7 [2022-11-02 20:46:15,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:15,095 INFO L495 AbstractCegarLoop]: Abstraction has 1982 states and 5201 transitions. [2022-11-02 20:46:15,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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:46:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 5201 transitions. [2022-11-02 20:46:15,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:46:15,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:15,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:15,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:46:15,098 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:15,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:15,098 INFO L85 PathProgramCache]: Analyzing trace with hash 201323071, now seen corresponding path program 2 times [2022-11-02 20:46:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:15,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519700596] [2022-11-02 20:46:15,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:15,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:15,719 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:46:15,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:15,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519700596] [2022-11-02 20:46:15,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519700596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:15,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:15,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:46:15,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939676] [2022-11-02 20:46:15,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:15,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:46:15,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:15,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:46:15,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:46:15,723 INFO L87 Difference]: Start difference. First operand 1982 states and 5201 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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:46:16,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:16,388 INFO L93 Difference]: Finished difference Result 2156 states and 5649 transitions. [2022-11-02 20:46:16,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:46:16,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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:46:16,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:16,402 INFO L225 Difference]: With dead ends: 2156 [2022-11-02 20:46:16,402 INFO L226 Difference]: Without dead ends: 2156 [2022-11-02 20:46:16,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:46:16,406 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 72 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:16,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 38 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:46:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-11-02 20:46:16,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 1979. [2022-11-02 20:46:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1979 states, 1889 states have (on average 2.749602964531498) internal successors, (5194), 1978 states have internal predecessors, (5194), 0 states have call successors, (0), 0 states 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:46:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 5194 transitions. [2022-11-02 20:46:16,477 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 5194 transitions. Word has length 7 [2022-11-02 20:46:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:16,478 INFO L495 AbstractCegarLoop]: Abstraction has 1979 states and 5194 transitions. [2022-11-02 20:46:16,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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:46:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 5194 transitions. [2022-11-02 20:46:16,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:46:16,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:16,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:16,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:46:16,482 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:16,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:16,483 INFO L85 PathProgramCache]: Analyzing trace with hash 201135211, now seen corresponding path program 3 times [2022-11-02 20:46:16,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:16,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228959210] [2022-11-02 20:46:16,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:16,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:17,524 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:46:17,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:17,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228959210] [2022-11-02 20:46:17,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228959210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:17,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:17,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:46:17,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824134836] [2022-11-02 20:46:17,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:17,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:46:17,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:17,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:46:17,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:46:17,526 INFO L87 Difference]: Start difference. First operand 1979 states and 5194 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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:46:18,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:18,668 INFO L93 Difference]: Finished difference Result 2021 states and 5304 transitions. [2022-11-02 20:46:18,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:46:18,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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:46:18,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:18,684 INFO L225 Difference]: With dead ends: 2021 [2022-11-02 20:46:18,684 INFO L226 Difference]: Without dead ends: 2021 [2022-11-02 20:46:18,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:46:18,687 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 110 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:18,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 26 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:46:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2022-11-02 20:46:18,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 1970. [2022-11-02 20:46:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1970 states, 1880 states have (on average 2.751595744680851) internal successors, (5173), 1969 states have internal predecessors, (5173), 0 states have call successors, (0), 0 states 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:46:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 5173 transitions. [2022-11-02 20:46:18,769 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 5173 transitions. Word has length 7 [2022-11-02 20:46:18,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:18,770 INFO L495 AbstractCegarLoop]: Abstraction has 1970 states and 5173 transitions. [2022-11-02 20:46:18,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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:46:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 5173 transitions. [2022-11-02 20:46:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:46:18,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:18,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:18,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:46:18,773 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:18,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1329685775, now seen corresponding path program 1 times [2022-11-02 20:46:18,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:18,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164743311] [2022-11-02 20:46:18,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:18,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:18,817 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:46:18,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:18,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164743311] [2022-11-02 20:46:18,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164743311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:18,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:18,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:46:18,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693877319] [2022-11-02 20:46:18,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:18,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:46:18,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:18,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:46:18,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:46:18,829 INFO L87 Difference]: Start difference. First operand 1970 states and 5173 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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:46:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:19,035 INFO L93 Difference]: Finished difference Result 3434 states and 9083 transitions. [2022-11-02 20:46:19,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:46:19,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-02 20:46:19,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:19,087 INFO L225 Difference]: With dead ends: 3434 [2022-11-02 20:46:19,088 INFO L226 Difference]: Without dead ends: 3434 [2022-11-02 20:46:19,088 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:46:19,089 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 63 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:19,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 16 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:46:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2022-11-02 20:46:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3114. [2022-11-02 20:46:19,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3114 states, 3024 states have (on average 2.8382936507936507) internal successors, (8583), 3113 states have internal predecessors, (8583), 0 states have call successors, (0), 0 states 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:46:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 8583 transitions. [2022-11-02 20:46:19,202 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 8583 transitions. Word has length 8 [2022-11-02 20:46:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:19,204 INFO L495 AbstractCegarLoop]: Abstraction has 3114 states and 8583 transitions. [2022-11-02 20:46:19,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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:46:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 8583 transitions. [2022-11-02 20:46:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:46:19,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:19,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:19,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:46:19,208 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:19,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash 16501957, now seen corresponding path program 1 times [2022-11-02 20:46:19,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:19,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016913709] [2022-11-02 20:46:19,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:19,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:19,933 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:46:19,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:19,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016913709] [2022-11-02 20:46:19,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016913709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:19,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:19,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:46:19,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285784328] [2022-11-02 20:46:19,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:19,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:46:19,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:19,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:46:19,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:46:19,936 INFO L87 Difference]: Start difference. First operand 3114 states and 8583 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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:46:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:21,099 INFO L93 Difference]: Finished difference Result 3111 states and 8576 transitions. [2022-11-02 20:46:21,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:46:21,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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:46:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:21,128 INFO L225 Difference]: With dead ends: 3111 [2022-11-02 20:46:21,129 INFO L226 Difference]: Without dead ends: 3111 [2022-11-02 20:46:21,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:46:21,130 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:21,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:46:21,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2022-11-02 20:46:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 3111. [2022-11-02 20:46:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3111 states, 3021 states have (on average 2.8387951009599472) internal successors, (8576), 3110 states have internal predecessors, (8576), 0 states have call successors, (0), 0 states 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:46:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 8576 transitions. [2022-11-02 20:46:21,275 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 8576 transitions. Word has length 9 [2022-11-02 20:46:21,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:21,276 INFO L495 AbstractCegarLoop]: Abstraction has 3111 states and 8576 transitions. [2022-11-02 20:46:21,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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:46:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 8576 transitions. [2022-11-02 20:46:21,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:46:21,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:21,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:21,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:46:21,283 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:21,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1731302810, now seen corresponding path program 1 times [2022-11-02 20:46:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:21,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640190867] [2022-11-02 20:46:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:21,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:21,346 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:46:21,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:21,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640190867] [2022-11-02 20:46:21,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640190867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:21,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:21,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:46:21,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227856022] [2022-11-02 20:46:21,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:21,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:46:21,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:21,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:46:21,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:46:21,350 INFO L87 Difference]: Start difference. First operand 3111 states and 8576 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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:46:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:21,497 INFO L93 Difference]: Finished difference Result 2873 states and 7689 transitions. [2022-11-02 20:46:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:46:21,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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:46:21,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:21,532 INFO L225 Difference]: With dead ends: 2873 [2022-11-02 20:46:21,532 INFO L226 Difference]: Without dead ends: 2865 [2022-11-02 20:46:21,532 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:46:21,533 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 50 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:21,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 11 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:46:21,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2022-11-02 20:46:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2705. [2022-11-02 20:46:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 2627 states have (on average 2.832508564902931) internal successors, (7441), 2704 states have internal predecessors, (7441), 0 states have call successors, (0), 0 states 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:46:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 7441 transitions. [2022-11-02 20:46:21,627 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 7441 transitions. Word has length 9 [2022-11-02 20:46:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:21,627 INFO L495 AbstractCegarLoop]: Abstraction has 2705 states and 7441 transitions. [2022-11-02 20:46:21,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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:46:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 7441 transitions. [2022-11-02 20:46:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:46:21,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:21,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:21,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:46:21,629 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:21,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:21,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1602727317, now seen corresponding path program 1 times [2022-11-02 20:46:21,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:21,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130538303] [2022-11-02 20:46:21,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:21,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:22,170 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:46:22,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:22,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130538303] [2022-11-02 20:46:22,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130538303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:22,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:22,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:46:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336641234] [2022-11-02 20:46:22,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:22,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:46:22,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:22,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:46:22,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:46:22,174 INFO L87 Difference]: Start difference. First operand 2705 states and 7441 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:46:22,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:22,547 INFO L93 Difference]: Finished difference Result 2855 states and 7813 transitions. [2022-11-02 20:46:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:46:22,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:46:22,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:22,563 INFO L225 Difference]: With dead ends: 2855 [2022-11-02 20:46:22,565 INFO L226 Difference]: Without dead ends: 2855 [2022-11-02 20:46:22,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:46:22,567 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:22,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 32 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:46:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2022-11-02 20:46:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2830. [2022-11-02 20:46:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2830 states, 2752 states have (on average 2.816497093023256) internal successors, (7751), 2829 states have internal predecessors, (7751), 0 states have call successors, (0), 0 states 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:46:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 7751 transitions. [2022-11-02 20:46:22,656 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 7751 transitions. Word has length 10 [2022-11-02 20:46:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:22,656 INFO L495 AbstractCegarLoop]: Abstraction has 2830 states and 7751 transitions. [2022-11-02 20:46:22,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:46:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 7751 transitions. [2022-11-02 20:46:22,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:46:22,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:22,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:22,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:46:22,658 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:22,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:22,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1842285139, now seen corresponding path program 2 times [2022-11-02 20:46:22,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:22,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192983012] [2022-11-02 20:46:22,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:22,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:23,539 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:46:23,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:23,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192983012] [2022-11-02 20:46:23,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192983012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:23,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:23,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:46:23,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763202451] [2022-11-02 20:46:23,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:23,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:46:23,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:23,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:46:23,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:46:23,541 INFO L87 Difference]: Start difference. First operand 2830 states and 7751 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:46:24,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:24,548 INFO L93 Difference]: Finished difference Result 2955 states and 8061 transitions. [2022-11-02 20:46:24,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:46:24,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:46:24,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:24,561 INFO L225 Difference]: With dead ends: 2955 [2022-11-02 20:46:24,562 INFO L226 Difference]: Without dead ends: 2955 [2022-11-02 20:46:24,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:46:24,564 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:24,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 39 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:46:24,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-11-02 20:46:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2805. [2022-11-02 20:46:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2805 states, 2727 states have (on average 2.8195819581958195) internal successors, (7689), 2804 states have internal predecessors, (7689), 0 states have call successors, (0), 0 states 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:46:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 7689 transitions. [2022-11-02 20:46:24,691 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 7689 transitions. Word has length 10 [2022-11-02 20:46:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:24,692 INFO L495 AbstractCegarLoop]: Abstraction has 2805 states and 7689 transitions. [2022-11-02 20:46:24,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:46:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 7689 transitions. [2022-11-02 20:46:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:46:24,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:24,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:24,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:46:24,694 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:24,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:24,695 INFO L85 PathProgramCache]: Analyzing trace with hash 540715175, now seen corresponding path program 3 times [2022-11-02 20:46:24,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:24,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786987626] [2022-11-02 20:46:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:25,489 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:46:25,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:25,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786987626] [2022-11-02 20:46:25,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786987626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:25,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:25,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:46:25,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276270591] [2022-11-02 20:46:25,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:25,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:46:25,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:25,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:46:25,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:46:25,492 INFO L87 Difference]: Start difference. First operand 2805 states and 7689 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:46:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:26,456 INFO L93 Difference]: Finished difference Result 2734 states and 7480 transitions. [2022-11-02 20:46:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:46:26,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:46:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:26,466 INFO L225 Difference]: With dead ends: 2734 [2022-11-02 20:46:26,467 INFO L226 Difference]: Without dead ends: 2734 [2022-11-02 20:46:26,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:46:26,468 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 56 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:26,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 32 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:46:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2022-11-02 20:46:26,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2634. [2022-11-02 20:46:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2564 states have (on average 2.8205928237129485) internal successors, (7232), 2633 states have internal predecessors, (7232), 0 states have call successors, (0), 0 states 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:46:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 7232 transitions. [2022-11-02 20:46:26,547 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 7232 transitions. Word has length 10 [2022-11-02 20:46:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:26,548 INFO L495 AbstractCegarLoop]: Abstraction has 2634 states and 7232 transitions. [2022-11-02 20:46:26,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:46:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 7232 transitions. [2022-11-02 20:46:26,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:46:26,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:26,550 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:26,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:46:26,550 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:26,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:26,551 INFO L85 PathProgramCache]: Analyzing trace with hash 187869938, now seen corresponding path program 1 times [2022-11-02 20:46:26,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:26,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035522634] [2022-11-02 20:46:26,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:26,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:26,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:26,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035522634] [2022-11-02 20:46:26,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035522634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:26,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:26,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:46:26,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352129084] [2022-11-02 20:46:26,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:26,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:46:26,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:26,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:46:26,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:46:26,596 INFO L87 Difference]: Start difference. First operand 2634 states and 7232 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:46:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:26,747 INFO L93 Difference]: Finished difference Result 2562 states and 7001 transitions. [2022-11-02 20:46:26,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:46:26,747 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:46:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:26,757 INFO L225 Difference]: With dead ends: 2562 [2022-11-02 20:46:26,757 INFO L226 Difference]: Without dead ends: 2562 [2022-11-02 20:46:26,758 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:46:26,758 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 59 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:26,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 14 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:46:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2022-11-02 20:46:26,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2562. [2022-11-02 20:46:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 2501 states have (on average 2.799280287884846) internal successors, (7001), 2561 states have internal predecessors, (7001), 0 states have call successors, (0), 0 states 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:46:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 7001 transitions. [2022-11-02 20:46:26,853 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 7001 transitions. Word has length 11 [2022-11-02 20:46:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:26,854 INFO L495 AbstractCegarLoop]: Abstraction has 2562 states and 7001 transitions. [2022-11-02 20:46:26,854 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:46:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 7001 transitions. [2022-11-02 20:46:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:46:26,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:26,855 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:26,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:46:26,856 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:26,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:26,857 INFO L85 PathProgramCache]: Analyzing trace with hash 187869846, now seen corresponding path program 1 times [2022-11-02 20:46:26,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:26,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488844279] [2022-11-02 20:46:26,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:26,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:46:26,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:26,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488844279] [2022-11-02 20:46:26,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488844279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:26,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:26,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:46:26,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959167032] [2022-11-02 20:46:26,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:26,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:46:26,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:26,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:46:26,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:46:26,909 INFO L87 Difference]: Start difference. First operand 2562 states and 7001 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:46:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:27,048 INFO L93 Difference]: Finished difference Result 2490 states and 6770 transitions. [2022-11-02 20:46:27,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:46:27,049 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:46:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:27,058 INFO L225 Difference]: With dead ends: 2490 [2022-11-02 20:46:27,058 INFO L226 Difference]: Without dead ends: 2420 [2022-11-02 20:46:27,059 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:46:27,059 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:27,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 14 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:46:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2022-11-02 20:46:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1576. [2022-11-02 20:46:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1524 states have (on average 2.776246719160105) internal successors, (4231), 1575 states have internal predecessors, (4231), 0 states have call successors, (0), 0 states 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:46:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 4231 transitions. [2022-11-02 20:46:27,112 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 4231 transitions. Word has length 11 [2022-11-02 20:46:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:27,113 INFO L495 AbstractCegarLoop]: Abstraction has 1576 states and 4231 transitions. [2022-11-02 20:46:27,113 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:46:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 4231 transitions. [2022-11-02 20:46:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:46:27,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:27,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:27,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:46:27,115 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:27,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:27,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1359366297, now seen corresponding path program 1 times [2022-11-02 20:46:27,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:27,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752879635] [2022-11-02 20:46:27,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:27,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,163 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:46:27,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:27,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752879635] [2022-11-02 20:46:27,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752879635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:27,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:27,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:46:27,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319845266] [2022-11-02 20:46:27,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:27,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:46:27,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:27,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:46:27,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:46:27,166 INFO L87 Difference]: Start difference. First operand 1576 states and 4231 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:46:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:27,323 INFO L93 Difference]: Finished difference Result 1948 states and 5225 transitions. [2022-11-02 20:46:27,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:46:27,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-11-02 20:46:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:27,331 INFO L225 Difference]: With dead ends: 1948 [2022-11-02 20:46:27,331 INFO L226 Difference]: Without dead ends: 1948 [2022-11-02 20:46:27,331 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:46:27,332 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:27,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 13 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:46:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2022-11-02 20:46:27,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1884. [2022-11-02 20:46:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1832 states have (on average 2.7974890829694323) internal successors, (5125), 1883 states have internal predecessors, (5125), 0 states have call successors, (0), 0 states 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:46:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 5125 transitions. [2022-11-02 20:46:27,385 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 5125 transitions. Word has length 17 [2022-11-02 20:46:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:27,385 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 5125 transitions. [2022-11-02 20:46:27,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:46:27,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 5125 transitions. [2022-11-02 20:46:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:46:27,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:27,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:27,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:46:27,389 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:27,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:27,390 INFO L85 PathProgramCache]: Analyzing trace with hash 809735391, now seen corresponding path program 1 times [2022-11-02 20:46:27,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:27,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760371141] [2022-11-02 20:46:27,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:27,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:28,012 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:46:28,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:28,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760371141] [2022-11-02 20:46:28,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760371141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:28,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:28,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:46:28,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409345886] [2022-11-02 20:46:28,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:28,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:46:28,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:28,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:46:28,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:46:28,015 INFO L87 Difference]: Start difference. First operand 1884 states and 5125 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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:46:29,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:29,195 INFO L93 Difference]: Finished difference Result 4447 states and 12199 transitions. [2022-11-02 20:46:29,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:46:29,196 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-02 20:46:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:29,213 INFO L225 Difference]: With dead ends: 4447 [2022-11-02 20:46:29,213 INFO L226 Difference]: Without dead ends: 4447 [2022-11-02 20:46:29,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:46:29,214 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 545 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:29,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 74 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:46:29,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2022-11-02 20:46:29,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 2968. [2022-11-02 20:46:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2968 states, 2916 states have (on average 2.9537037037037037) internal successors, (8613), 2967 states have internal predecessors, (8613), 0 states have call successors, (0), 0 states 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:46:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 8613 transitions. [2022-11-02 20:46:29,330 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 8613 transitions. Word has length 18 [2022-11-02 20:46:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:29,330 INFO L495 AbstractCegarLoop]: Abstraction has 2968 states and 8613 transitions. [2022-11-02 20:46:29,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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:46:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 8613 transitions. [2022-11-02 20:46:29,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:46:29,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:29,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:29,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:46:29,333 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:29,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:29,334 INFO L85 PathProgramCache]: Analyzing trace with hash 809735307, now seen corresponding path program 1 times [2022-11-02 20:46:29,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:29,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360728405] [2022-11-02 20:46:29,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:29,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:30,603 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:46:30,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:30,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360728405] [2022-11-02 20:46:30,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360728405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:30,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:30,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:46:30,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504110594] [2022-11-02 20:46:30,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:30,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:46:30,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:30,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:46:30,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:46:30,606 INFO L87 Difference]: Start difference. First operand 2968 states and 8613 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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:46:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:31,336 INFO L93 Difference]: Finished difference Result 2995 states and 8654 transitions. [2022-11-02 20:46:31,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:46:31,336 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-02 20:46:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:31,346 INFO L225 Difference]: With dead ends: 2995 [2022-11-02 20:46:31,347 INFO L226 Difference]: Without dead ends: 2995 [2022-11-02 20:46:31,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:46:31,348 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 61 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:31,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 46 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:46:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2022-11-02 20:46:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2967. [2022-11-02 20:46:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2967 states, 2915 states have (on average 2.95368782161235) internal successors, (8610), 2966 states have internal predecessors, (8610), 0 states have call successors, (0), 0 states 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:46:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 8610 transitions. [2022-11-02 20:46:31,427 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 8610 transitions. Word has length 18 [2022-11-02 20:46:31,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:31,428 INFO L495 AbstractCegarLoop]: Abstraction has 2967 states and 8610 transitions. [2022-11-02 20:46:31,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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:46:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 8610 transitions. [2022-11-02 20:46:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:46:31,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:31,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:31,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:46:31,430 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:31,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:31,431 INFO L85 PathProgramCache]: Analyzing trace with hash -877917787, now seen corresponding path program 1 times [2022-11-02 20:46:31,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:31,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061090051] [2022-11-02 20:46:31,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:31,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:33,528 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:46:33,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:33,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061090051] [2022-11-02 20:46:33,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061090051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:33,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:33,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:46:33,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399956934] [2022-11-02 20:46:33,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:33,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:46:33,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:33,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:46:33,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:46:33,531 INFO L87 Difference]: Start difference. First operand 2967 states and 8610 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:35,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:35,277 INFO L93 Difference]: Finished difference Result 3370 states and 9659 transitions. [2022-11-02 20:46:35,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:46:35,278 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:46:35,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:35,289 INFO L225 Difference]: With dead ends: 3370 [2022-11-02 20:46:35,290 INFO L226 Difference]: Without dead ends: 3370 [2022-11-02 20:46:35,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:46:35,291 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 190 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:35,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 110 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:46:35,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2022-11-02 20:46:35,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 3282. [2022-11-02 20:46:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3282 states, 3230 states have (on average 2.9377708978328174) internal successors, (9489), 3281 states have internal predecessors, (9489), 0 states have call successors, (0), 0 states 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:46:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 9489 transitions. [2022-11-02 20:46:35,377 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 9489 transitions. Word has length 19 [2022-11-02 20:46:35,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:35,378 INFO L495 AbstractCegarLoop]: Abstraction has 3282 states and 9489 transitions. [2022-11-02 20:46:35,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 9489 transitions. [2022-11-02 20:46:35,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:46:35,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:35,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:35,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:46:35,381 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:35,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:35,381 INFO L85 PathProgramCache]: Analyzing trace with hash -748620055, now seen corresponding path program 2 times [2022-11-02 20:46:35,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:35,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225388085] [2022-11-02 20:46:35,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:35,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:36,729 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:46:36,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:36,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225388085] [2022-11-02 20:46:36,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225388085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:36,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:36,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:46:36,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874807813] [2022-11-02 20:46:36,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:36,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:46:36,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:36,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:46:36,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:46:36,731 INFO L87 Difference]: Start difference. First operand 3282 states and 9489 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:37,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:37,735 INFO L93 Difference]: Finished difference Result 3406 states and 9781 transitions. [2022-11-02 20:46:37,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:46:37,736 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:46:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:37,747 INFO L225 Difference]: With dead ends: 3406 [2022-11-02 20:46:37,747 INFO L226 Difference]: Without dead ends: 3406 [2022-11-02 20:46:37,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:46:37,748 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 172 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:37,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 83 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:46:37,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2022-11-02 20:46:37,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3031. [2022-11-02 20:46:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 2979 states have (on average 2.945955018462571) internal successors, (8776), 3030 states have internal predecessors, (8776), 0 states have call successors, (0), 0 states 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:46:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 8776 transitions. [2022-11-02 20:46:37,828 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 8776 transitions. Word has length 19 [2022-11-02 20:46:37,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:37,829 INFO L495 AbstractCegarLoop]: Abstraction has 3031 states and 8776 transitions. [2022-11-02 20:46:37,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 8776 transitions. [2022-11-02 20:46:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:46:37,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:37,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:37,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:46:37,831 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:37,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:37,832 INFO L85 PathProgramCache]: Analyzing trace with hash 142450913, now seen corresponding path program 1 times [2022-11-02 20:46:37,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:37,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994921433] [2022-11-02 20:46:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:37,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:39,054 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:46:39,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:39,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994921433] [2022-11-02 20:46:39,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994921433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:39,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:39,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:46:39,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522967770] [2022-11-02 20:46:39,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:39,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:46:39,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:39,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:46:39,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:46:39,056 INFO L87 Difference]: Start difference. First operand 3031 states and 8776 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:40,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:40,114 INFO L93 Difference]: Finished difference Result 3346 states and 9640 transitions. [2022-11-02 20:46:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:46:40,115 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:46:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:40,125 INFO L225 Difference]: With dead ends: 3346 [2022-11-02 20:46:40,126 INFO L226 Difference]: Without dead ends: 3346 [2022-11-02 20:46:40,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:46:40,127 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 159 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:40,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 90 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:46:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2022-11-02 20:46:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 3207. [2022-11-02 20:46:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3155 states have (on average 2.945800316957211) internal successors, (9294), 3206 states have internal predecessors, (9294), 0 states have call successors, (0), 0 states 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:46:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 9294 transitions. [2022-11-02 20:46:40,209 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 9294 transitions. Word has length 19 [2022-11-02 20:46:40,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:40,210 INFO L495 AbstractCegarLoop]: Abstraction has 3207 states and 9294 transitions. [2022-11-02 20:46:40,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 9294 transitions. [2022-11-02 20:46:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:46:40,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:40,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:40,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:46:40,213 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:40,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash 142450829, now seen corresponding path program 3 times [2022-11-02 20:46:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:40,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136045547] [2022-11-02 20:46:40,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:40,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:41,429 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:46:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:41,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136045547] [2022-11-02 20:46:41,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136045547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:41,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:41,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:46:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750522511] [2022-11-02 20:46:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:41,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:46:41,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:41,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:46:41,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:46:41,432 INFO L87 Difference]: Start difference. First operand 3207 states and 9294 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:42,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:42,476 INFO L93 Difference]: Finished difference Result 3359 states and 9630 transitions. [2022-11-02 20:46:42,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:46:42,476 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:46:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:42,487 INFO L225 Difference]: With dead ends: 3359 [2022-11-02 20:46:42,487 INFO L226 Difference]: Without dead ends: 3359 [2022-11-02 20:46:42,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:46:42,488 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 240 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:42,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 76 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:46:42,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2022-11-02 20:46:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 2986. [2022-11-02 20:46:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2986 states, 2934 states have (on average 2.951261077027948) internal successors, (8659), 2985 states have internal predecessors, (8659), 0 states have call successors, (0), 0 states 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:46:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 8659 transitions. [2022-11-02 20:46:42,566 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 8659 transitions. Word has length 19 [2022-11-02 20:46:42,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:42,566 INFO L495 AbstractCegarLoop]: Abstraction has 2986 states and 8659 transitions. [2022-11-02 20:46:42,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:42,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 8659 transitions. [2022-11-02 20:46:42,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:46:42,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:42,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:42,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:46:42,569 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:42,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:42,569 INFO L85 PathProgramCache]: Analyzing trace with hash 700884197, now seen corresponding path program 2 times [2022-11-02 20:46:42,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:42,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80332169] [2022-11-02 20:46:42,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:42,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:43,804 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:46:43,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:43,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80332169] [2022-11-02 20:46:43,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80332169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:43,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:43,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:46:43,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221075353] [2022-11-02 20:46:43,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:43,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:46:43,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:43,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:46:43,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:46:43,806 INFO L87 Difference]: Start difference. First operand 2986 states and 8659 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:44,862 INFO L93 Difference]: Finished difference Result 3217 states and 9242 transitions. [2022-11-02 20:46:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:46:44,863 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:46:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:44,872 INFO L225 Difference]: With dead ends: 3217 [2022-11-02 20:46:44,872 INFO L226 Difference]: Without dead ends: 3217 [2022-11-02 20:46:44,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:46:44,873 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 191 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:44,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 90 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:46:44,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2022-11-02 20:46:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 3042. [2022-11-02 20:46:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3042 states, 2990 states have (on average 2.9528428093645487) internal successors, (8829), 3041 states have internal predecessors, (8829), 0 states have call successors, (0), 0 states 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:46:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 8829 transitions. [2022-11-02 20:46:44,952 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 8829 transitions. Word has length 19 [2022-11-02 20:46:44,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:44,953 INFO L495 AbstractCegarLoop]: Abstraction has 3042 states and 8829 transitions. [2022-11-02 20:46:44,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 8829 transitions. [2022-11-02 20:46:44,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:46:44,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:44,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:44,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:46:44,955 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:44,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:44,956 INFO L85 PathProgramCache]: Analyzing trace with hash 700884113, now seen corresponding path program 4 times [2022-11-02 20:46:44,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:44,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191834070] [2022-11-02 20:46:44,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:44,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:46,217 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:46:46,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:46,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191834070] [2022-11-02 20:46:46,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191834070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:46,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:46,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:46:46,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044993945] [2022-11-02 20:46:46,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:46,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:46:46,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:46,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:46:46,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:46:46,219 INFO L87 Difference]: Start difference. First operand 3042 states and 8829 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:47,214 INFO L93 Difference]: Finished difference Result 3194 states and 9172 transitions. [2022-11-02 20:46:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:46:47,214 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:46:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:47,221 INFO L225 Difference]: With dead ends: 3194 [2022-11-02 20:46:47,221 INFO L226 Difference]: Without dead ends: 3194 [2022-11-02 20:46:47,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:46:47,222 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 167 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:47,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 93 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:46:47,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2022-11-02 20:46:47,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2866. [2022-11-02 20:46:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2866 states, 2814 states have (on average 2.9534470504619756) internal successors, (8311), 2865 states have internal predecessors, (8311), 0 states have call successors, (0), 0 states 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:46:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 8311 transitions. [2022-11-02 20:46:47,298 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 8311 transitions. Word has length 19 [2022-11-02 20:46:47,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:47,298 INFO L495 AbstractCegarLoop]: Abstraction has 2866 states and 8311 transitions. [2022-11-02 20:46:47,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 8311 transitions. [2022-11-02 20:46:47,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:46:47,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:47,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:47,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:46:47,301 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:47,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:47,301 INFO L85 PathProgramCache]: Analyzing trace with hash -667872977, now seen corresponding path program 3 times [2022-11-02 20:46:47,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:47,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502477087] [2022-11-02 20:46:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:47,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:48,521 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:46:48,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:48,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502477087] [2022-11-02 20:46:48,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502477087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:48,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:48,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:46:48,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079054347] [2022-11-02 20:46:48,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:48,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:46:48,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:48,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:46:48,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:46:48,523 INFO L87 Difference]: Start difference. First operand 2866 states and 8311 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:49,676 INFO L93 Difference]: Finished difference Result 3022 states and 8675 transitions. [2022-11-02 20:46:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:46:49,677 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:46:49,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:49,683 INFO L225 Difference]: With dead ends: 3022 [2022-11-02 20:46:49,683 INFO L226 Difference]: Without dead ends: 3022 [2022-11-02 20:46:49,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:46:49,684 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 153 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:49,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 119 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:46:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2022-11-02 20:46:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 2886. [2022-11-02 20:46:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2886 states, 2834 states have (on average 2.958362738179252) internal successors, (8384), 2885 states have internal predecessors, (8384), 0 states have call successors, (0), 0 states 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:46:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 8384 transitions. [2022-11-02 20:46:49,760 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 8384 transitions. Word has length 19 [2022-11-02 20:46:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:49,761 INFO L495 AbstractCegarLoop]: Abstraction has 2886 states and 8384 transitions. [2022-11-02 20:46:49,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 8384 transitions. [2022-11-02 20:46:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:46:49,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:49,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:49,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:46:49,763 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:49,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:49,764 INFO L85 PathProgramCache]: Analyzing trace with hash -667873061, now seen corresponding path program 5 times [2022-11-02 20:46:49,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:49,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238412034] [2022-11-02 20:46:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:49,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:51,075 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:46:51,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:51,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238412034] [2022-11-02 20:46:51,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238412034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:51,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:51,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:46:51,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049950995] [2022-11-02 20:46:51,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:51,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:46:51,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:51,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:46:51,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:46:51,077 INFO L87 Difference]: Start difference. First operand 2886 states and 8384 transitions. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:52,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:52,199 INFO L93 Difference]: Finished difference Result 2999 states and 8605 transitions. [2022-11-02 20:46:52,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:46:52,200 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:46:52,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:52,205 INFO L225 Difference]: With dead ends: 2999 [2022-11-02 20:46:52,206 INFO L226 Difference]: Without dead ends: 2999 [2022-11-02 20:46:52,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:46:52,207 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 179 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:52,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 105 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:46:52,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2022-11-02 20:46:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2846. [2022-11-02 20:46:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2846 states, 2794 states have (on average 2.9556191839656405) internal successors, (8258), 2845 states have internal predecessors, (8258), 0 states have call successors, (0), 0 states 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:46:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 8258 transitions. [2022-11-02 20:46:52,278 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 8258 transitions. Word has length 19 [2022-11-02 20:46:52,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:52,279 INFO L495 AbstractCegarLoop]: Abstraction has 2846 states and 8258 transitions. [2022-11-02 20:46:52,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:52,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 8258 transitions. [2022-11-02 20:46:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:46:52,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:52,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:52,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:46:52,281 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:52,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:52,281 INFO L85 PathProgramCache]: Analyzing trace with hash -668005967, now seen corresponding path program 4 times [2022-11-02 20:46:52,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:52,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452521138] [2022-11-02 20:46:52,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:52,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,493 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:46:53,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:53,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452521138] [2022-11-02 20:46:53,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452521138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:53,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:53,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:46:53,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534677260] [2022-11-02 20:46:53,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:53,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:46:53,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:53,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:46:53,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:46:53,495 INFO L87 Difference]: Start difference. First operand 2846 states and 8258 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:54,397 INFO L93 Difference]: Finished difference Result 2942 states and 8418 transitions. [2022-11-02 20:46:54,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:46:54,401 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:46:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:54,409 INFO L225 Difference]: With dead ends: 2942 [2022-11-02 20:46:54,410 INFO L226 Difference]: Without dead ends: 2942 [2022-11-02 20:46:54,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:46:54,411 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 205 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:54,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 89 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:46:54,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2022-11-02 20:46:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2841. [2022-11-02 20:46:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2789 states have (on average 2.9505198996055935) internal successors, (8229), 2840 states have internal predecessors, (8229), 0 states have call successors, (0), 0 states 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:46:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 8229 transitions. [2022-11-02 20:46:54,505 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 8229 transitions. Word has length 19 [2022-11-02 20:46:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:54,506 INFO L495 AbstractCegarLoop]: Abstraction has 2841 states and 8229 transitions. [2022-11-02 20:46:54,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 8229 transitions. [2022-11-02 20:46:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:46:54,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:54,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:54,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:46:54,510 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:54,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:54,511 INFO L85 PathProgramCache]: Analyzing trace with hash -668006051, now seen corresponding path program 6 times [2022-11-02 20:46:54,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:54,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151978076] [2022-11-02 20:46:54,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:54,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:55,622 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:46:55,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:55,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151978076] [2022-11-02 20:46:55,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151978076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:55,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:55,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:46:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921460830] [2022-11-02 20:46:55,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:55,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:46:55,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:55,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:46:55,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:46:55,624 INFO L87 Difference]: Start difference. First operand 2841 states and 8229 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:56,601 INFO L93 Difference]: Finished difference Result 2904 states and 8324 transitions. [2022-11-02 20:46:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:46:56,602 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:46:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:56,608 INFO L225 Difference]: With dead ends: 2904 [2022-11-02 20:46:56,608 INFO L226 Difference]: Without dead ends: 2904 [2022-11-02 20:46:56,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:46:56,609 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 206 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:56,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 82 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:46:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2022-11-02 20:46:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 2816. [2022-11-02 20:46:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2764 states have (on average 2.9475397973950797) internal successors, (8147), 2815 states have internal predecessors, (8147), 0 states have call successors, (0), 0 states 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:46:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 8147 transitions. [2022-11-02 20:46:56,677 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 8147 transitions. Word has length 19 [2022-11-02 20:46:56,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:56,677 INFO L495 AbstractCegarLoop]: Abstraction has 2816 states and 8147 transitions. [2022-11-02 20:46:56,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 8147 transitions. [2022-11-02 20:46:56,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:46:56,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:56,679 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:56,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:46:56,679 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:56,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash 367715036, now seen corresponding path program 1 times [2022-11-02 20:46:56,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:56,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943543909] [2022-11-02 20:46:56,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:56,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:56,732 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:46:56,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:56,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943543909] [2022-11-02 20:46:56,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943543909] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:56,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796679745] [2022-11-02 20:46:56,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:56,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:56,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:56,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:56,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:46:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:56,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:46:56,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:57,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:46:57,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796679745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:57,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:46:57,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-11-02 20:46:57,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883642562] [2022-11-02 20:46:57,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:57,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:46:57,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:57,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:46:57,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:46:57,019 INFO L87 Difference]: Start difference. First operand 2816 states and 8147 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:57,227 INFO L93 Difference]: Finished difference Result 2728 states and 7762 transitions. [2022-11-02 20:46:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:46:57,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 20:46:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:57,235 INFO L225 Difference]: With dead ends: 2728 [2022-11-02 20:46:57,235 INFO L226 Difference]: Without dead ends: 2728 [2022-11-02 20:46:57,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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:46:57,237 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 87 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:57,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 21 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:46:57,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2022-11-02 20:46:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2696. [2022-11-02 20:46:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2696 states, 2656 states have (on average 2.9036144578313254) internal successors, (7712), 2695 states have internal predecessors, (7712), 0 states have call successors, (0), 0 states 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:46:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 7712 transitions. [2022-11-02 20:46:57,303 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 7712 transitions. Word has length 20 [2022-11-02 20:46:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:57,303 INFO L495 AbstractCegarLoop]: Abstraction has 2696 states and 7712 transitions. [2022-11-02 20:46:57,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 7712 transitions. [2022-11-02 20:46:57,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:46:57,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:57,306 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:57,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:57,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:57,530 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:57,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:57,531 INFO L85 PathProgramCache]: Analyzing trace with hash 367714936, now seen corresponding path program 1 times [2022-11-02 20:46:57,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:57,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99509484] [2022-11-02 20:46:57,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:57,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:46:57,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:57,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99509484] [2022-11-02 20:46:57,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99509484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:57,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:57,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:46:57,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580231203] [2022-11-02 20:46:57,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:57,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:46:57,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:57,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:46:57,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:46:57,585 INFO L87 Difference]: Start difference. First operand 2696 states and 7712 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:57,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:57,728 INFO L93 Difference]: Finished difference Result 2576 states and 7277 transitions. [2022-11-02 20:46:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:46:57,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 20:46:57,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:57,735 INFO L225 Difference]: With dead ends: 2576 [2022-11-02 20:46:57,736 INFO L226 Difference]: Without dead ends: 2576 [2022-11-02 20:46:57,736 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:46:57,738 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:57,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 9 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:46:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2022-11-02 20:46:57,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2093. [2022-11-02 20:46:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 2065 states have (on average 2.864406779661017) internal successors, (5915), 2092 states have internal predecessors, (5915), 0 states have call successors, (0), 0 states 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:46:57,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 5915 transitions. [2022-11-02 20:46:57,790 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 5915 transitions. Word has length 20 [2022-11-02 20:46:57,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:57,791 INFO L495 AbstractCegarLoop]: Abstraction has 2093 states and 5915 transitions. [2022-11-02 20:46:57,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:57,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 5915 transitions. [2022-11-02 20:46:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:46:57,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:57,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:57,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:46:57,793 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:46:57,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2014158432, now seen corresponding path program 1 times [2022-11-02 20:46:57,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:57,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782026989] [2022-11-02 20:46:57,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:57,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:59,179 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:46:59,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:59,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782026989] [2022-11-02 20:46:59,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782026989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:59,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:59,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:46:59,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885837204] [2022-11-02 20:46:59,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:59,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:46:59,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:59,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:46:59,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:46:59,183 INFO L87 Difference]: Start difference. First operand 2093 states and 5915 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:00,275 INFO L93 Difference]: Finished difference Result 2331 states and 6549 transitions. [2022-11-02 20:47:00,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:47:00,276 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:47:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:00,281 INFO L225 Difference]: With dead ends: 2331 [2022-11-02 20:47:00,281 INFO L226 Difference]: Without dead ends: 2331 [2022-11-02 20:47:00,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:47:00,282 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 84 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:00,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 65 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:47:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2022-11-02 20:47:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2301. [2022-11-02 20:47:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 2273 states have (on average 2.853497580290365) internal successors, (6486), 2300 states have internal predecessors, (6486), 0 states have call successors, (0), 0 states 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:47:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 6486 transitions. [2022-11-02 20:47:00,328 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 6486 transitions. Word has length 21 [2022-11-02 20:47:00,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:00,328 INFO L495 AbstractCegarLoop]: Abstraction has 2301 states and 6486 transitions. [2022-11-02 20:47:00,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:00,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 6486 transitions. [2022-11-02 20:47:00,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:47:00,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:00,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:00,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:47:00,331 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:00,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2014158431, now seen corresponding path program 1 times [2022-11-02 20:47:00,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:00,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604070785] [2022-11-02 20:47:00,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:00,809 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:47:00,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:00,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604070785] [2022-11-02 20:47:00,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604070785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:00,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:00,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:47:00,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925456147] [2022-11-02 20:47:00,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:00,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:47:00,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:00,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:47:00,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:47:00,812 INFO L87 Difference]: Start difference. First operand 2301 states and 6486 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:01,851 INFO L93 Difference]: Finished difference Result 4022 states and 11193 transitions. [2022-11-02 20:47:01,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:47:01,852 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:47:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:01,859 INFO L225 Difference]: With dead ends: 4022 [2022-11-02 20:47:01,859 INFO L226 Difference]: Without dead ends: 4022 [2022-11-02 20:47:01,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:47:01,860 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 486 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:01,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 79 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:47:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2022-11-02 20:47:01,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 3141. [2022-11-02 20:47:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3113 states have (on average 2.8991326694506907) internal successors, (9025), 3140 states have internal predecessors, (9025), 0 states have call successors, (0), 0 states 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:47:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 9025 transitions. [2022-11-02 20:47:01,942 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 9025 transitions. Word has length 21 [2022-11-02 20:47:01,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:01,942 INFO L495 AbstractCegarLoop]: Abstraction has 3141 states and 9025 transitions. [2022-11-02 20:47:01,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:01,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 9025 transitions. [2022-11-02 20:47:01,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:47:01,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:01,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:01,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:47:01,946 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:01,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:01,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2000314810, now seen corresponding path program 1 times [2022-11-02 20:47:01,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:01,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592974524] [2022-11-02 20:47:01,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:01,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:02,962 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:47:02,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:02,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592974524] [2022-11-02 20:47:02,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592974524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:02,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:02,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:47:02,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354328243] [2022-11-02 20:47:02,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:02,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:47:02,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:02,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:47:02,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:47:02,965 INFO L87 Difference]: Start difference. First operand 3141 states and 9025 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:03,578 INFO L93 Difference]: Finished difference Result 3186 states and 9129 transitions. [2022-11-02 20:47:03,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:47:03,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:47:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:03,585 INFO L225 Difference]: With dead ends: 3186 [2022-11-02 20:47:03,585 INFO L226 Difference]: Without dead ends: 3186 [2022-11-02 20:47:03,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:47:03,586 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 160 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:03,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 60 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:47:03,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2022-11-02 20:47:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 2961. [2022-11-02 20:47:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2961 states, 2933 states have (on average 2.907944084555063) internal successors, (8529), 2960 states have internal predecessors, (8529), 0 states have call successors, (0), 0 states 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:47:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2961 states to 2961 states and 8529 transitions. [2022-11-02 20:47:03,650 INFO L78 Accepts]: Start accepts. Automaton has 2961 states and 8529 transitions. Word has length 22 [2022-11-02 20:47:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:03,650 INFO L495 AbstractCegarLoop]: Abstraction has 2961 states and 8529 transitions. [2022-11-02 20:47:03,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2961 states and 8529 transitions. [2022-11-02 20:47:03,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:47:03,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:03,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:03,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:47:03,653 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:03,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2099770406, now seen corresponding path program 2 times [2022-11-02 20:47:03,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:03,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133619618] [2022-11-02 20:47:03,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:03,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:04,597 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:47:04,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:04,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133619618] [2022-11-02 20:47:04,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133619618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:04,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:04,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:47:04,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154876151] [2022-11-02 20:47:04,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:04,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:47:04,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:04,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:47:04,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:47:04,599 INFO L87 Difference]: Start difference. First operand 2961 states and 8529 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:05,469 INFO L93 Difference]: Finished difference Result 3550 states and 10087 transitions. [2022-11-02 20:47:05,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:47:05,470 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:47:05,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:05,480 INFO L225 Difference]: With dead ends: 3550 [2022-11-02 20:47:05,480 INFO L226 Difference]: Without dead ends: 3550 [2022-11-02 20:47:05,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:47:05,482 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 226 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:05,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 76 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:47:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3550 states. [2022-11-02 20:47:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3550 to 3320. [2022-11-02 20:47:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3292 states have (on average 2.9158566221142164) internal successors, (9599), 3319 states have internal predecessors, (9599), 0 states have call successors, (0), 0 states 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:47:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 9599 transitions. [2022-11-02 20:47:05,562 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 9599 transitions. Word has length 22 [2022-11-02 20:47:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:05,563 INFO L495 AbstractCegarLoop]: Abstraction has 3320 states and 9599 transitions. [2022-11-02 20:47:05,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 9599 transitions. [2022-11-02 20:47:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:47:05,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:05,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:05,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:47:05,566 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:05,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:05,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2099770405, now seen corresponding path program 1 times [2022-11-02 20:47:05,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:05,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231092592] [2022-11-02 20:47:05,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:05,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:06,194 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:47:06,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:06,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231092592] [2022-11-02 20:47:06,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231092592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:06,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:06,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:47:06,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042259581] [2022-11-02 20:47:06,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:06,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:47:06,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:06,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:47:06,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:47:06,198 INFO L87 Difference]: Start difference. First operand 3320 states and 9599 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:07,342 INFO L93 Difference]: Finished difference Result 4414 states and 12453 transitions. [2022-11-02 20:47:07,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:47:07,343 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:47:07,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:07,355 INFO L225 Difference]: With dead ends: 4414 [2022-11-02 20:47:07,355 INFO L226 Difference]: Without dead ends: 4414 [2022-11-02 20:47:07,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:47:07,356 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 438 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:07,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 71 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:47:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4414 states. [2022-11-02 20:47:07,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4414 to 2998. [2022-11-02 20:47:07,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2998 states, 2970 states have (on average 2.9154882154882156) internal successors, (8659), 2997 states have internal predecessors, (8659), 0 states have call successors, (0), 0 states 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:47:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 8659 transitions. [2022-11-02 20:47:07,478 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 8659 transitions. Word has length 22 [2022-11-02 20:47:07,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:07,479 INFO L495 AbstractCegarLoop]: Abstraction has 2998 states and 8659 transitions. [2022-11-02 20:47:07,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:07,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 8659 transitions. [2022-11-02 20:47:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:47:07,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:07,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:07,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:47:07,482 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:07,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:07,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1969734480, now seen corresponding path program 3 times [2022-11-02 20:47:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:07,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670861855] [2022-11-02 20:47:07,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,084 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:47:09,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:09,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670861855] [2022-11-02 20:47:09,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670861855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:09,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:09,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:47:09,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746737476] [2022-11-02 20:47:09,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:09,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:47:09,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:09,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:47:09,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:47:09,086 INFO L87 Difference]: Start difference. First operand 2998 states and 8659 transitions. Second operand has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:10,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:10,300 INFO L93 Difference]: Finished difference Result 3239 states and 9192 transitions. [2022-11-02 20:47:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:47:10,300 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:47:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:10,306 INFO L225 Difference]: With dead ends: 3239 [2022-11-02 20:47:10,306 INFO L226 Difference]: Without dead ends: 3239 [2022-11-02 20:47:10,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:47:10,307 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 182 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:10,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 89 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:47:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2022-11-02 20:47:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 2983. [2022-11-02 20:47:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2955 states have (on average 2.9170896785109983) internal successors, (8620), 2982 states have internal predecessors, (8620), 0 states have call successors, (0), 0 states 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:47:10,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 8620 transitions. [2022-11-02 20:47:10,350 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 8620 transitions. Word has length 22 [2022-11-02 20:47:10,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:10,350 INFO L495 AbstractCegarLoop]: Abstraction has 2983 states and 8620 transitions. [2022-11-02 20:47:10,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 8620 transitions. [2022-11-02 20:47:10,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:47:10,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:10,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:10,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:47:10,352 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:10,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1992170610, now seen corresponding path program 4 times [2022-11-02 20:47:10,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:10,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974814140] [2022-11-02 20:47:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:11,162 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:47:11,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:11,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974814140] [2022-11-02 20:47:11,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974814140] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:11,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:11,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:47:11,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9820515] [2022-11-02 20:47:11,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:11,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:47:11,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:11,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:47:11,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:47:11,164 INFO L87 Difference]: Start difference. First operand 2983 states and 8620 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:11,937 INFO L93 Difference]: Finished difference Result 2746 states and 7848 transitions. [2022-11-02 20:47:11,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:47:11,938 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:47:11,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:11,943 INFO L225 Difference]: With dead ends: 2746 [2022-11-02 20:47:11,943 INFO L226 Difference]: Without dead ends: 2746 [2022-11-02 20:47:11,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:47:11,944 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 142 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:11,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 77 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:47:11,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2022-11-02 20:47:11,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2666. [2022-11-02 20:47:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2666 states, 2638 states have (on average 2.8968915845337375) internal successors, (7642), 2665 states have internal predecessors, (7642), 0 states have call successors, (0), 0 states 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:47:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 7642 transitions. [2022-11-02 20:47:11,982 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 7642 transitions. Word has length 22 [2022-11-02 20:47:11,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:11,982 INFO L495 AbstractCegarLoop]: Abstraction has 2666 states and 7642 transitions. [2022-11-02 20:47:11,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 7642 transitions. [2022-11-02 20:47:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:47:11,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:11,984 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:11,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:47:11,985 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:11,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:11,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1628691854, now seen corresponding path program 1 times [2022-11-02 20:47:11,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:11,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784145628] [2022-11-02 20:47:11,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:11,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:12,042 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:47:12,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:12,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784145628] [2022-11-02 20:47:12,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784145628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:12,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:12,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:12,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214578911] [2022-11-02 20:47:12,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:12,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:12,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:12,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:12,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:12,044 INFO L87 Difference]: Start difference. First operand 2666 states and 7642 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:12,129 INFO L93 Difference]: Finished difference Result 966 states and 2526 transitions. [2022-11-02 20:47:12,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:12,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 20:47:12,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:12,131 INFO L225 Difference]: With dead ends: 966 [2022-11-02 20:47:12,131 INFO L226 Difference]: Without dead ends: 886 [2022-11-02 20:47:12,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:12,131 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:12,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 11 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-11-02 20:47:12,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 658. [2022-11-02 20:47:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 642 states have (on average 2.5576323987538943) internal successors, (1642), 657 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states 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:47:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1642 transitions. [2022-11-02 20:47:12,143 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1642 transitions. Word has length 31 [2022-11-02 20:47:12,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:12,143 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 1642 transitions. [2022-11-02 20:47:12,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:12,144 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1642 transitions. [2022-11-02 20:47:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:47:12,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:12,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:12,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:47:12,145 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:12,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:12,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1406668626, now seen corresponding path program 1 times [2022-11-02 20:47:12,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:12,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742596825] [2022-11-02 20:47:12,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:12,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:12,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:47:12,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:12,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742596825] [2022-11-02 20:47:12,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742596825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:12,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:12,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:12,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997292916] [2022-11-02 20:47:12,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:12,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:12,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:12,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:12,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:12,241 INFO L87 Difference]: Start difference. First operand 658 states and 1642 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:12,340 INFO L93 Difference]: Finished difference Result 458 states and 1006 transitions. [2022-11-02 20:47:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:12,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-02 20:47:12,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:12,342 INFO L225 Difference]: With dead ends: 458 [2022-11-02 20:47:12,342 INFO L226 Difference]: Without dead ends: 440 [2022-11-02 20:47:12,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:12,343 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 44 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:12,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-11-02 20:47:12,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2022-11-02 20:47:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 432 states have (on average 2.2453703703703702) internal successors, (970), 439 states have internal predecessors, (970), 0 states have call successors, (0), 0 states 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:47:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 970 transitions. [2022-11-02 20:47:12,351 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 970 transitions. Word has length 32 [2022-11-02 20:47:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:12,351 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 970 transitions. [2022-11-02 20:47:12,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:12,352 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 970 transitions. [2022-11-02 20:47:12,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:47:12,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:12,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:12,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:47:12,353 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:12,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:12,354 INFO L85 PathProgramCache]: Analyzing trace with hash -733889250, now seen corresponding path program 1 times [2022-11-02 20:47:12,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:12,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449431733] [2022-11-02 20:47:12,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:12,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:13,216 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:47:13,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:13,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449431733] [2022-11-02 20:47:13,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449431733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:13,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:13,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:47:13,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701854428] [2022-11-02 20:47:13,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:13,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:47:13,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:13,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:47:13,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:47:13,220 INFO L87 Difference]: Start difference. First operand 440 states and 970 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:14,429 INFO L93 Difference]: Finished difference Result 889 states and 1965 transitions. [2022-11-02 20:47:14,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:47:14,430 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:47:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:14,431 INFO L225 Difference]: With dead ends: 889 [2022-11-02 20:47:14,431 INFO L226 Difference]: Without dead ends: 889 [2022-11-02 20:47:14,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=251, Invalid=679, Unknown=0, NotChecked=0, Total=930 [2022-11-02 20:47:14,432 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 353 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:14,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 69 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:47:14,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2022-11-02 20:47:14,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 636. [2022-11-02 20:47:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 628 states have (on average 2.254777070063694) internal successors, (1416), 635 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states 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:47:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1416 transitions. [2022-11-02 20:47:14,443 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1416 transitions. Word has length 33 [2022-11-02 20:47:14,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:14,444 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 1416 transitions. [2022-11-02 20:47:14,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1416 transitions. [2022-11-02 20:47:14,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:47:14,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:14,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:14,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:47:14,446 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:14,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:14,447 INFO L85 PathProgramCache]: Analyzing trace with hash -733889249, now seen corresponding path program 1 times [2022-11-02 20:47:14,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:14,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815354416] [2022-11-02 20:47:14,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:14,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:14,906 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:47:14,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:14,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815354416] [2022-11-02 20:47:14,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815354416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:14,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:14,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:47:14,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541692431] [2022-11-02 20:47:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:14,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:47:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:14,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:47:14,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:14,910 INFO L87 Difference]: Start difference. First operand 636 states and 1416 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:15,161 INFO L93 Difference]: Finished difference Result 748 states and 1656 transitions. [2022-11-02 20:47:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:47:15,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:47:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:15,163 INFO L225 Difference]: With dead ends: 748 [2022-11-02 20:47:15,163 INFO L226 Difference]: Without dead ends: 748 [2022-11-02 20:47:15,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:47:15,164 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 116 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:15,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 28 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-11-02 20:47:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 732. [2022-11-02 20:47:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 724 states have (on average 2.251381215469613) internal successors, (1630), 731 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states 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:47:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1630 transitions. [2022-11-02 20:47:15,176 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1630 transitions. Word has length 33 [2022-11-02 20:47:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:15,176 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 1630 transitions. [2022-11-02 20:47:15,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1630 transitions. [2022-11-02 20:47:15,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:47:15,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:15,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:15,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:47:15,179 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:15,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:15,180 INFO L85 PathProgramCache]: Analyzing trace with hash -831709690, now seen corresponding path program 2 times [2022-11-02 20:47:15,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:15,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748536352] [2022-11-02 20:47:15,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:15,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,648 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:47:16,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:16,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748536352] [2022-11-02 20:47:16,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748536352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:16,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:16,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-02 20:47:16,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357563221] [2022-11-02 20:47:16,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:16,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 20:47:16,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:16,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:47:16,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:47:16,651 INFO L87 Difference]: Start difference. First operand 732 states and 1630 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:18,008 INFO L93 Difference]: Finished difference Result 926 states and 2065 transitions. [2022-11-02 20:47:18,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:47:18,009 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:47:18,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:18,010 INFO L225 Difference]: With dead ends: 926 [2022-11-02 20:47:18,010 INFO L226 Difference]: Without dead ends: 926 [2022-11-02 20:47:18,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:47:18,011 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 117 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:18,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 118 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:47:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-11-02 20:47:18,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 717. [2022-11-02 20:47:18,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 709 states have (on average 2.2566995768688294) internal successors, (1600), 716 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states 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:47:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1600 transitions. [2022-11-02 20:47:18,021 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1600 transitions. Word has length 33 [2022-11-02 20:47:18,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:18,022 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 1600 transitions. [2022-11-02 20:47:18,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1600 transitions. [2022-11-02 20:47:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:47:18,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:18,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:18,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:47:18,024 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:18,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:18,025 INFO L85 PathProgramCache]: Analyzing trace with hash 968683978, now seen corresponding path program 3 times [2022-11-02 20:47:18,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:18,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912065486] [2022-11-02 20:47:18,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:18,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:19,370 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:47:19,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:19,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912065486] [2022-11-02 20:47:19,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912065486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:19,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:19,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-02 20:47:19,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413591391] [2022-11-02 20:47:19,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:19,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 20:47:19,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:19,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:47:19,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:47:19,372 INFO L87 Difference]: Start difference. First operand 717 states and 1600 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:20,550 INFO L93 Difference]: Finished difference Result 844 states and 1881 transitions. [2022-11-02 20:47:20,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:47:20,551 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:47:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:20,552 INFO L225 Difference]: With dead ends: 844 [2022-11-02 20:47:20,552 INFO L226 Difference]: Without dead ends: 844 [2022-11-02 20:47:20,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:47:20,553 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 165 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:20,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 93 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:47:20,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2022-11-02 20:47:20,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 650. [2022-11-02 20:47:20,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 642 states have (on average 2.2523364485981308) internal successors, (1446), 649 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states 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:47:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1446 transitions. [2022-11-02 20:47:20,562 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1446 transitions. Word has length 33 [2022-11-02 20:47:20,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:20,562 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 1446 transitions. [2022-11-02 20:47:20,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1446 transitions. [2022-11-02 20:47:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:47:20,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:20,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:20,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:47:20,563 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:20,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:20,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1014820086, now seen corresponding path program 4 times [2022-11-02 20:47:20,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:20,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968234273] [2022-11-02 20:47:20,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:20,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:21,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:47:21,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:21,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968234273] [2022-11-02 20:47:21,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968234273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:21,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:21,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-02 20:47:21,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610763678] [2022-11-02 20:47:21,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:21,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 20:47:21,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:21,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:47:21,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:47:21,854 INFO L87 Difference]: Start difference. First operand 650 states and 1446 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:23,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:23,240 INFO L93 Difference]: Finished difference Result 718 states and 1589 transitions. [2022-11-02 20:47:23,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:47:23,241 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:47:23,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:23,242 INFO L225 Difference]: With dead ends: 718 [2022-11-02 20:47:23,242 INFO L226 Difference]: Without dead ends: 718 [2022-11-02 20:47:23,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2022-11-02 20:47:23,243 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 159 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:23,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 106 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:47:23,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-11-02 20:47:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 604. [2022-11-02 20:47:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 2.2449664429530203) internal successors, (1338), 603 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states 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:47:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1338 transitions. [2022-11-02 20:47:23,251 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1338 transitions. Word has length 33 [2022-11-02 20:47:23,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:23,252 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 1338 transitions. [2022-11-02 20:47:23,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1338 transitions. [2022-11-02 20:47:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:47:23,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:23,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:23,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:47:23,254 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:23,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:23,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1290180387, now seen corresponding path program 2 times [2022-11-02 20:47:23,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:23,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415977349] [2022-11-02 20:47:23,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:23,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:23,839 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:47:23,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:23,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415977349] [2022-11-02 20:47:23,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415977349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:23,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:23,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:47:23,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423906009] [2022-11-02 20:47:23,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:23,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:47:23,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:23,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:47:23,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:47:23,841 INFO L87 Difference]: Start difference. First operand 604 states and 1338 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:24,254 INFO L93 Difference]: Finished difference Result 596 states and 1321 transitions. [2022-11-02 20:47:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:47:24,255 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:47:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:24,256 INFO L225 Difference]: With dead ends: 596 [2022-11-02 20:47:24,256 INFO L226 Difference]: Without dead ends: 596 [2022-11-02 20:47:24,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:47:24,257 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 195 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:24,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 26 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:24,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-11-02 20:47:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 500. [2022-11-02 20:47:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 493 states have (on average 2.2454361054766734) internal successors, (1107), 499 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states 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:47:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1107 transitions. [2022-11-02 20:47:24,266 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1107 transitions. Word has length 33 [2022-11-02 20:47:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:24,267 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 1107 transitions. [2022-11-02 20:47:24,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1107 transitions. [2022-11-02 20:47:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:47:24,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:24,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:24,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 20:47:24,269 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:24,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:24,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1909980202, now seen corresponding path program 1 times [2022-11-02 20:47:24,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:24,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137221329] [2022-11-02 20:47:24,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:24,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:26,022 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:47:26,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:26,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137221329] [2022-11-02 20:47:26,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137221329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:26,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:26,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:47:26,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458876132] [2022-11-02 20:47:26,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:26,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:47:26,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:26,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:47:26,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:47:26,024 INFO L87 Difference]: Start difference. First operand 500 states and 1107 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:27,002 INFO L93 Difference]: Finished difference Result 792 states and 1756 transitions. [2022-11-02 20:47:27,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:47:27,002 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 20:47:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:27,004 INFO L225 Difference]: With dead ends: 792 [2022-11-02 20:47:27,004 INFO L226 Difference]: Without dead ends: 792 [2022-11-02 20:47:27,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:47:27,005 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 184 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:27,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 56 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:47:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2022-11-02 20:47:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 730. [2022-11-02 20:47:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 723 states have (on average 2.2461964038727524) internal successors, (1624), 729 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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:47:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1624 transitions. [2022-11-02 20:47:27,015 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1624 transitions. Word has length 36 [2022-11-02 20:47:27,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:27,015 INFO L495 AbstractCegarLoop]: Abstraction has 730 states and 1624 transitions. [2022-11-02 20:47:27,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1624 transitions. [2022-11-02 20:47:27,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:47:27,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:27,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:27,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 20:47:27,017 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1909980301, now seen corresponding path program 1 times [2022-11-02 20:47:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:27,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842635232] [2022-11-02 20:47:27,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:27,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:28,865 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:47:28,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:28,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842635232] [2022-11-02 20:47:28,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842635232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:28,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:28,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:47:28,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840553703] [2022-11-02 20:47:28,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:28,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:47:28,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:28,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:47:28,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:47:28,867 INFO L87 Difference]: Start difference. First operand 730 states and 1624 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:29,964 INFO L93 Difference]: Finished difference Result 734 states and 1620 transitions. [2022-11-02 20:47:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:47:29,964 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 20:47:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:29,965 INFO L225 Difference]: With dead ends: 734 [2022-11-02 20:47:29,965 INFO L226 Difference]: Without dead ends: 693 [2022-11-02 20:47:29,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:47:29,966 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 144 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:29,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 46 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:47:29,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-11-02 20:47:29,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 689. [2022-11-02 20:47:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 682 states have (on average 2.228739002932551) internal successors, (1520), 688 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states 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:47:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1520 transitions. [2022-11-02 20:47:29,976 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1520 transitions. Word has length 36 [2022-11-02 20:47:29,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:29,976 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 1520 transitions. [2022-11-02 20:47:29,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:29,977 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1520 transitions. [2022-11-02 20:47:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:47:29,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:29,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:29,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 20:47:29,979 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:29,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1442134254, now seen corresponding path program 2 times [2022-11-02 20:47:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:29,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138962314] [2022-11-02 20:47:29,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:29,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:31,459 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:47:31,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:31,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138962314] [2022-11-02 20:47:31,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138962314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:31,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:31,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:47:31,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968591569] [2022-11-02 20:47:31,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:31,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:47:31,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:31,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:47:31,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:47:31,461 INFO L87 Difference]: Start difference. First operand 689 states and 1520 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:32,213 INFO L93 Difference]: Finished difference Result 898 states and 1983 transitions. [2022-11-02 20:47:32,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:47:32,213 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 20:47:32,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:32,215 INFO L225 Difference]: With dead ends: 898 [2022-11-02 20:47:32,216 INFO L226 Difference]: Without dead ends: 857 [2022-11-02 20:47:32,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:47:32,217 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 147 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:32,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 54 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:47:32,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2022-11-02 20:47:32,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 664. [2022-11-02 20:47:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 657 states have (on average 2.2374429223744294) internal successors, (1470), 663 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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:47:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1470 transitions. [2022-11-02 20:47:32,240 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1470 transitions. Word has length 36 [2022-11-02 20:47:32,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:32,241 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 1470 transitions. [2022-11-02 20:47:32,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:32,243 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1470 transitions. [2022-11-02 20:47:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:47:32,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:32,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:32,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 20:47:32,245 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:32,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:32,246 INFO L85 PathProgramCache]: Analyzing trace with hash 180256682, now seen corresponding path program 3 times [2022-11-02 20:47:32,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:32,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783880219] [2022-11-02 20:47:32,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:32,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:33,637 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:47:33,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:33,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783880219] [2022-11-02 20:47:33,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783880219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:33,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:33,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:47:33,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39532621] [2022-11-02 20:47:33,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:33,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:47:33,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:33,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:47:33,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:47:33,640 INFO L87 Difference]: Start difference. First operand 664 states and 1470 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:34,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:34,282 INFO L93 Difference]: Finished difference Result 856 states and 1895 transitions. [2022-11-02 20:47:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:47:34,282 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 20:47:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:34,284 INFO L225 Difference]: With dead ends: 856 [2022-11-02 20:47:34,284 INFO L226 Difference]: Without dead ends: 856 [2022-11-02 20:47:34,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:47:34,285 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 146 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:34,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 67 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:47:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-11-02 20:47:34,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 794. [2022-11-02 20:47:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 787 states have (on average 2.2401524777636594) internal successors, (1763), 793 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states 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:47:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1763 transitions. [2022-11-02 20:47:34,299 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1763 transitions. Word has length 36 [2022-11-02 20:47:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:34,300 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1763 transitions. [2022-11-02 20:47:34,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1763 transitions. [2022-11-02 20:47:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:47:34,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:34,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:34,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 20:47:34,302 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:34,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:34,303 INFO L85 PathProgramCache]: Analyzing trace with hash 180256583, now seen corresponding path program 2 times [2022-11-02 20:47:34,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:34,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107067145] [2022-11-02 20:47:34,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:34,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:35,764 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:47:35,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:35,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107067145] [2022-11-02 20:47:35,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107067145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:35,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:35,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:47:35,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080848827] [2022-11-02 20:47:35,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:35,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:47:35,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:35,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:47:35,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:47:35,766 INFO L87 Difference]: Start difference. First operand 794 states and 1763 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:36,499 INFO L93 Difference]: Finished difference Result 903 states and 1990 transitions. [2022-11-02 20:47:36,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:47:36,499 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 20:47:36,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:36,501 INFO L225 Difference]: With dead ends: 903 [2022-11-02 20:47:36,501 INFO L226 Difference]: Without dead ends: 821 [2022-11-02 20:47:36,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:47:36,502 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 123 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:36,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 50 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:47:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-11-02 20:47:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 564. [2022-11-02 20:47:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 557 states have (on average 2.236983842010772) internal successors, (1246), 563 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states 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:47:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1246 transitions. [2022-11-02 20:47:36,514 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1246 transitions. Word has length 36 [2022-11-02 20:47:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:36,514 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 1246 transitions. [2022-11-02 20:47:36,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1246 transitions. [2022-11-02 20:47:36,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:47:36,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:36,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:36,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 20:47:36,516 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:36,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:36,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1530103166, now seen corresponding path program 4 times [2022-11-02 20:47:36,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:36,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870533787] [2022-11-02 20:47:36,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:36,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:37,869 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:47:37,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:37,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870533787] [2022-11-02 20:47:37,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870533787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:37,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:37,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:47:37,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111627347] [2022-11-02 20:47:37,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:37,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:47:37,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:37,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:47:37,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:47:37,871 INFO L87 Difference]: Start difference. First operand 564 states and 1246 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:38,676 INFO L93 Difference]: Finished difference Result 592 states and 1301 transitions. [2022-11-02 20:47:38,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:47:38,676 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 20:47:38,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:38,677 INFO L225 Difference]: With dead ends: 592 [2022-11-02 20:47:38,677 INFO L226 Difference]: Without dead ends: 550 [2022-11-02 20:47:38,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:47:38,678 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 139 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:38,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 61 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:47:38,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-11-02 20:47:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 482. [2022-11-02 20:47:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 475 states have (on average 2.231578947368421) internal successors, (1060), 481 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:47:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1060 transitions. [2022-11-02 20:47:38,686 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1060 transitions. Word has length 36 [2022-11-02 20:47:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:38,687 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 1060 transitions. [2022-11-02 20:47:38,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1060 transitions. [2022-11-02 20:47:38,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:47:38,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:38,688 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:38,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-02 20:47:38,689 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:47:38,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:38,689 INFO L85 PathProgramCache]: Analyzing trace with hash 835479563, now seen corresponding path program 1 times [2022-11-02 20:47:38,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:38,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815646300] [2022-11-02 20:47:38,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:38,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:39,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:39,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815646300] [2022-11-02 20:47:39,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815646300] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:39,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829645904] [2022-11-02 20:47:39,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:39,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:39,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:39,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:39,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:47:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:39,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-02 20:47:39,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:39,715 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:47:39,783 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 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-02 20:47:39,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:39,818 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 18 treesize of output 20 [2022-11-02 20:47:39,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:47:39,961 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 36 treesize of output 20 [2022-11-02 20:47:40,026 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 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-02 20:47:40,145 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-02 20:47:40,145 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 27 treesize of output 32 [2022-11-02 20:47:40,244 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:47:40,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:00,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_2265 Int) (v_ArrVal_2267 Int) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2270 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2264) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (+ v_ArrVal_2265 1) (select .cse0 .cse1)) (< 0 (+ 2147483650 (select (store (store (store .cse0 .cse1 v_ArrVal_2265) (+ |c_~#queue~0.offset| 80) v_ArrVal_2267) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_2270) .cse1))) (< (+ v_ArrVal_2270 2147483648) 0)))) is different from false [2022-11-02 20:48:00,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_2262 Int) (v_ArrVal_2265 Int) (v_ArrVal_2267 Int) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2270 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2262)) |c_~#stored_elements~0.base| v_ArrVal_2264) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< 0 (+ (select (store (store (store .cse0 .cse1 v_ArrVal_2265) (+ |c_~#queue~0.offset| 80) v_ArrVal_2267) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_2270) .cse1) 2147483650)) (< (+ v_ArrVal_2265 1) (select .cse0 .cse1)) (< (+ v_ArrVal_2270 2147483648) 0)))) is different from false [2022-11-02 20:48:00,095 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:00,096 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 66 [2022-11-02 20:48:00,110 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:00,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 106 [2022-11-02 20:48:00,120 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 42 treesize of output 38 [2022-11-02 20:48:00,137 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 9 treesize of output 5 [2022-11-02 20:48:00,155 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:00,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 57 [2022-11-02 20:48:00,291 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:00,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829645904] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:00,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:00,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 29 [2022-11-02 20:48:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399723139] [2022-11-02 20:48:00,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:00,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-02 20:48:00,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:00,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 20:48:00,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=671, Unknown=21, NotChecked=110, Total=930 [2022-11-02 20:48:00,294 INFO L87 Difference]: Start difference. First operand 482 states and 1060 transitions. Second operand has 31 states, 30 states have (on average 4.6) internal successors, (138), 30 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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:01,819 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (<= 0 (+ 2147483648 (select .cse2 .cse3))))) (and (<= 0 (+ 2147483648 (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 88 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|)))) .cse0 (= |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 0) (let ((.cse1 (= 88 (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)))) (or (and .cse0 (not .cse1)) (and .cse1 (<= 0 (+ |c_t1Thread1of1ForFork0_enqueue_~x#1| 2147483648))))) (= |c_~#queue~0.offset| 0) (= |c_t2Thread1of1ForFork1_dequeue_~q#1.base| |c_~#queue~0.base|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_2270 Int)) (or (< 0 (+ 2147483650 (select (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_2270) .cse3))) (not (<= |c_t1Thread1of1ForFork0_enqueue_~x#1| v_ArrVal_2270))))))) is different from false [2022-11-02 20:48:03,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:03,808 INFO L93 Difference]: Finished difference Result 1522 states and 3372 transitions. [2022-11-02 20:48:03,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:48:03,808 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.6) internal successors, (138), 30 states have internal predecessors, (138), 0 states have call successors, (0), 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 46 [2022-11-02 20:48:03,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:03,810 INFO L225 Difference]: With dead ends: 1522 [2022-11-02 20:48:03,810 INFO L226 Difference]: Without dead ends: 1522 [2022-11-02 20:48:03,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=623, Invalid=1916, Unknown=23, NotChecked=300, Total=2862 [2022-11-02 20:48:03,812 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 572 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 2586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1299 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:03,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 176 Invalid, 2586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1169 Invalid, 0 Unknown, 1299 Unchecked, 1.0s Time] [2022-11-02 20:48:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2022-11-02 20:48:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 834. [2022-11-02 20:48:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 827 states have (on average 2.3675937122128174) internal successors, (1958), 833 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:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1958 transitions. [2022-11-02 20:48:03,827 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1958 transitions. Word has length 46 [2022-11-02 20:48:03,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:03,827 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1958 transitions. [2022-11-02 20:48:03,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.6) internal successors, (138), 30 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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,828 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1958 transitions. [2022-11-02 20:48:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:48:03,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:03,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:03,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:04,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-02 20:48:04,043 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:48:04,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:04,043 INFO L85 PathProgramCache]: Analyzing trace with hash 835479479, now seen corresponding path program 1 times [2022-11-02 20:48:04,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:04,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41334782] [2022-11-02 20:48:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:04,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,079 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:06,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:06,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41334782] [2022-11-02 20:48:06,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41334782] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:06,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41967209] [2022-11-02 20:48:06,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:06,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:06,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:06,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:06,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:48:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-02 20:48:06,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:06,625 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 0 case distinctions, treesize of input 32 treesize of output 16 [2022-11-02 20:48:06,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:06,666 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 17 treesize of output 19 [2022-11-02 20:48:06,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:06,779 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 20:48:06,784 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2022-11-02 20:48:06,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:06,855 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 24 treesize of output 23 [2022-11-02 20:48:07,011 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:07,011 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2022-11-02 20:48:07,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:07,062 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 26 treesize of output 26 [2022-11-02 20:48:07,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:07,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:07,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2022-11-02 20:48:07,342 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:07,342 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2022-11-02 20:48:07,527 INFO L356 Elim1Store]: treesize reduction 69, result has 28.9 percent of original size [2022-11-02 20:48:07,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 49 [2022-11-02 20:48:07,571 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:07,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:11,547 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2411 Int) (v_ArrVal_2407 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_2411) .cse1) 2147483647)))) is different from false [2022-11-02 20:48:11,566 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2411 Int) (v_ArrVal_2407 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_2411) .cse1) 2147483647)))) is different from false [2022-11-02 20:48:11,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2411 Int) (v_ArrVal_2407 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_2411) .cse1) 2147483647)))) is different from false [2022-11-02 20:48:11,625 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2411 Int) (v_ArrVal_2402 Int) (v_ArrVal_2407 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2402) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_2402) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_2411) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_2407 1))))) is different from false [2022-11-02 20:48:11,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2400 Int) (v_ArrVal_2411 Int) (v_ArrVal_2402 Int) (v_ArrVal_2407 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2400)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2402) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_2402) (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_2411) .cse1) 2147483647)))) is different from false [2022-11-02 20:48:11,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2400 Int) (v_ArrVal_2411 Int) (v_ArrVal_2402 Int) (v_ArrVal_2407 Int)) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2400)))) (store (store .cse3 .cse1 v_ArrVal_2402) .cse2 (+ (select .cse3 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_2402) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ (* 4 (select .cse0 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2411) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)))))) is different from false [2022-11-02 20:48:11,788 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2400 Int) (v_ArrVal_2411 Int) (v_ArrVal_2402 Int) (v_ArrVal_2407 Int)) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2399))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2400)))) (store (store .cse4 .cse1 v_ArrVal_2402) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)) (< 2147483647 v_ArrVal_2402) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2411) .cse1) 2147483647))))) is different from false [2022-11-02 20:48:11,818 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2400 Int) (v_ArrVal_2411 Int) (v_ArrVal_2402 Int) (v_ArrVal_2407 Int)) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2399))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_2400)))) (store (store .cse4 .cse1 v_ArrVal_2402) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_2402) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) v_ArrVal_2411) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)))))) is different from false [2022-11-02 20:48:11,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2400 Int) (v_ArrVal_2411 Int) (v_ArrVal_2402 Int) (v_ArrVal_2407 Int)) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2399))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_2400)))) (store (store .cse4 .cse1 v_ArrVal_2402) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)) (< 2147483647 v_ArrVal_2402) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) v_ArrVal_2411) .cse1) 2147483647))))) is different from false [2022-11-02 20:48:11,915 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:11,915 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 524 treesize of output 260 [2022-11-02 20:48:11,940 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:11,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 320 treesize of output 314 [2022-11-02 20:48:11,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:11,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 299 treesize of output 275 [2022-11-02 20:48:11,967 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 74 treesize of output 66 [2022-11-02 20:48:11,983 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 7 treesize of output 3 [2022-11-02 20:48:12,043 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:12,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 83 [2022-11-02 20:48:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 20:48:12,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41967209] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:12,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:12,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 57 [2022-11-02 20:48:12,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181872445] [2022-11-02 20:48:12,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:12,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-02 20:48:12,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:12,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-02 20:48:12,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2222, Unknown=13, NotChecked=936, Total=3422 [2022-11-02 20:48:12,309 INFO L87 Difference]: Start difference. First operand 834 states and 1958 transitions. Second operand has 59 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 58 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:17,697 INFO L93 Difference]: Finished difference Result 2425 states and 5690 transitions. [2022-11-02 20:48:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-02 20:48:17,697 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 58 states have internal predecessors, (138), 0 states have call successors, (0), 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 46 [2022-11-02 20:48:17,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:17,701 INFO L225 Difference]: With dead ends: 2425 [2022-11-02 20:48:17,701 INFO L226 Difference]: Without dead ends: 2425 [2022-11-02 20:48:17,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 68 SyntacticMatches, 11 SemanticMatches, 89 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 1958 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=985, Invalid=5680, Unknown=13, NotChecked=1512, Total=8190 [2022-11-02 20:48:17,703 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1068 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 2990 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 6068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 2990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2847 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:17,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 370 Invalid, 6068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 2990 Invalid, 0 Unknown, 2847 Unchecked, 2.1s Time] [2022-11-02 20:48:17,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2022-11-02 20:48:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 1557. [2022-11-02 20:48:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1550 states have (on average 2.4070967741935485) internal successors, (3731), 1556 states have internal predecessors, (3731), 0 states have call successors, (0), 0 states 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,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 3731 transitions. [2022-11-02 20:48:17,730 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 3731 transitions. Word has length 46 [2022-11-02 20:48:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:17,730 INFO L495 AbstractCegarLoop]: Abstraction has 1557 states and 3731 transitions. [2022-11-02 20:48:17,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 58 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 3731 transitions. [2022-11-02 20:48:17,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:48:17,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:17,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:17,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:17,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-11-02 20:48:17,934 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-02 20:48:17,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:17,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1708578165, now seen corresponding path program 2 times [2022-11-02 20:48:17,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:17,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816736106] [2022-11-02 20:48:17,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:17,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:20,410 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:20,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:20,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816736106] [2022-11-02 20:48:20,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816736106] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:20,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183825155] [2022-11-02 20:48:20,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:48:20,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:20,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:20,415 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:20,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1200f41-5422-4eac-bc86-8bf9ab036866/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:48:20,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:48:20,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:48:20,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-02 20:48:20,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:20,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:20,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:20,901 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:48:20,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-02 20:48:20,923 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-02 20:48:20,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 20:48:21,110 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 46 treesize of output 39 [2022-11-02 20:48:21,707 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 42 treesize of output 37 [2022-11-02 20:48:25,194 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 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-02 20:48:31,156 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 45 treesize of output 47 [2022-11-02 20:48:37,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:37,544 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 45 treesize of output 47 [2022-11-02 20:48:39,020 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 63 treesize of output 56 [2022-11-02 20:48:49,260 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 59 treesize of output 54 [2022-11-02 20:49:13,780 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 0 case distinctions, treesize of input 75 treesize of output 68