./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 --- 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-b5237d8 [2022-11-22 01:52:53,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:52:53,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:52:53,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:52:53,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:52:53,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:52:53,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:52:53,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:52:53,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:52:53,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:52:53,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:52:53,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:52:53,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:52:53,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:52:53,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:52:53,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:52:53,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:52:53,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:52:53,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:52:53,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:52:53,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:52:53,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:52:53,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:52:53,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:52:53,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:52:53,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:52:53,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:52:53,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:52:53,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:52:53,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:52:53,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:52:53,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:52:53,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:52:53,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:52:53,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:52:53,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:52:53,796 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:52:53,796 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:52:53,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:52:53,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:52:53,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:52:53,799 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 01:52:53,836 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:52:53,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:52:53,837 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:52:53,837 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:52:53,838 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:52:53,838 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:52:53,839 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:52:53,839 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:52:53,839 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:52:53,839 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:52:53,840 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:52:53,841 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:52:53,841 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:52:53,841 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:52:53,841 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:52:53,841 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:52:53,842 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:52:53,842 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:52:53,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:52:53,843 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:52:53,843 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:52:53,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:52:53,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:52:53,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:52:53,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:52:53,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:52:53,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:52:53,844 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 01:52:53,845 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:52:53,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:52:53,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:52:53,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:52:53,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:52:53,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:52:53,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:52:53,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:52:53,847 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:52:53,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:52:53,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:52:53,847 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:52:53,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:52:53,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:52:53,848 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:52:53,848 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_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/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_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba 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 -> Taipan 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 -> 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 [2022-11-22 01:52:54,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:52:54,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:52:54,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:52:54,181 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:52:54,181 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:52:54,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread/queue_longest.i [2022-11-22 01:52:57,252 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:52:57,589 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:52:57,596 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/sv-benchmarks/c/pthread/queue_longest.i [2022-11-22 01:52:57,614 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/data/251848513/c3578ced3aef41bf82150b49723ebb1d/FLAG8ce98baf8 [2022-11-22 01:52:57,633 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/data/251848513/c3578ced3aef41bf82150b49723ebb1d [2022-11-22 01:52:57,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:52:57,638 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:52:57,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:52:57,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:52:57,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:52:57,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:52:57" (1/1) ... [2022-11-22 01:52:57,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d6d82ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:57, skipping insertion in model container [2022-11-22 01:52:57,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:52:57" (1/1) ... [2022-11-22 01:52:57,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:52:57,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:52:58,319 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/sv-benchmarks/c/pthread/queue_longest.i[43296,43309] [2022-11-22 01:52:58,323 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/sv-benchmarks/c/pthread/queue_longest.i[43503,43516] [2022-11-22 01:52:58,326 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/sv-benchmarks/c/pthread/queue_longest.i[43783,43796] [2022-11-22 01:52:58,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:52:58,342 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:52:58,401 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/sv-benchmarks/c/pthread/queue_longest.i[43296,43309] [2022-11-22 01:52:58,403 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/sv-benchmarks/c/pthread/queue_longest.i[43503,43516] [2022-11-22 01:52:58,409 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/sv-benchmarks/c/pthread/queue_longest.i[43783,43796] [2022-11-22 01:52:58,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:52:58,475 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:52:58,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:58 WrapperNode [2022-11-22 01:52:58,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:52:58,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:52:58,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:52:58,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:52:58,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:58" (1/1) ... [2022-11-22 01:52:58,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:58" (1/1) ... [2022-11-22 01:52:58,578 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 259 [2022-11-22 01:52:58,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:52:58,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:52:58,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:52:58,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:52:58,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:58" (1/1) ... [2022-11-22 01:52:58,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:58" (1/1) ... [2022-11-22 01:52:58,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:58" (1/1) ... [2022-11-22 01:52:58,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:58" (1/1) ... [2022-11-22 01:52:58,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:58" (1/1) ... [2022-11-22 01:52:58,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:58" (1/1) ... [2022-11-22 01:52:58,648 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:58" (1/1) ... [2022-11-22 01:52:58,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:58" (1/1) ... [2022-11-22 01:52:58,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:52:58,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:52:58,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:52:58,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:52:58,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:58" (1/1) ... [2022-11-22 01:52:58,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:52:58,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:52:58,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:52:58,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:52:58,755 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-22 01:52:58,755 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-22 01:52:58,756 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-22 01:52:58,756 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-22 01:52:58,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:52:58,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:52:58,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 01:52:58,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:52:58,757 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-22 01:52:58,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:52:58,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:52:58,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:52:58,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:52:58,759 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 01:52:58,968 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:52:58,970 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:52:59,445 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:52:59,456 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:52:59,456 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-22 01:52:59,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:52:59 BoogieIcfgContainer [2022-11-22 01:52:59,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:52:59,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:52:59,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:52:59,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:52:59,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:52:57" (1/3) ... [2022-11-22 01:52:59,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655bba96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:52:59, skipping insertion in model container [2022-11-22 01:52:59,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:52:58" (2/3) ... [2022-11-22 01:52:59,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655bba96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:52:59, skipping insertion in model container [2022-11-22 01:52:59,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:52:59" (3/3) ... [2022-11-22 01:52:59,479 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2022-11-22 01:52:59,489 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 01:52:59,511 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:52:59,511 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-22 01:52:59,511 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 01:52:59,701 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-22 01:52:59,759 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 01:52:59,812 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 297 places, 305 transitions, 626 flow [2022-11-22 01:52:59,815 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 297 places, 305 transitions, 626 flow [2022-11-22 01:52:59,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 305 transitions, 626 flow [2022-11-22 01:53:00,023 INFO L130 PetriNetUnfolder]: 15/303 cut-off events. [2022-11-22 01:53:00,023 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-22 01:53:00,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 303 events. 15/303 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 469 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-11-22 01:53:00,045 INFO L119 LiptonReduction]: Number of co-enabled transitions 23276 [2022-11-22 01:53:12,347 INFO L134 LiptonReduction]: Checked pairs total: 47634 [2022-11-22 01:53:12,348 INFO L136 LiptonReduction]: Total number of compositions: 291 [2022-11-22 01:53:12,363 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 80 transitions, 176 flow [2022-11-22 01:53:12,499 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-22 01:53:12,528 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:53:12,536 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;@58c2d9cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:53:12,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-11-22 01:53:12,544 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-22 01:53:12,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:53:12,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:12,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:53:12,550 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:12,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:12,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1194406416, now seen corresponding path program 1 times [2022-11-22 01:53:12,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:12,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241657468] [2022-11-22 01:53:12,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:12,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:13,697 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-22 01:53:13,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:13,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241657468] [2022-11-22 01:53:13,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241657468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:13,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:13,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:53:13,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090651495] [2022-11-22 01:53:13,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:13,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:53:13,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:13,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:53:13,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:53:13,738 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 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-22 01:53:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:14,098 INFO L93 Difference]: Finished difference Result 1880 states and 4939 transitions. [2022-11-22 01:53:14,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:53:14,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-22 01:53:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:14,132 INFO L225 Difference]: With dead ends: 1880 [2022-11-22 01:53:14,132 INFO L226 Difference]: Without dead ends: 1880 [2022-11-22 01:53:14,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:53:14,136 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:14,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 16 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:53:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-11-22 01:53:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1880. [2022-11-22 01:53:14,317 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-22 01:53:14,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 4939 transitions. [2022-11-22 01:53:14,330 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 4939 transitions. Word has length 6 [2022-11-22 01:53:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:14,331 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 4939 transitions. [2022-11-22 01:53:14,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-22 01:53:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 4939 transitions. [2022-11-22 01:53:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 01:53:14,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:14,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:14,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:53:14,334 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:14,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:14,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1628445373, now seen corresponding path program 1 times [2022-11-22 01:53:14,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:14,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269202486] [2022-11-22 01:53:14,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:15,068 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-22 01:53:15,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:15,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269202486] [2022-11-22 01:53:15,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269202486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:15,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:15,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:53:15,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386690513] [2022-11-22 01:53:15,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:15,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:53:15,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:15,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:53:15,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:53:15,080 INFO L87 Difference]: Start difference. First operand 1880 states and 4939 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-22 01:53:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:15,452 INFO L93 Difference]: Finished difference Result 2033 states and 5332 transitions. [2022-11-22 01:53:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:53:15,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-22 01:53:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:15,465 INFO L225 Difference]: With dead ends: 2033 [2022-11-22 01:53:15,465 INFO L226 Difference]: Without dead ends: 2033 [2022-11-22 01:53:15,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:53:15,467 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 64 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:15,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 23 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:53:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2022-11-22 01:53:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 1982. [2022-11-22 01:53:15,528 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-22 01:53:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 5201 transitions. [2022-11-22 01:53:15,537 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 5201 transitions. Word has length 7 [2022-11-22 01:53:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:15,538 INFO L495 AbstractCegarLoop]: Abstraction has 1982 states and 5201 transitions. [2022-11-22 01:53:15,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-22 01:53:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 5201 transitions. [2022-11-22 01:53:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 01:53:15,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:15,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:15,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:53:15,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:15,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:15,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1628104063, now seen corresponding path program 2 times [2022-11-22 01:53:15,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:15,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773759664] [2022-11-22 01:53:15,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:15,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:53:16,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:16,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773759664] [2022-11-22 01:53:16,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773759664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:16,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:16,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:53:16,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836658441] [2022-11-22 01:53:16,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:16,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:53:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:16,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:53:16,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:53:16,552 INFO L87 Difference]: Start difference. First operand 1982 states and 5201 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-22 01:53:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:17,219 INFO L93 Difference]: Finished difference Result 2048 states and 5373 transitions. [2022-11-22 01:53:17,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:53:17,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-22 01:53:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:17,232 INFO L225 Difference]: With dead ends: 2048 [2022-11-22 01:53:17,232 INFO L226 Difference]: Without dead ends: 2048 [2022-11-22 01:53:17,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:53:17,234 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 62 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:17,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 23 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:53:17,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2022-11-22 01:53:17,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 1970. [2022-11-22 01:53:17,294 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-22 01:53:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 5173 transitions. [2022-11-22 01:53:17,303 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 5173 transitions. Word has length 7 [2022-11-22 01:53:17,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:17,303 INFO L495 AbstractCegarLoop]: Abstraction has 1970 states and 5173 transitions. [2022-11-22 01:53:17,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-22 01:53:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 5173 transitions. [2022-11-22 01:53:17,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:53:17,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:17,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:17,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:53:17,305 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:17,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1447328388, now seen corresponding path program 1 times [2022-11-22 01:53:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:17,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559585469] [2022-11-22 01:53:17,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:17,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:17,378 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-22 01:53:17,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:17,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559585469] [2022-11-22 01:53:17,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559585469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:17,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:17,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:53:17,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974378210] [2022-11-22 01:53:17,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:17,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:53:17,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:17,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:53:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:53:17,382 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-22 01:53:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:17,617 INFO L93 Difference]: Finished difference Result 3434 states and 9083 transitions. [2022-11-22 01:53:17,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:53:17,618 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-22 01:53:17,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:17,640 INFO L225 Difference]: With dead ends: 3434 [2022-11-22 01:53:17,641 INFO L226 Difference]: Without dead ends: 3434 [2022-11-22 01:53:17,641 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-22 01:53:17,642 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 63 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-22 01:53:17,643 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-22 01:53:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2022-11-22 01:53:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3114. [2022-11-22 01:53:17,750 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-22 01:53:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 8583 transitions. [2022-11-22 01:53:17,764 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 8583 transitions. Word has length 8 [2022-11-22 01:53:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:17,765 INFO L495 AbstractCegarLoop]: Abstraction has 3114 states and 8583 transitions. [2022-11-22 01:53:17,765 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-22 01:53:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 8583 transitions. [2022-11-22 01:53:17,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:53:17,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:17,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:17,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:53:17,767 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:17,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:17,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1246543810, now seen corresponding path program 1 times [2022-11-22 01:53:17,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:17,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832859804] [2022-11-22 01:53:17,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:17,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:18,154 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-22 01:53:18,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:18,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832859804] [2022-11-22 01:53:18,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832859804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:18,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:18,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:53:18,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515009843] [2022-11-22 01:53:18,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:18,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:53:18,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:18,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:53:18,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:53:18,157 INFO L87 Difference]: Start difference. First operand 3114 states and 8583 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-22 01:53:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:18,372 INFO L93 Difference]: Finished difference Result 3111 states and 8576 transitions. [2022-11-22 01:53:18,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:53:18,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-22 01:53:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:18,391 INFO L225 Difference]: With dead ends: 3111 [2022-11-22 01:53:18,391 INFO L226 Difference]: Without dead ends: 3111 [2022-11-22 01:53:18,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:53:18,394 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:18,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 16 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:53:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2022-11-22 01:53:18,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 3111. [2022-11-22 01:53:18,504 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-22 01:53:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 8576 transitions. [2022-11-22 01:53:18,519 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 8576 transitions. Word has length 9 [2022-11-22 01:53:18,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:18,520 INFO L495 AbstractCegarLoop]: Abstraction has 3111 states and 8576 transitions. [2022-11-22 01:53:18,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-22 01:53:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 8576 transitions. [2022-11-22 01:53:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:53:18,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:18,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:18,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:53:18,527 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:18,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:18,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1913752458, now seen corresponding path program 1 times [2022-11-22 01:53:18,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:18,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971008719] [2022-11-22 01:53:18,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:18,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:18,589 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-22 01:53:18,589 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:18,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971008719] [2022-11-22 01:53:18,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971008719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:18,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:18,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:53:18,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000079990] [2022-11-22 01:53:18,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:18,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:53:18,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:53:18,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:53:18,592 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-22 01:53:18,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:18,765 INFO L93 Difference]: Finished difference Result 2873 states and 7689 transitions. [2022-11-22 01:53:18,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:53:18,766 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-22 01:53:18,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:18,793 INFO L225 Difference]: With dead ends: 2873 [2022-11-22 01:53:18,793 INFO L226 Difference]: Without dead ends: 2865 [2022-11-22 01:53:18,794 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-22 01:53:18,796 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 50 mSDsluCounter, 5 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-22 01:53:18,796 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-22 01:53:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2022-11-22 01:53:18,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2705. [2022-11-22 01:53:18,881 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-22 01:53:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 7441 transitions. [2022-11-22 01:53:18,894 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 7441 transitions. Word has length 9 [2022-11-22 01:53:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:18,894 INFO L495 AbstractCegarLoop]: Abstraction has 2705 states and 7441 transitions. [2022-11-22 01:53:18,895 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-22 01:53:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 7441 transitions. [2022-11-22 01:53:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:53:18,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:18,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:18,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:53:18,898 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:18,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1364534229, now seen corresponding path program 1 times [2022-11-22 01:53:18,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:18,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732307402] [2022-11-22 01:53:18,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:18,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:19,340 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-22 01:53:19,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:19,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732307402] [2022-11-22 01:53:19,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732307402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:19,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:19,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:53:19,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119264675] [2022-11-22 01:53:19,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:19,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:53:19,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:19,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:53:19,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:53:19,342 INFO L87 Difference]: Start difference. First operand 2705 states and 7441 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-22 01:53:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:19,592 INFO L93 Difference]: Finished difference Result 2855 states and 7813 transitions. [2022-11-22 01:53:19,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:53:19,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-22 01:53:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:19,609 INFO L225 Difference]: With dead ends: 2855 [2022-11-22 01:53:19,609 INFO L226 Difference]: Without dead ends: 2855 [2022-11-22 01:53:19,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:53:19,610 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 55 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:19,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 18 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:53:19,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2022-11-22 01:53:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2830. [2022-11-22 01:53:19,720 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-22 01:53:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 7751 transitions. [2022-11-22 01:53:19,733 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 7751 transitions. Word has length 10 [2022-11-22 01:53:19,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:19,734 INFO L495 AbstractCegarLoop]: Abstraction has 2830 states and 7751 transitions. [2022-11-22 01:53:19,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-22 01:53:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 7751 transitions. [2022-11-22 01:53:19,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:53:19,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:19,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:19,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:53:19,736 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:19,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:19,736 INFO L85 PathProgramCache]: Analyzing trace with hash 213497389, now seen corresponding path program 2 times [2022-11-22 01:53:19,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:19,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039809131] [2022-11-22 01:53:19,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:19,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:20,418 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-22 01:53:20,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:20,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039809131] [2022-11-22 01:53:20,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039809131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:20,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:20,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:53:20,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113015068] [2022-11-22 01:53:20,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:20,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:53:20,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:20,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:53:20,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:53:20,420 INFO L87 Difference]: Start difference. First operand 2830 states and 7751 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-22 01:53:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:20,925 INFO L93 Difference]: Finished difference Result 2759 states and 7542 transitions. [2022-11-22 01:53:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:53:20,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-22 01:53:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:20,937 INFO L225 Difference]: With dead ends: 2759 [2022-11-22 01:53:20,937 INFO L226 Difference]: Without dead ends: 2759 [2022-11-22 01:53:20,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:53:20,940 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 45 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:20,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 23 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:53:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2022-11-22 01:53:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2634. [2022-11-22 01:53:21,058 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-22 01:53:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 7232 transitions. [2022-11-22 01:53:21,069 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 7232 transitions. Word has length 10 [2022-11-22 01:53:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:21,070 INFO L495 AbstractCegarLoop]: Abstraction has 2634 states and 7232 transitions. [2022-11-22 01:53:21,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-22 01:53:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 7232 transitions. [2022-11-22 01:53:21,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:53:21,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:21,072 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:21,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:53:21,072 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:21,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:21,073 INFO L85 PathProgramCache]: Analyzing trace with hash 189436958, now seen corresponding path program 1 times [2022-11-22 01:53:21,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:21,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065279169] [2022-11-22 01:53:21,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:21,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:21,117 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-22 01:53:21,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:21,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065279169] [2022-11-22 01:53:21,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065279169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:21,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:21,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:53:21,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557559161] [2022-11-22 01:53:21,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:21,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:53:21,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:21,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:53:21,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:53:21,120 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-22 01:53:21,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:21,292 INFO L93 Difference]: Finished difference Result 2562 states and 7001 transitions. [2022-11-22 01:53:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:53:21,293 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-22 01:53:21,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:21,303 INFO L225 Difference]: With dead ends: 2562 [2022-11-22 01:53:21,303 INFO L226 Difference]: Without dead ends: 2562 [2022-11-22 01:53:21,304 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-22 01:53:21,305 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 58 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:21,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 14 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:53:21,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2022-11-22 01:53:21,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2562. [2022-11-22 01:53:21,404 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-22 01:53:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 7001 transitions. [2022-11-22 01:53:21,416 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 7001 transitions. Word has length 11 [2022-11-22 01:53:21,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:21,416 INFO L495 AbstractCegarLoop]: Abstraction has 2562 states and 7001 transitions. [2022-11-22 01:53:21,416 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-22 01:53:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 7001 transitions. [2022-11-22 01:53:21,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:53:21,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:21,417 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:21,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:53:21,418 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:21,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:21,419 INFO L85 PathProgramCache]: Analyzing trace with hash 189437093, now seen corresponding path program 1 times [2022-11-22 01:53:21,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:21,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211754280] [2022-11-22 01:53:21,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:21,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:21,460 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-22 01:53:21,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:21,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211754280] [2022-11-22 01:53:21,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211754280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:21,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:21,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:53:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823442308] [2022-11-22 01:53:21,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:21,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:53:21,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:21,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:53:21,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:53:21,463 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-22 01:53:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:21,620 INFO L93 Difference]: Finished difference Result 2490 states and 6770 transitions. [2022-11-22 01:53:21,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:53:21,620 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-22 01:53:21,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:21,629 INFO L225 Difference]: With dead ends: 2490 [2022-11-22 01:53:21,630 INFO L226 Difference]: Without dead ends: 2420 [2022-11-22 01:53:21,630 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-22 01:53:21,631 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 58 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:21,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 14 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:53:21,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2022-11-22 01:53:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1576. [2022-11-22 01:53:21,678 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-22 01:53:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 4231 transitions. [2022-11-22 01:53:21,684 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 4231 transitions. Word has length 11 [2022-11-22 01:53:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:21,685 INFO L495 AbstractCegarLoop]: Abstraction has 1576 states and 4231 transitions. [2022-11-22 01:53:21,685 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-22 01:53:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 4231 transitions. [2022-11-22 01:53:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:53:21,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:21,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:21,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 01:53:21,687 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:21,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:21,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1725015290, now seen corresponding path program 1 times [2022-11-22 01:53:21,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:21,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541123385] [2022-11-22 01:53:21,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:21,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:21,740 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-22 01:53:21,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:21,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541123385] [2022-11-22 01:53:21,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541123385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:21,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:21,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:53:21,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632709314] [2022-11-22 01:53:21,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:21,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:53:21,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:21,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:53:21,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:53:21,743 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-22 01:53:21,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:21,900 INFO L93 Difference]: Finished difference Result 1948 states and 5225 transitions. [2022-11-22 01:53:21,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:53:21,900 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-22 01:53:21,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:21,908 INFO L225 Difference]: With dead ends: 1948 [2022-11-22 01:53:21,908 INFO L226 Difference]: Without dead ends: 1948 [2022-11-22 01:53:21,908 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-22 01:53:21,909 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 6 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-22 01:53:21,910 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-22 01:53:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2022-11-22 01:53:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1884. [2022-11-22 01:53:21,953 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-22 01:53:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 5125 transitions. [2022-11-22 01:53:21,960 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 5125 transitions. Word has length 17 [2022-11-22 01:53:21,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:21,960 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 5125 transitions. [2022-11-22 01:53:21,960 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-22 01:53:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 5125 transitions. [2022-11-22 01:53:21,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:53:21,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:21,962 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-22 01:53:21,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 01:53:21,962 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:21,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1938930471, now seen corresponding path program 1 times [2022-11-22 01:53:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:21,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307869629] [2022-11-22 01:53:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:21,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:23,156 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-22 01:53:23,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:23,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307869629] [2022-11-22 01:53:23,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307869629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:23,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:23,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-22 01:53:23,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819659697] [2022-11-22 01:53:23,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:23,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 01:53:23,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:23,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 01:53:23,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-22 01:53:23,158 INFO L87 Difference]: Start difference. First operand 1884 states and 5125 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 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-22 01:53:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:24,010 INFO L93 Difference]: Finished difference Result 1939 states and 5215 transitions. [2022-11-22 01:53:24,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 01:53:24,011 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 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-22 01:53:24,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:24,018 INFO L225 Difference]: With dead ends: 1939 [2022-11-22 01:53:24,018 INFO L226 Difference]: Without dead ends: 1939 [2022-11-22 01:53:24,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-11-22 01:53:24,019 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:24,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 68 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:53:24,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2022-11-22 01:53:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1883. [2022-11-22 01:53:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1831 states have (on average 2.797378481703987) internal successors, (5122), 1882 states have internal predecessors, (5122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 5122 transitions. [2022-11-22 01:53:24,072 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 5122 transitions. Word has length 18 [2022-11-22 01:53:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:24,072 INFO L495 AbstractCegarLoop]: Abstraction has 1883 states and 5122 transitions. [2022-11-22 01:53:24,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 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-22 01:53:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 5122 transitions. [2022-11-22 01:53:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:53:24,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:24,074 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-22 01:53:24,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 01:53:24,074 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:24,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:24,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1938930435, now seen corresponding path program 1 times [2022-11-22 01:53:24,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:24,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397760187] [2022-11-22 01:53:24,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:24,778 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-22 01:53:24,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:24,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397760187] [2022-11-22 01:53:24,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397760187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:24,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:24,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 01:53:24,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324944099] [2022-11-22 01:53:24,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:24,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 01:53:24,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:24,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 01:53:24,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:53:24,781 INFO L87 Difference]: Start difference. First operand 1883 states and 5122 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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-22 01:53:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:25,347 INFO L93 Difference]: Finished difference Result 2293 states and 6184 transitions. [2022-11-22 01:53:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:53:25,348 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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-22 01:53:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:25,356 INFO L225 Difference]: With dead ends: 2293 [2022-11-22 01:53:25,356 INFO L226 Difference]: Without dead ends: 2293 [2022-11-22 01:53:25,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:53:25,357 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 221 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:25,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 46 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:53:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2022-11-22 01:53:25,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2167. [2022-11-22 01:53:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2115 states have (on average 2.813238770685579) internal successors, (5950), 2166 states have internal predecessors, (5950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 5950 transitions. [2022-11-22 01:53:25,464 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 5950 transitions. Word has length 18 [2022-11-22 01:53:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:25,464 INFO L495 AbstractCegarLoop]: Abstraction has 2167 states and 5950 transitions. [2022-11-22 01:53:25,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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-22 01:53:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 5950 transitions. [2022-11-22 01:53:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:53:25,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:25,466 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-22 01:53:25,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 01:53:25,466 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1490207628, now seen corresponding path program 1 times [2022-11-22 01:53:25,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:25,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886498732] [2022-11-22 01:53:25,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:25,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:26,588 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-22 01:53:26,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:26,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886498732] [2022-11-22 01:53:26,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886498732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:26,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:26,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-22 01:53:26,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876547289] [2022-11-22 01:53:26,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:26,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 01:53:26,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:26,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 01:53:26,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:53:26,590 INFO L87 Difference]: Start difference. First operand 2167 states and 5950 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-22 01:53:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:27,604 INFO L93 Difference]: Finished difference Result 2227 states and 6046 transitions. [2022-11-22 01:53:27,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 01:53:27,605 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-22 01:53:27,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:27,612 INFO L225 Difference]: With dead ends: 2227 [2022-11-22 01:53:27,613 INFO L226 Difference]: Without dead ends: 2227 [2022-11-22 01:53:27,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-11-22 01:53:27,627 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 200 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:27,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 79 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:53:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2022-11-22 01:53:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2167. [2022-11-22 01:53:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2115 states have (on average 2.7990543735224587) internal successors, (5920), 2166 states have internal predecessors, (5920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:27,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 5920 transitions. [2022-11-22 01:53:27,683 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 5920 transitions. Word has length 19 [2022-11-22 01:53:27,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:27,683 INFO L495 AbstractCegarLoop]: Abstraction has 2167 states and 5920 transitions. [2022-11-22 01:53:27,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-22 01:53:27,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 5920 transitions. [2022-11-22 01:53:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:53:27,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:27,685 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-22 01:53:27,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 01:53:27,685 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:27,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:27,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1072544264, now seen corresponding path program 2 times [2022-11-22 01:53:27,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:27,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791742360] [2022-11-22 01:53:27,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:27,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:28,994 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-22 01:53:28,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:28,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791742360] [2022-11-22 01:53:28,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791742360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:28,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:28,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-22 01:53:28,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015226830] [2022-11-22 01:53:28,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:28,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 01:53:28,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:28,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 01:53:28,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:53:28,996 INFO L87 Difference]: Start difference. First operand 2167 states and 5920 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-22 01:53:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:29,829 INFO L93 Difference]: Finished difference Result 2482 states and 6784 transitions. [2022-11-22 01:53:29,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 01:53:29,830 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-22 01:53:29,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:29,838 INFO L225 Difference]: With dead ends: 2482 [2022-11-22 01:53:29,839 INFO L226 Difference]: Without dead ends: 2482 [2022-11-22 01:53:29,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2022-11-22 01:53:29,843 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 212 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:29,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 69 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:53:29,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2022-11-22 01:53:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2407. [2022-11-22 01:53:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2407 states, 2355 states have (on average 2.816985138004246) internal successors, (6634), 2406 states have internal predecessors, (6634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 6634 transitions. [2022-11-22 01:53:29,930 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 6634 transitions. Word has length 19 [2022-11-22 01:53:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:29,931 INFO L495 AbstractCegarLoop]: Abstraction has 2407 states and 6634 transitions. [2022-11-22 01:53:29,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-22 01:53:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 6634 transitions. [2022-11-22 01:53:29,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:53:29,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:29,933 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-22 01:53:29,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 01:53:29,933 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:29,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:29,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1072544300, now seen corresponding path program 1 times [2022-11-22 01:53:29,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:29,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631672904] [2022-11-22 01:53:29,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:29,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:31,375 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-22 01:53:31,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:31,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631672904] [2022-11-22 01:53:31,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631672904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:31,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:31,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-22 01:53:31,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628792570] [2022-11-22 01:53:31,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:31,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 01:53:31,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:31,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 01:53:31,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:53:31,377 INFO L87 Difference]: Start difference. First operand 2407 states and 6634 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-22 01:53:32,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:32,304 INFO L93 Difference]: Finished difference Result 2467 states and 6730 transitions. [2022-11-22 01:53:32,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 01:53:32,304 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-22 01:53:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:32,311 INFO L225 Difference]: With dead ends: 2467 [2022-11-22 01:53:32,311 INFO L226 Difference]: Without dead ends: 2467 [2022-11-22 01:53:32,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-11-22 01:53:32,312 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 188 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:32,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 89 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:53:32,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2022-11-22 01:53:32,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2122. [2022-11-22 01:53:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 2070 states have (on average 2.803381642512077) internal successors, (5803), 2121 states have internal predecessors, (5803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 5803 transitions. [2022-11-22 01:53:32,364 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 5803 transitions. Word has length 19 [2022-11-22 01:53:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:32,364 INFO L495 AbstractCegarLoop]: Abstraction has 2122 states and 5803 transitions. [2022-11-22 01:53:32,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-22 01:53:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 5803 transitions. [2022-11-22 01:53:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:53:32,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:32,366 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-22 01:53:32,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 01:53:32,367 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:32,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:32,367 INFO L85 PathProgramCache]: Analyzing trace with hash 119622088, now seen corresponding path program 3 times [2022-11-22 01:53:32,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:32,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435560455] [2022-11-22 01:53:32,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:32,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:33,700 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-22 01:53:33,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:33,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435560455] [2022-11-22 01:53:33,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435560455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:33,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:33,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-22 01:53:33,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066094144] [2022-11-22 01:53:33,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:33,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-22 01:53:33,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:33,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-22 01:53:33,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:53:33,703 INFO L87 Difference]: Start difference. First operand 2122 states and 5803 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-22 01:53:34,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:34,427 INFO L93 Difference]: Finished difference Result 2317 states and 6326 transitions. [2022-11-22 01:53:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 01:53:34,428 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-22 01:53:34,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:34,434 INFO L225 Difference]: With dead ends: 2317 [2022-11-22 01:53:34,435 INFO L226 Difference]: Without dead ends: 2317 [2022-11-22 01:53:34,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2022-11-22 01:53:34,435 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 233 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:34,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 59 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:53:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2022-11-22 01:53:34,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2242. [2022-11-22 01:53:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2190 states have (on average 2.8168949771689498) internal successors, (6169), 2241 states have internal predecessors, (6169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 6169 transitions. [2022-11-22 01:53:34,490 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 6169 transitions. Word has length 19 [2022-11-22 01:53:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:34,490 INFO L495 AbstractCegarLoop]: Abstraction has 2242 states and 6169 transitions. [2022-11-22 01:53:34,491 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-22 01:53:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 6169 transitions. [2022-11-22 01:53:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:53:34,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:34,492 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-22 01:53:34,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-22 01:53:34,493 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:34,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:34,493 INFO L85 PathProgramCache]: Analyzing trace with hash 119622124, now seen corresponding path program 2 times [2022-11-22 01:53:34,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:34,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406545718] [2022-11-22 01:53:34,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:34,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:35,766 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-22 01:53:35,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:35,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406545718] [2022-11-22 01:53:35,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406545718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:35,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:35,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-22 01:53:35,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136153233] [2022-11-22 01:53:35,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:35,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 01:53:35,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:35,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 01:53:35,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:53:35,768 INFO L87 Difference]: Start difference. First operand 2242 states and 6169 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-22 01:53:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:36,708 INFO L93 Difference]: Finished difference Result 2383 states and 6464 transitions. [2022-11-22 01:53:36,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 01:53:36,709 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-22 01:53:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:36,721 INFO L225 Difference]: With dead ends: 2383 [2022-11-22 01:53:36,722 INFO L226 Difference]: Without dead ends: 2383 [2022-11-22 01:53:36,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-11-22 01:53:36,723 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 174 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:36,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 72 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:53:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2022-11-22 01:53:36,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2042. [2022-11-22 01:53:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1990 states have (on average 2.808040201005025) internal successors, (5588), 2041 states have internal predecessors, (5588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 5588 transitions. [2022-11-22 01:53:36,772 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 5588 transitions. Word has length 19 [2022-11-22 01:53:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:36,773 INFO L495 AbstractCegarLoop]: Abstraction has 2042 states and 5588 transitions. [2022-11-22 01:53:36,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-22 01:53:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 5588 transitions. [2022-11-22 01:53:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:53:36,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:36,776 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-22 01:53:36,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-22 01:53:36,776 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:36,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:36,777 INFO L85 PathProgramCache]: Analyzing trace with hash 23041588, now seen corresponding path program 4 times [2022-11-22 01:53:36,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:36,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936949935] [2022-11-22 01:53:36,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:36,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:38,034 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-22 01:53:38,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:38,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936949935] [2022-11-22 01:53:38,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936949935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:38,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:38,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-22 01:53:38,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856588441] [2022-11-22 01:53:38,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:38,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-22 01:53:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:38,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-22 01:53:38,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:53:38,036 INFO L87 Difference]: Start difference. First operand 2042 states and 5588 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-22 01:53:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:38,983 INFO L93 Difference]: Finished difference Result 2122 states and 5726 transitions. [2022-11-22 01:53:38,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 01:53:38,984 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-22 01:53:38,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:38,991 INFO L225 Difference]: With dead ends: 2122 [2022-11-22 01:53:38,991 INFO L226 Difference]: Without dead ends: 2122 [2022-11-22 01:53:38,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-11-22 01:53:38,992 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 197 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:38,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 79 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:53:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2022-11-22 01:53:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1987. [2022-11-22 01:53:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1987 states, 1935 states have (on average 2.7948320413436694) internal successors, (5408), 1986 states have internal predecessors, (5408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 5408 transitions. [2022-11-22 01:53:39,038 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 5408 transitions. Word has length 19 [2022-11-22 01:53:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:39,038 INFO L495 AbstractCegarLoop]: Abstraction has 1987 states and 5408 transitions. [2022-11-22 01:53:39,038 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-22 01:53:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 5408 transitions. [2022-11-22 01:53:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:53:39,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:39,042 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-22 01:53:39,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-22 01:53:39,042 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:39,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash 22700314, now seen corresponding path program 3 times [2022-11-22 01:53:39,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:39,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788843076] [2022-11-22 01:53:39,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:39,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:40,225 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-22 01:53:40,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:40,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788843076] [2022-11-22 01:53:40,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788843076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:40,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:40,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-22 01:53:40,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045270502] [2022-11-22 01:53:40,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:40,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 01:53:40,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:40,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 01:53:40,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:53:40,228 INFO L87 Difference]: Start difference. First operand 1987 states and 5408 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-22 01:53:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:41,152 INFO L93 Difference]: Finished difference Result 2012 states and 5424 transitions. [2022-11-22 01:53:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 01:53:41,153 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-22 01:53:41,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:41,159 INFO L225 Difference]: With dead ends: 2012 [2022-11-22 01:53:41,159 INFO L226 Difference]: Without dead ends: 2012 [2022-11-22 01:53:41,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-11-22 01:53:41,160 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 228 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:41,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 81 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:53:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2022-11-22 01:53:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1952. [2022-11-22 01:53:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1900 states have (on average 2.784736842105263) internal successors, (5291), 1951 states have internal predecessors, (5291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:41,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 5291 transitions. [2022-11-22 01:53:41,205 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 5291 transitions. Word has length 19 [2022-11-22 01:53:41,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:41,206 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 5291 transitions. [2022-11-22 01:53:41,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-22 01:53:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 5291 transitions. [2022-11-22 01:53:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:53:41,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:41,207 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-22 01:53:41,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-22 01:53:41,208 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:41,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:41,208 INFO L85 PathProgramCache]: Analyzing trace with hash -641594740, now seen corresponding path program 1 times [2022-11-22 01:53:41,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:41,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983160115] [2022-11-22 01:53:41,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:41,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:41,255 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-22 01:53:41,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:41,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983160115] [2022-11-22 01:53:41,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983160115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:41,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:41,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:53:41,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294344261] [2022-11-22 01:53:41,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:41,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:53:41,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:41,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:53:41,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:53:41,261 INFO L87 Difference]: Start difference. First operand 1952 states and 5291 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-22 01:53:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:41,390 INFO L93 Difference]: Finished difference Result 1832 states and 4965 transitions. [2022-11-22 01:53:41,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:53:41,391 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-22 01:53:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:41,396 INFO L225 Difference]: With dead ends: 1832 [2022-11-22 01:53:41,396 INFO L226 Difference]: Without dead ends: 1832 [2022-11-22 01:53:41,396 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-22 01:53:41,397 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:41,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 9 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:53:41,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2022-11-22 01:53:41,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1832. [2022-11-22 01:53:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1792 states have (on average 2.7706473214285716) internal successors, (4965), 1831 states have internal predecessors, (4965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 4965 transitions. [2022-11-22 01:53:41,440 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 4965 transitions. Word has length 20 [2022-11-22 01:53:41,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:41,441 INFO L495 AbstractCegarLoop]: Abstraction has 1832 states and 4965 transitions. [2022-11-22 01:53:41,442 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-22 01:53:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 4965 transitions. [2022-11-22 01:53:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:53:41,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:41,443 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-22 01:53:41,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-22 01:53:41,444 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:41,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:41,444 INFO L85 PathProgramCache]: Analyzing trace with hash -641594639, now seen corresponding path program 1 times [2022-11-22 01:53:41,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:41,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890690069] [2022-11-22 01:53:41,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:41,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:41,487 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-22 01:53:41,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:41,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890690069] [2022-11-22 01:53:41,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890690069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:41,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:41,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:53:41,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630023583] [2022-11-22 01:53:41,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:41,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:53:41,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:41,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:53:41,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:53:41,490 INFO L87 Difference]: Start difference. First operand 1832 states and 4965 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-22 01:53:41,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:41,599 INFO L93 Difference]: Finished difference Result 1712 states and 4639 transitions. [2022-11-22 01:53:41,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:53:41,600 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-22 01:53:41,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:41,604 INFO L225 Difference]: With dead ends: 1712 [2022-11-22 01:53:41,605 INFO L226 Difference]: Without dead ends: 1712 [2022-11-22 01:53:41,606 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-22 01:53:41,607 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 45 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:41,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:53:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-11-22 01:53:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1384. [2022-11-22 01:53:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1356 states have (on average 2.7485250737463125) internal successors, (3727), 1383 states have internal predecessors, (3727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3727 transitions. [2022-11-22 01:53:41,639 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 3727 transitions. Word has length 20 [2022-11-22 01:53:41,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:41,639 INFO L495 AbstractCegarLoop]: Abstraction has 1384 states and 3727 transitions. [2022-11-22 01:53:41,639 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-22 01:53:41,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 3727 transitions. [2022-11-22 01:53:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 01:53:41,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:41,641 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-22 01:53:41,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-22 01:53:41,641 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:41,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:41,642 INFO L85 PathProgramCache]: Analyzing trace with hash 339597808, now seen corresponding path program 1 times [2022-11-22 01:53:41,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:41,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688947836] [2022-11-22 01:53:41,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:41,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:42,492 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-22 01:53:42,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:42,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688947836] [2022-11-22 01:53:42,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688947836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:42,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:42,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 01:53:42,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843952090] [2022-11-22 01:53:42,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:42,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 01:53:42,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:42,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 01:53:42,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:53:42,494 INFO L87 Difference]: Start difference. First operand 1384 states and 3727 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-22 01:53:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:43,006 INFO L93 Difference]: Finished difference Result 1622 states and 4361 transitions. [2022-11-22 01:53:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 01:53:43,007 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-22 01:53:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:43,010 INFO L225 Difference]: With dead ends: 1622 [2022-11-22 01:53:43,011 INFO L226 Difference]: Without dead ends: 1622 [2022-11-22 01:53:43,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-22 01:53:43,012 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 111 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:43,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 40 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:53:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2022-11-22 01:53:43,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1592. [2022-11-22 01:53:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1564 states have (on average 2.7480818414322252) internal successors, (4298), 1591 states have internal predecessors, (4298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 4298 transitions. [2022-11-22 01:53:43,045 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 4298 transitions. Word has length 21 [2022-11-22 01:53:43,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:43,045 INFO L495 AbstractCegarLoop]: Abstraction has 1592 states and 4298 transitions. [2022-11-22 01:53:43,046 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-22 01:53:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 4298 transitions. [2022-11-22 01:53:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 01:53:43,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:43,047 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-22 01:53:43,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-22 01:53:43,048 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:43,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:43,048 INFO L85 PathProgramCache]: Analyzing trace with hash 339597809, now seen corresponding path program 1 times [2022-11-22 01:53:43,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:43,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389052154] [2022-11-22 01:53:43,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:43,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:43,748 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-22 01:53:43,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:43,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389052154] [2022-11-22 01:53:43,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389052154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:43,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:43,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 01:53:43,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637326619] [2022-11-22 01:53:43,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:43,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 01:53:43,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:43,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 01:53:43,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:53:43,750 INFO L87 Difference]: Start difference. First operand 1592 states and 4298 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-22 01:53:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:44,467 INFO L93 Difference]: Finished difference Result 3849 states and 10536 transitions. [2022-11-22 01:53:44,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:53:44,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-22 01:53:44,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:44,475 INFO L225 Difference]: With dead ends: 3849 [2022-11-22 01:53:44,475 INFO L226 Difference]: Without dead ends: 3849 [2022-11-22 01:53:44,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-11-22 01:53:44,476 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 552 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:44,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 38 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:53:44,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2022-11-22 01:53:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 2419. [2022-11-22 01:53:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 2391 states have (on average 2.838979506482643) internal successors, (6788), 2418 states have internal predecessors, (6788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 6788 transitions. [2022-11-22 01:53:44,542 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 6788 transitions. Word has length 21 [2022-11-22 01:53:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:44,543 INFO L495 AbstractCegarLoop]: Abstraction has 2419 states and 6788 transitions. [2022-11-22 01:53:44,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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-22 01:53:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 6788 transitions. [2022-11-22 01:53:44,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 01:53:44,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:44,545 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-22 01:53:44,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-22 01:53:44,545 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:44,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:44,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1995569757, now seen corresponding path program 1 times [2022-11-22 01:53:44,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:44,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068634782] [2022-11-22 01:53:44,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:44,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:45,532 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-22 01:53:45,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:45,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068634782] [2022-11-22 01:53:45,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068634782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:45,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:45,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-22 01:53:45,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292546554] [2022-11-22 01:53:45,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:45,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 01:53:45,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:45,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 01:53:45,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:53:45,534 INFO L87 Difference]: Start difference. First operand 2419 states and 6788 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-22 01:53:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:46,192 INFO L93 Difference]: Finished difference Result 2464 states and 6892 transitions. [2022-11-22 01:53:46,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 01:53:46,192 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-22 01:53:46,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:46,198 INFO L225 Difference]: With dead ends: 2464 [2022-11-22 01:53:46,198 INFO L226 Difference]: Without dead ends: 2464 [2022-11-22 01:53:46,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-11-22 01:53:46,203 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 156 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:46,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 55 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:53:46,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2022-11-22 01:53:46,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2239. [2022-11-22 01:53:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2239 states, 2211 states have (on average 2.845771144278607) internal successors, (6292), 2238 states have internal predecessors, (6292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 2239 states and 6292 transitions. [2022-11-22 01:53:46,252 INFO L78 Accepts]: Start accepts. Automaton has 2239 states and 6292 transitions. Word has length 22 [2022-11-22 01:53:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:46,253 INFO L495 AbstractCegarLoop]: Abstraction has 2239 states and 6292 transitions. [2022-11-22 01:53:46,253 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-22 01:53:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 6292 transitions. [2022-11-22 01:53:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 01:53:46,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:46,255 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-22 01:53:46,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-22 01:53:46,256 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:46,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:46,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1159136607, now seen corresponding path program 2 times [2022-11-22 01:53:46,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:46,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130640886] [2022-11-22 01:53:46,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:46,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:47,337 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-22 01:53:47,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:47,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130640886] [2022-11-22 01:53:47,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130640886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:47,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:47,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-22 01:53:47,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692244736] [2022-11-22 01:53:47,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:47,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 01:53:47,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:47,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 01:53:47,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-22 01:53:47,339 INFO L87 Difference]: Start difference. First operand 2239 states and 6292 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-22 01:53:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:47,977 INFO L93 Difference]: Finished difference Result 2264 states and 6342 transitions. [2022-11-22 01:53:47,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 01:53:47,978 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-22 01:53:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:47,983 INFO L225 Difference]: With dead ends: 2264 [2022-11-22 01:53:47,983 INFO L226 Difference]: Without dead ends: 2264 [2022-11-22 01:53:47,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2022-11-22 01:53:47,984 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 177 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:47,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 47 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:53:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2022-11-22 01:53:48,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2244. [2022-11-22 01:53:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2244 states, 2216 states have (on average 2.8438628158844765) internal successors, (6302), 2243 states have internal predecessors, (6302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 6302 transitions. [2022-11-22 01:53:48,035 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 6302 transitions. Word has length 22 [2022-11-22 01:53:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:48,035 INFO L495 AbstractCegarLoop]: Abstraction has 2244 states and 6302 transitions. [2022-11-22 01:53:48,036 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-22 01:53:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 6302 transitions. [2022-11-22 01:53:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 01:53:48,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:48,037 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-22 01:53:48,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-22 01:53:48,038 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:48,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1159136606, now seen corresponding path program 1 times [2022-11-22 01:53:48,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:48,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236700829] [2022-11-22 01:53:48,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:48,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:48,753 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-22 01:53:48,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:48,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236700829] [2022-11-22 01:53:48,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236700829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:48,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:48,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 01:53:48,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309732317] [2022-11-22 01:53:48,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:48,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 01:53:48,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:48,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 01:53:48,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:53:48,756 INFO L87 Difference]: Start difference. First operand 2244 states and 6302 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 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-22 01:53:49,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:49,503 INFO L93 Difference]: Finished difference Result 3219 states and 9083 transitions. [2022-11-22 01:53:49,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:53:49,504 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 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-22 01:53:49,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:49,510 INFO L225 Difference]: With dead ends: 3219 [2022-11-22 01:53:49,510 INFO L226 Difference]: Without dead ends: 3219 [2022-11-22 01:53:49,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:53:49,511 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 399 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:49,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 47 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:53:49,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3219 states. [2022-11-22 01:53:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3219 to 2044. [2022-11-22 01:53:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 2016 states have (on average 2.8551587301587302) internal successors, (5756), 2043 states have internal predecessors, (5756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 5756 transitions. [2022-11-22 01:53:49,562 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 5756 transitions. Word has length 22 [2022-11-22 01:53:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:49,563 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 5756 transitions. [2022-11-22 01:53:49,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 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-22 01:53:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 5756 transitions. [2022-11-22 01:53:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-22 01:53:49,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:49,564 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-22 01:53:49,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-22 01:53:49,565 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:49,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash 373817956, now seen corresponding path program 1 times [2022-11-22 01:53:49,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:49,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149623775] [2022-11-22 01:53:49,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:49,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:49,636 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-22 01:53:49,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:49,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149623775] [2022-11-22 01:53:49,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149623775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:49,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:49,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:53:49,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981897479] [2022-11-22 01:53:49,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:49,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:53:49,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:49,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:53:49,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:53:49,639 INFO L87 Difference]: Start difference. First operand 2044 states and 5756 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-22 01:53:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:49,742 INFO L93 Difference]: Finished difference Result 1048 states and 2777 transitions. [2022-11-22 01:53:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:53:49,743 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-22 01:53:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:49,745 INFO L225 Difference]: With dead ends: 1048 [2022-11-22 01:53:49,745 INFO L226 Difference]: Without dead ends: 974 [2022-11-22 01:53:49,745 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-22 01:53:49,747 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 3 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-22 01:53:49,747 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-22 01:53:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2022-11-22 01:53:49,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 868. [2022-11-22 01:53:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 852 states have (on average 2.653755868544601) internal successors, (2261), 867 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 2261 transitions. [2022-11-22 01:53:49,766 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 2261 transitions. Word has length 31 [2022-11-22 01:53:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:49,766 INFO L495 AbstractCegarLoop]: Abstraction has 868 states and 2261 transitions. [2022-11-22 01:53:49,766 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-22 01:53:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 2261 transitions. [2022-11-22 01:53:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-22 01:53:49,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:49,768 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-22 01:53:49,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-22 01:53:49,768 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:49,769 INFO L85 PathProgramCache]: Analyzing trace with hash -163451913, now seen corresponding path program 1 times [2022-11-22 01:53:49,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:49,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643061294] [2022-11-22 01:53:49,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:49,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:49,849 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-22 01:53:49,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:49,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643061294] [2022-11-22 01:53:49,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643061294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:49,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:49,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:53:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700919588] [2022-11-22 01:53:49,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:49,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:53:49,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:49,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:53:49,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:53:49,852 INFO L87 Difference]: Start difference. First operand 868 states and 2261 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-22 01:53:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:49,951 INFO L93 Difference]: Finished difference Result 588 states and 1341 transitions. [2022-11-22 01:53:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:53:49,952 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-22 01:53:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:49,953 INFO L225 Difference]: With dead ends: 588 [2022-11-22 01:53:49,953 INFO L226 Difference]: Without dead ends: 562 [2022-11-22 01:53:49,953 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-22 01:53:49,954 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 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-22 01:53:49,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 4 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:53:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-22 01:53:49,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2022-11-22 01:53:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 554 states have (on average 2.3267148014440435) internal successors, (1289), 561 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1289 transitions. [2022-11-22 01:53:49,968 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1289 transitions. Word has length 32 [2022-11-22 01:53:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:49,969 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1289 transitions. [2022-11-22 01:53:49,969 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-22 01:53:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1289 transitions. [2022-11-22 01:53:49,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 01:53:49,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:49,970 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-22 01:53:49,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-22 01:53:49,971 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:49,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:49,971 INFO L85 PathProgramCache]: Analyzing trace with hash -960925176, now seen corresponding path program 1 times [2022-11-22 01:53:49,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:49,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58283845] [2022-11-22 01:53:49,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:49,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:50,471 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-22 01:53:50,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:50,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58283845] [2022-11-22 01:53:50,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58283845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:50,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:50,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 01:53:50,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599579780] [2022-11-22 01:53:50,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:50,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 01:53:50,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 01:53:50,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:53:50,474 INFO L87 Difference]: Start difference. First operand 562 states and 1289 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 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-22 01:53:50,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:50,755 INFO L93 Difference]: Finished difference Result 753 states and 1707 transitions. [2022-11-22 01:53:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:53:50,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 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-22 01:53:50,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:50,757 INFO L225 Difference]: With dead ends: 753 [2022-11-22 01:53:50,757 INFO L226 Difference]: Without dead ends: 753 [2022-11-22 01:53:50,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:53:50,758 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 184 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:50,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 24 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:53:50,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-11-22 01:53:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 658. [2022-11-22 01:53:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 650 states have (on average 2.3184615384615386) internal successors, (1507), 657 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1507 transitions. [2022-11-22 01:53:50,770 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1507 transitions. Word has length 33 [2022-11-22 01:53:50,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:50,771 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 1507 transitions. [2022-11-22 01:53:50,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 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-22 01:53:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1507 transitions. [2022-11-22 01:53:50,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 01:53:50,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:50,772 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-22 01:53:50,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-22 01:53:50,773 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:50,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:50,773 INFO L85 PathProgramCache]: Analyzing trace with hash -960925065, now seen corresponding path program 1 times [2022-11-22 01:53:50,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:50,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504208724] [2022-11-22 01:53:50,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:50,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:51,769 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-22 01:53:51,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:51,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504208724] [2022-11-22 01:53:51,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504208724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:51,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:51,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-22 01:53:51,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830120238] [2022-11-22 01:53:51,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:51,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 01:53:51,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:51,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 01:53:51,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-22 01:53:51,771 INFO L87 Difference]: Start difference. First operand 658 states and 1507 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 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-22 01:53:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:52,708 INFO L93 Difference]: Finished difference Result 1481 states and 3410 transitions. [2022-11-22 01:53:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 01:53:52,708 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 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-22 01:53:52,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:52,711 INFO L225 Difference]: With dead ends: 1481 [2022-11-22 01:53:52,711 INFO L226 Difference]: Without dead ends: 1481 [2022-11-22 01:53:52,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2022-11-22 01:53:52,712 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 362 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:52,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 54 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:53:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2022-11-22 01:53:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1050. [2022-11-22 01:53:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1042 states have (on average 2.3502879078694816) internal successors, (2449), 1049 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2449 transitions. [2022-11-22 01:53:52,734 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 2449 transitions. Word has length 33 [2022-11-22 01:53:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:52,735 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 2449 transitions. [2022-11-22 01:53:52,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 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-22 01:53:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 2449 transitions. [2022-11-22 01:53:52,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 01:53:52,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:52,737 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-22 01:53:52,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-22 01:53:52,737 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:52,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:52,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1824357901, now seen corresponding path program 2 times [2022-11-22 01:53:52,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:52,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310410910] [2022-11-22 01:53:52,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:52,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:54,408 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-22 01:53:54,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:54,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310410910] [2022-11-22 01:53:54,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310410910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:54,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:54,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-22 01:53:54,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642950273] [2022-11-22 01:53:54,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:54,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-22 01:53:54,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:54,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-22 01:53:54,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-11-22 01:53:54,410 INFO L87 Difference]: Start difference. First operand 1050 states and 2449 transitions. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 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-22 01:53:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:55,533 INFO L93 Difference]: Finished difference Result 1389 states and 3214 transitions. [2022-11-22 01:53:55,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 01:53:55,534 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 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-22 01:53:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:55,536 INFO L225 Difference]: With dead ends: 1389 [2022-11-22 01:53:55,536 INFO L226 Difference]: Without dead ends: 1389 [2022-11-22 01:53:55,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2022-11-22 01:53:55,536 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 193 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:55,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 64 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 01:53:55,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2022-11-22 01:53:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1135. [2022-11-22 01:53:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1127 states have (on average 2.3504880212954746) internal successors, (2649), 1134 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 2649 transitions. [2022-11-22 01:53:55,558 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 2649 transitions. Word has length 33 [2022-11-22 01:53:55,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:55,559 INFO L495 AbstractCegarLoop]: Abstraction has 1135 states and 2649 transitions. [2022-11-22 01:53:55,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 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-22 01:53:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 2649 transitions. [2022-11-22 01:53:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 01:53:55,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:55,561 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-22 01:53:55,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-22 01:53:55,561 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:55,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:55,562 INFO L85 PathProgramCache]: Analyzing trace with hash -267114898, now seen corresponding path program 2 times [2022-11-22 01:53:55,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:55,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961975568] [2022-11-22 01:53:55,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:55,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:56,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-22 01:53:56,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:56,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961975568] [2022-11-22 01:53:56,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961975568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:56,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:56,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 01:53:56,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644461281] [2022-11-22 01:53:56,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:56,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 01:53:56,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:56,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 01:53:56,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:53:56,172 INFO L87 Difference]: Start difference. First operand 1135 states and 2649 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-22 01:53:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:56,546 INFO L93 Difference]: Finished difference Result 1127 states and 2632 transitions. [2022-11-22 01:53:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:53:56,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-22 01:53:56,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:56,549 INFO L225 Difference]: With dead ends: 1127 [2022-11-22 01:53:56,549 INFO L226 Difference]: Without dead ends: 1127 [2022-11-22 01:53:56,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:53:56,550 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 243 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:56,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 22 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:53:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2022-11-22 01:53:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1031. [2022-11-22 01:53:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 1024 states have (on average 2.353515625) internal successors, (2410), 1030 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2410 transitions. [2022-11-22 01:53:56,570 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2410 transitions. Word has length 33 [2022-11-22 01:53:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:56,571 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 2410 transitions. [2022-11-22 01:53:56,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-22 01:53:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2410 transitions. [2022-11-22 01:53:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 01:53:56,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:56,573 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-22 01:53:56,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-22 01:53:56,573 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:56,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:56,574 INFO L85 PathProgramCache]: Analyzing trace with hash -267114787, now seen corresponding path program 3 times [2022-11-22 01:53:56,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:56,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074922629] [2022-11-22 01:53:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:56,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:57,545 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-22 01:53:57,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:57,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074922629] [2022-11-22 01:53:57,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074922629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:57,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:57,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-22 01:53:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253384502] [2022-11-22 01:53:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:57,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-22 01:53:57,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:57,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-22 01:53:57,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:53:57,547 INFO L87 Difference]: Start difference. First operand 1031 states and 2410 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-22 01:53:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:58,611 INFO L93 Difference]: Finished difference Result 1361 states and 3178 transitions. [2022-11-22 01:53:58,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 01:53:58,611 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-22 01:53:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:58,613 INFO L225 Difference]: With dead ends: 1361 [2022-11-22 01:53:58,613 INFO L226 Difference]: Without dead ends: 1361 [2022-11-22 01:53:58,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2022-11-22 01:53:58,614 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 212 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:58,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 63 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:53:58,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2022-11-22 01:53:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 818. [2022-11-22 01:53:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 811 states have (on average 2.374845869297164) internal successors, (1926), 817 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:53:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1926 transitions. [2022-11-22 01:53:58,634 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1926 transitions. Word has length 33 [2022-11-22 01:53:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:58,635 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1926 transitions. [2022-11-22 01:53:58,635 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-22 01:53:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1926 transitions. [2022-11-22 01:53:58,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 01:53:58,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:58,636 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-22 01:53:58,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-22 01:53:58,637 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:53:58,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:58,637 INFO L85 PathProgramCache]: Analyzing trace with hash -963940238, now seen corresponding path program 1 times [2022-11-22 01:53:58,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:58,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962221820] [2022-11-22 01:53:58,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:58,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:00,273 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-22 01:54:00,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:00,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962221820] [2022-11-22 01:54:00,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962221820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:00,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:00,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-22 01:54:00,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791319392] [2022-11-22 01:54:00,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:00,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 01:54:00,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:00,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 01:54:00,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:54:00,276 INFO L87 Difference]: Start difference. First operand 818 states and 1926 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-22 01:54:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:00,977 INFO L93 Difference]: Finished difference Result 1027 states and 2389 transitions. [2022-11-22 01:54:00,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 01:54:00,977 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-22 01:54:00,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:00,979 INFO L225 Difference]: With dead ends: 1027 [2022-11-22 01:54:00,979 INFO L226 Difference]: Without dead ends: 986 [2022-11-22 01:54:00,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-22 01:54:00,980 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 152 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:00,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 55 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:54:00,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2022-11-22 01:54:00,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 982. [2022-11-22 01:54:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 975 states have (on average 2.3476923076923075) internal successors, (2289), 981 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 2289 transitions. [2022-11-22 01:54:00,997 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 2289 transitions. Word has length 36 [2022-11-22 01:54:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:00,997 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 2289 transitions. [2022-11-22 01:54:00,997 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-22 01:54:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 2289 transitions. [2022-11-22 01:54:00,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 01:54:00,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:00,999 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-22 01:54:00,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-22 01:54:00,999 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:54:00,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:01,000 INFO L85 PathProgramCache]: Analyzing trace with hash -36119424, now seen corresponding path program 2 times [2022-11-22 01:54:01,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:01,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273642531] [2022-11-22 01:54:01,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:01,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:02,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-22 01:54:02,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:02,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273642531] [2022-11-22 01:54:02,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273642531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:02,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:02,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-22 01:54:02,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228743008] [2022-11-22 01:54:02,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:02,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-22 01:54:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:02,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-22 01:54:02,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:54:02,650 INFO L87 Difference]: Start difference. First operand 982 states and 2289 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-22 01:54:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:03,388 INFO L93 Difference]: Finished difference Result 1124 states and 2598 transitions. [2022-11-22 01:54:03,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 01:54:03,389 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-22 01:54:03,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:03,391 INFO L225 Difference]: With dead ends: 1124 [2022-11-22 01:54:03,391 INFO L226 Difference]: Without dead ends: 1083 [2022-11-22 01:54:03,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2022-11-22 01:54:03,392 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 191 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:03,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 47 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:54:03,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2022-11-22 01:54:03,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 915. [2022-11-22 01:54:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 908 states have (on average 2.351321585903084) internal successors, (2135), 914 states have internal predecessors, (2135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 2135 transitions. [2022-11-22 01:54:03,406 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 2135 transitions. Word has length 36 [2022-11-22 01:54:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:03,407 INFO L495 AbstractCegarLoop]: Abstraction has 915 states and 2135 transitions. [2022-11-22 01:54:03,407 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-22 01:54:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 2135 transitions. [2022-11-22 01:54:03,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 01:54:03,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:03,408 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-22 01:54:03,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-22 01:54:03,409 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:54:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash 955423308, now seen corresponding path program 3 times [2022-11-22 01:54:03,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:03,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938825022] [2022-11-22 01:54:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:03,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:04,813 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-22 01:54:04,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:04,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938825022] [2022-11-22 01:54:04,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938825022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:04,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:04,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-22 01:54:04,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590205794] [2022-11-22 01:54:04,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:04,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 01:54:04,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:04,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 01:54:04,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:54:04,816 INFO L87 Difference]: Start difference. First operand 915 states and 2135 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-22 01:54:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:05,583 INFO L93 Difference]: Finished difference Result 747 states and 1683 transitions. [2022-11-22 01:54:05,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 01:54:05,583 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-22 01:54:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:05,584 INFO L225 Difference]: With dead ends: 747 [2022-11-22 01:54:05,584 INFO L226 Difference]: Without dead ends: 747 [2022-11-22 01:54:05,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-11-22 01:54:05,585 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 137 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:05,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 56 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:54:05,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-11-22 01:54:05,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 735. [2022-11-22 01:54:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 728 states have (on average 2.2884615384615383) internal successors, (1666), 734 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1666 transitions. [2022-11-22 01:54:05,597 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1666 transitions. Word has length 36 [2022-11-22 01:54:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:05,597 INFO L495 AbstractCegarLoop]: Abstraction has 735 states and 1666 transitions. [2022-11-22 01:54:05,597 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-22 01:54:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1666 transitions. [2022-11-22 01:54:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 01:54:05,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:05,599 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-22 01:54:05,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-22 01:54:05,599 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:54:05,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:05,600 INFO L85 PathProgramCache]: Analyzing trace with hash 955423339, now seen corresponding path program 1 times [2022-11-22 01:54:05,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:05,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770689824] [2022-11-22 01:54:05,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:05,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:07,414 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-22 01:54:07,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:07,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770689824] [2022-11-22 01:54:07,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770689824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:54:07,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:54:07,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-22 01:54:07,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021880177] [2022-11-22 01:54:07,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:54:07,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-22 01:54:07,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:07,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-22 01:54:07,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-11-22 01:54:07,416 INFO L87 Difference]: Start difference. First operand 735 states and 1666 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 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-22 01:54:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:08,401 INFO L93 Difference]: Finished difference Result 739 states and 1666 transitions. [2022-11-22 01:54:08,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:54:08,402 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 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-22 01:54:08,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:08,403 INFO L225 Difference]: With dead ends: 739 [2022-11-22 01:54:08,403 INFO L226 Difference]: Without dead ends: 697 [2022-11-22 01:54:08,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2022-11-22 01:54:08,404 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 185 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:08,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 55 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:54:08,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-11-22 01:54:08,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 604. [2022-11-22 01:54:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 597 states have (on average 2.303182579564489) internal successors, (1375), 603 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1375 transitions. [2022-11-22 01:54:08,412 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1375 transitions. Word has length 36 [2022-11-22 01:54:08,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:08,412 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 1375 transitions. [2022-11-22 01:54:08,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 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-22 01:54:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1375 transitions. [2022-11-22 01:54:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-22 01:54:08,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:08,413 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-22 01:54:08,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-22 01:54:08,414 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:54:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash 530950488, now seen corresponding path program 1 times [2022-11-22 01:54:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:08,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083992955] [2022-11-22 01:54:08,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:10,325 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-22 01:54:10,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:10,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083992955] [2022-11-22 01:54:10,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083992955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:54:10,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426635952] [2022-11-22 01:54:10,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:10,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:10,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:54:10,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:54:10,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:54:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:10,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-22 01:54:10,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:54:11,006 INFO L350 Elim1Store]: Elim1 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-22 01:54:11,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:11,057 INFO L350 Elim1Store]: Elim1 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-22 01:54:11,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:54:11,185 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-22 01:54:11,185 INFO L350 Elim1Store]: Elim1 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-22 01:54:11,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:11,321 INFO L350 Elim1Store]: Elim1 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-22 01:54:11,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-11-22 01:54:11,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:11,550 INFO L350 Elim1Store]: Elim1 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-22 01:54:11,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:11,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:54:11,803 INFO L350 Elim1Store]: Elim1 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-22 01:54:11,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2022-11-22 01:54:12,101 INFO L321 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-11-22 01:54:12,101 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-22 01:54:12,152 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-22 01:54:12,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:54:12,810 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1778 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1778) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483648)) (forall ((v_ArrVal_1778 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1778) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 802)))) is different from false [2022-11-22 01:54:14,651 INFO L321 Elim1Store]: treesize reduction 323, result has 42.5 percent of original size [2022-11-22 01:54:14,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 262 treesize of output 360 [2022-11-22 01:54:14,709 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-22 01:54:14,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 248 treesize of output 235 [2022-11-22 01:54:14,804 INFO L321 Elim1Store]: treesize reduction 57, result has 36.7 percent of original size [2022-11-22 01:54:14,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 408 treesize of output 480 [2022-11-22 01:54:14,860 INFO L350 Elim1Store]: Elim1 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 72 treesize of output 64 [2022-11-22 01:54:15,059 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 8 [2022-11-22 01:54:15,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:15,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:15,083 INFO L350 Elim1Store]: Elim1 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 88 treesize of output 68 [2022-11-22 01:54:15,099 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 8 [2022-11-22 01:54:15,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:54:15,146 INFO L350 Elim1Store]: Elim1 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 75 treesize of output 63 [2022-11-22 01:54:15,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:54:15,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:15,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 209 treesize of output 225 [2022-11-22 01:54:16,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:16,104 INFO L350 Elim1Store]: Elim1 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 565 treesize of output 505 [2022-11-22 01:54:16,665 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 01:54:16,665 INFO L350 Elim1Store]: Elim1 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 85 treesize of output 73 [2022-11-22 01:54:16,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:16,679 INFO L350 Elim1Store]: Elim1 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 69 treesize of output 71 [2022-11-22 01:54:16,891 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-22 01:54:16,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426635952] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:54:16,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1542361446] [2022-11-22 01:54:16,899 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:54:16,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:54:16,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2022-11-22 01:54:16,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469426709] [2022-11-22 01:54:16,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:54:16,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-22 01:54:16,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:16,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-22 01:54:16,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2642, Unknown=25, NotChecked=106, Total=3080 [2022-11-22 01:54:16,906 INFO L87 Difference]: Start difference. First operand 604 states and 1375 transitions. Second operand has 56 states, 55 states have (on average 2.4727272727272727) internal successors, (136), 55 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:26,369 INFO L93 Difference]: Finished difference Result 1711 states and 3826 transitions. [2022-11-22 01:54:26,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-22 01:54:26,370 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.4727272727272727) internal successors, (136), 55 states have internal predecessors, (136), 0 states have call successors, (0), 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-22 01:54:26,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:26,372 INFO L225 Difference]: With dead ends: 1711 [2022-11-22 01:54:26,372 INFO L226 Difference]: Without dead ends: 1705 [2022-11-22 01:54:26,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 1 IntricatePredicates, 3 DeprecatedPredicates, 3263 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2003, Invalid=9318, Unknown=25, NotChecked=210, Total=11556 [2022-11-22 01:54:26,376 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2218 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 3983 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2218 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 4802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 3983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 356 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:26,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2218 Valid, 421 Invalid, 4802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 3983 Invalid, 0 Unknown, 356 Unchecked, 4.5s Time] [2022-11-22 01:54:26,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2022-11-22 01:54:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1322. [2022-11-22 01:54:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1315 states have (on average 2.406844106463878) internal successors, (3165), 1321 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 3165 transitions. [2022-11-22 01:54:26,403 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 3165 transitions. Word has length 46 [2022-11-22 01:54:26,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:26,403 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 3165 transitions. [2022-11-22 01:54:26,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.4727272727272727) internal successors, (136), 55 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 3165 transitions. [2022-11-22 01:54:26,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-22 01:54:26,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:26,405 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-22 01:54:26,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-22 01:54:26,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-22 01:54:26,612 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:54:26,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:26,612 INFO L85 PathProgramCache]: Analyzing trace with hash 530950524, now seen corresponding path program 1 times [2022-11-22 01:54:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:26,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403508174] [2022-11-22 01:54:26,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:26,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:27,191 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-22 01:54:27,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:27,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403508174] [2022-11-22 01:54:27,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403508174] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:54:27,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371928013] [2022-11-22 01:54:27,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:27,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:27,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:54:27,192 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:54:27,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:54:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:27,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-22 01:54:27,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:54:27,679 INFO L350 Elim1Store]: Elim1 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-22 01:54:27,737 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 24 [2022-11-22 01:54:27,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:27,771 INFO L350 Elim1Store]: Elim1 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-22 01:54:27,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:54:27,933 INFO L350 Elim1Store]: Elim1 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-22 01:54:27,991 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 24 [2022-11-22 01:54:28,095 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 01:54:28,096 INFO L350 Elim1Store]: Elim1 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-22 01:54:28,141 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-22 01:54:28,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:54:28,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:28,884 INFO L350 Elim1Store]: Elim1 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-22 01:54:28,895 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:28,896 INFO L350 Elim1Store]: Elim1 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 105 treesize of output 107 [2022-11-22 01:54:28,906 INFO L350 Elim1Store]: Elim1 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-22 01:54:28,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-11-22 01:54:28,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:28,941 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 58 [2022-11-22 01:54:29,103 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-22 01:54:29,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371928013] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:54:29,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [353708907] [2022-11-22 01:54:29,104 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:54:29,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:54:29,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 30 [2022-11-22 01:54:29,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353651855] [2022-11-22 01:54:29,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:54:29,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 01:54:29,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:29,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 01:54:29,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=820, Unknown=10, NotChecked=0, Total=992 [2022-11-22 01:54:29,107 INFO L87 Difference]: Start difference. First operand 1322 states and 3165 transitions. Second operand has 32 states, 31 states have (on average 4.451612903225806) internal successors, (138), 31 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-22 01:54:32,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:54:32,699 INFO L93 Difference]: Finished difference Result 1659 states and 3880 transitions. [2022-11-22 01:54:32,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 01:54:32,700 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.451612903225806) internal successors, (138), 31 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-22 01:54:32,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:54:32,702 INFO L225 Difference]: With dead ends: 1659 [2022-11-22 01:54:32,702 INFO L226 Difference]: Without dead ends: 1647 [2022-11-22 01:54:32,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=411, Invalid=1301, Unknown=10, NotChecked=0, Total=1722 [2022-11-22 01:54:32,704 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 327 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 66 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:54:32,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 171 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1439 Invalid, 2 Unknown, 0 Unchecked, 3.1s Time] [2022-11-22 01:54:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2022-11-22 01:54:32,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1304. [2022-11-22 01:54:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1298 states have (on average 2.3805855161787366) internal successors, (3090), 1303 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:54:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 3090 transitions. [2022-11-22 01:54:32,728 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 3090 transitions. Word has length 46 [2022-11-22 01:54:32,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:54:32,729 INFO L495 AbstractCegarLoop]: Abstraction has 1304 states and 3090 transitions. [2022-11-22 01:54:32,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.451612903225806) internal successors, (138), 31 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-22 01:54:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 3090 transitions. [2022-11-22 01:54:32,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-22 01:54:32,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:54:32,731 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-22 01:54:32,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-22 01:54:32,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-22 01:54:32,937 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:54:32,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:54:32,938 INFO L85 PathProgramCache]: Analyzing trace with hash -90317850, now seen corresponding path program 2 times [2022-11-22 01:54:32,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:54:32,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438060114] [2022-11-22 01:54:32,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:54:32,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:54:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:54:35,514 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-22 01:54:35,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:54:35,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438060114] [2022-11-22 01:54:35,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438060114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:54:35,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679968531] [2022-11-22 01:54:35,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:54:35,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:54:35,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:54:35,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:54:35,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:54:35,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:54:35,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:54:35,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-22 01:54:35,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:54:36,145 INFO L350 Elim1Store]: Elim1 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-22 01:54:36,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:36,195 INFO L350 Elim1Store]: Elim1 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-22 01:54:36,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:36,251 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 21 [2022-11-22 01:54:36,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:54:36,397 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-22 01:54:36,398 INFO L350 Elim1Store]: Elim1 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-22 01:54:36,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:36,505 INFO L350 Elim1Store]: Elim1 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-22 01:54:36,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-11-22 01:54:36,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:36,713 INFO L350 Elim1Store]: Elim1 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-22 01:54:36,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:54:36,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:54:36,941 INFO L350 Elim1Store]: Elim1 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-22 01:54:37,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2022-11-22 01:54:37,204 INFO L321 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-11-22 01:54:37,204 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-22 01:54:37,248 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-22 01:54:37,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:54:38,012 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2062 Int) (v_ArrVal_2064 Int) (v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2061 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2059) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_2061) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_2062) (+ |c_~#queue~0.offset| (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204)))) v_ArrVal_2064) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_2061 1))))) is different from false [2022-11-22 01:54:38,028 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2062 Int) (v_ArrVal_2064 Int) (v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2061 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2059) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_2061) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_2062) (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|) v_ArrVal_2064) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_2061 1))))) is different from false [2022-11-22 01:54:38,062 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2062 Int) (v_ArrVal_2064 Int) (v_ArrVal_2056 Int) (v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2061 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2056) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2059) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_2061) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_2062) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_2064) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_2061 1)) (not (<= v_ArrVal_2056 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))) is different from false [2022-11-22 01:54:38,245 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2062 Int) (v_ArrVal_2054 Int) (v_ArrVal_2064 Int) (v_ArrVal_2056 Int) (v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2061 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2054)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2056) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2059) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_2056) (< (select .cse0 .cse1) (+ v_ArrVal_2061 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2061) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_2062) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_2064) .cse1) 2147483647)))) is different from false [2022-11-22 01:54:43,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:43,047 INFO L350 Elim1Store]: Elim1 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 959 treesize of output 425 [2022-11-22 01:54:43,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:43,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2788 treesize of output 2714 [2022-11-22 01:54:43,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:43,135 INFO L350 Elim1Store]: Elim1 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 2683 treesize of output 2491 [2022-11-22 01:54:43,188 INFO L350 Elim1Store]: Elim1 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 3582 treesize of output 3326 [2022-11-22 01:54:43,366 INFO L350 Elim1Store]: Elim1 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-22 01:54:43,685 INFO L350 Elim1Store]: Elim1 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 1842 treesize of output 1682 [2022-11-22 01:54:43,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:43,957 INFO L350 Elim1Store]: Elim1 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 1859 treesize of output 1703 [2022-11-22 01:54:44,980 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:54:44,981 INFO L350 Elim1Store]: Elim1 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 2199 treesize of output 2131 [2022-11-22 01:54:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-22 01:54:47,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679968531] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:54:47,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [451429652] [2022-11-22 01:54:47,089 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:54:47,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:54:47,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 20] total 61 [2022-11-22 01:54:47,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090544416] [2022-11-22 01:54:47,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:54:47,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-22 01:54:47,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:54:47,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-22 01:54:47,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=3044, Unknown=30, NotChecked=468, Total=3906 [2022-11-22 01:54:47,093 INFO L87 Difference]: Start difference. First operand 1304 states and 3090 transitions. Second operand has 63 states, 62 states have (on average 2.225806451612903) internal successors, (138), 62 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-22 01:55:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:55:06,581 INFO L93 Difference]: Finished difference Result 1699 states and 3934 transitions. [2022-11-22 01:55:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-22 01:55:06,582 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.225806451612903) internal successors, (138), 62 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-22 01:55:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:55:06,584 INFO L225 Difference]: With dead ends: 1699 [2022-11-22 01:55:06,584 INFO L226 Difference]: Without dead ends: 1699 [2022-11-22 01:55:06,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 102 ConstructedPredicates, 4 IntricatePredicates, 5 DeprecatedPredicates, 2621 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=1802, Invalid=8083, Unknown=31, NotChecked=796, Total=10712 [2022-11-22 01:55:06,586 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1597 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 2223 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 3360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 2223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 737 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:55:06,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 216 Invalid, 3360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 2223 Invalid, 0 Unknown, 737 Unchecked, 4.0s Time] [2022-11-22 01:55:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2022-11-22 01:55:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1342. [2022-11-22 01:55:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1337 states have (on average 2.388182498130142) internal successors, (3193), 1341 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:55:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 3193 transitions. [2022-11-22 01:55:06,603 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 3193 transitions. Word has length 46 [2022-11-22 01:55:06,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:55:06,603 INFO L495 AbstractCegarLoop]: Abstraction has 1342 states and 3193 transitions. [2022-11-22 01:55:06,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.225806451612903) internal successors, (138), 62 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-22 01:55:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 3193 transitions. [2022-11-22 01:55:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-22 01:55:06,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:55:06,605 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:55:06,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 01:55:06,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-11-22 01:55:06,806 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:55:06,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:55:06,806 INFO L85 PathProgramCache]: Analyzing trace with hash -816467694, now seen corresponding path program 1 times [2022-11-22 01:55:06,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:55:06,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304912649] [2022-11-22 01:55:06,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:55:06,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:55:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:55:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:55:07,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:55:07,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304912649] [2022-11-22 01:55:07,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304912649] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:55:07,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770276862] [2022-11-22 01:55:07,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:55:07,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:55:07,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:55:07,399 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:55:07,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 01:55:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:55:07,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-22 01:55:07,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:55:07,999 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 21 [2022-11-22 01:55:08,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:08,045 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 28 [2022-11-22 01:55:08,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:08,197 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 28 [2022-11-22 01:55:08,248 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 28 [2022-11-22 01:55:08,357 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-22 01:55:08,358 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 33 [2022-11-22 01:55:08,406 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 28 [2022-11-22 01:55:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:55:08,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:55:08,766 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2198 (Array Int Int)) (v_ArrVal_2204 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2198) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2204)) .cse1))))) is different from false [2022-11-22 01:55:08,775 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2198 (Array Int Int)) (v_ArrVal_2204 Int)) (< 0 (+ (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2198) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2204)) .cse1)) 2147483650))) is different from false [2022-11-22 01:55:08,839 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:08,839 INFO L350 Elim1Store]: Elim1 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 88 treesize of output 52 [2022-11-22 01:55:08,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:08,849 INFO L350 Elim1Store]: Elim1 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 75 treesize of output 75 [2022-11-22 01:55:08,864 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 28 [2022-11-22 01:55:08,882 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 10 [2022-11-22 01:55:08,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:55:08,911 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 52 [2022-11-22 01:55:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:55:09,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770276862] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:55:09,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [856248414] [2022-11-22 01:55:09,055 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:55:09,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:55:09,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 27 [2022-11-22 01:55:09,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101310840] [2022-11-22 01:55:09,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:55:09,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-22 01:55:09,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:55:09,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-22 01:55:09,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=587, Unknown=2, NotChecked=102, Total=812 [2022-11-22 01:55:09,058 INFO L87 Difference]: Start difference. First operand 1342 states and 3193 transitions. Second operand has 29 states, 28 states have (on average 5.25) internal successors, (147), 28 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:55:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:55:12,049 INFO L93 Difference]: Finished difference Result 1849 states and 4266 transitions. [2022-11-22 01:55:12,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-22 01:55:12,050 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 5.25) internal successors, (147), 28 states have internal predecessors, (147), 0 states have call successors, (0), 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 49 [2022-11-22 01:55:12,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:55:12,052 INFO L225 Difference]: With dead ends: 1849 [2022-11-22 01:55:12,053 INFO L226 Difference]: Without dead ends: 1815 [2022-11-22 01:55:12,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=536, Invalid=1632, Unknown=2, NotChecked=182, Total=2352 [2022-11-22 01:55:12,054 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 525 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:55:12,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 176 Invalid, 1888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1553 Invalid, 0 Unknown, 227 Unchecked, 1.7s Time] [2022-11-22 01:55:12,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2022-11-22 01:55:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1340. [2022-11-22 01:55:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1335 states have (on average 2.3602996254681647) internal successors, (3151), 1339 states have internal predecessors, (3151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:55:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 3151 transitions. [2022-11-22 01:55:12,074 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 3151 transitions. Word has length 49 [2022-11-22 01:55:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:55:12,075 INFO L495 AbstractCegarLoop]: Abstraction has 1340 states and 3151 transitions. [2022-11-22 01:55:12,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 5.25) internal successors, (147), 28 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:55:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 3151 transitions. [2022-11-22 01:55:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-22 01:55:12,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:55:12,077 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:55:12,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-22 01:55:12,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:55:12,283 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 01:55:12,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:55:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2007446589, now seen corresponding path program 1 times [2022-11-22 01:55:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:55:12,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293961] [2022-11-22 01:55:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:55:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:55:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:55:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:55:14,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:55:14,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293961] [2022-11-22 01:55:14,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293961] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:55:14,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131231199] [2022-11-22 01:55:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:55:14,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:55:14,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:55:14,108 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:55:14,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 01:55:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:55:14,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-22 01:55:14,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:55:14,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:14,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:14,426 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 01:55:14,426 INFO L350 Elim1Store]: Elim1 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-22 01:55:14,452 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-22 01:55:14,453 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 34 [2022-11-22 01:55:14,618 INFO L350 Elim1Store]: Elim1 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-22 01:55:14,714 INFO L350 Elim1Store]: Elim1 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-22 01:55:14,918 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 48 [2022-11-22 01:55:14,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:14,992 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 76 [2022-11-22 01:55:15,089 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 76 [2022-11-22 01:55:15,318 INFO L350 Elim1Store]: Elim1 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 92 treesize of output 85 [2022-11-22 01:55:15,476 INFO L350 Elim1Store]: Elim1 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 88 treesize of output 83 [2022-11-22 01:55:15,772 INFO L350 Elim1Store]: Elim1 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 99 treesize of output 92 [2022-11-22 01:55:15,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:55:15,945 INFO L350 Elim1Store]: Elim1 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 86 treesize of output 88 [2022-11-22 01:55:16,425 INFO L350 Elim1Store]: Elim1 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 93 treesize of output 88 [2022-11-22 01:55:16,636 INFO L350 Elim1Store]: Elim1 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 93 treesize of output 88 [2022-11-22 01:55:17,173 INFO L350 Elim1Store]: Elim1 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 109 treesize of output 102 [2022-11-22 01:55:19,447 INFO L350 Elim1Store]: Elim1 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 105 treesize of output 100 [2022-11-22 01:55:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:55:22,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:55:23,159 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2370 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| Int) (v_ArrVal_2364 Int) (v_ArrVal_2365 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2364)) |c_~#stored_elements~0.base| v_ArrVal_2365) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= v_ArrVal_2364 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| 4) |c_~#queue~0.offset|) v_ArrVal_2370) .cse1) 2147483647)))) is different from false [2022-11-22 01:55:23,179 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2370 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| Int) (v_ArrVal_2364 Int) (v_ArrVal_2365 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2364)) |c_~#stored_elements~0.base| v_ArrVal_2365) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2364) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| 4) |c_~#queue~0.offset|) v_ArrVal_2370) .cse1) 2147483647))))) is different from false [2022-11-22 01:55:23,215 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2370 Int) (v_ArrVal_2362 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| Int) (v_ArrVal_2364 Int) (v_ArrVal_2365 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2362) .cse3 v_ArrVal_2364)) |c_~#stored_elements~0.base| v_ArrVal_2365) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| 4) |c_~#queue~0.offset|) v_ArrVal_2370) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2364) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| (select .cse0 .cse1))))))) is different from false [2022-11-22 01:55:25,755 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2362 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_212| Int) (v_ArrVal_2364 Int) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2365 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2358))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2360)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2362) .cse1 v_ArrVal_2364)) |c_~#stored_elements~0.base| v_ArrVal_2365) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_212| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2364) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| (select .cse3 .cse1))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| 4) |c_~#queue~0.offset|) v_ArrVal_2370) .cse1) 2147483647))))))) is different from false [2022-11-22 01:55:25,848 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2362 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_212| Int) (v_ArrVal_2364 Int) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2365 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2357) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2358))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2360)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2362) .cse1 v_ArrVal_2364)) |c_~#stored_elements~0.base| v_ArrVal_2365) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| 4) |c_~#queue~0.offset|) v_ArrVal_2370) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_212| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2364))))))) is different from false [2022-11-22 01:55:25,878 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2362 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_212| Int) (v_ArrVal_2364 Int) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2365 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2357) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2358))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2360)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2362) .cse1 v_ArrVal_2364)) |c_~#stored_elements~0.base| v_ArrVal_2365) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| 4) |c_~#queue~0.offset|) v_ArrVal_2370) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_210| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_212| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2364))))))) is different from false [2022-11-22 01:55:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-22 01:55:26,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131231199] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:55:26,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2092807023] [2022-11-22 01:55:26,939 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 01:55:26,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:55:26,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 50 [2022-11-22 01:55:26,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123212584] [2022-11-22 01:55:26,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:55:26,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-22 01:55:26,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:55:26,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-22 01:55:26,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=1632, Unknown=44, NotChecked=558, Total=2652 [2022-11-22 01:55:26,942 INFO L87 Difference]: Start difference. First operand 1340 states and 3151 transitions. Second operand has 52 states, 51 states have (on average 2.8823529411764706) internal successors, (147), 51 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:55:29,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:55:34,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:55:53,103 WARN L233 SmtUtils]: Spent 9.30s on a formula simplification. DAG size of input: 175 DAG size of output: 131 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:55:58,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:56:04,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:56:18,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:56:21,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:56:38,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:56:43,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:56:45,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:00,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:02,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:04,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:06,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:08,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:10,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:12,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:15,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:17,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:19,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:21,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:24,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:26,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:28,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:30,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:32,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:34,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:37,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:57:41,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:46,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:48,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:50,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:52,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:57:54,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:58:00,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:58:18,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:58:28,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:58:35,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:58:36,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 01:58:53,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:00:20,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:00:22,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:00:24,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:00:26,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:00:28,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:00:30,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:00:32,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:00:34,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:00:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:00:43,368 INFO L93 Difference]: Finished difference Result 2616 states and 5953 transitions. [2022-11-22 02:00:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-22 02:00:43,369 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.8823529411764706) internal successors, (147), 51 states have internal predecessors, (147), 0 states have call successors, (0), 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 49 [2022-11-22 02:00:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:00:43,372 INFO L225 Difference]: With dead ends: 2616 [2022-11-22 02:00:43,372 INFO L226 Difference]: Without dead ends: 2554 [2022-11-22 02:00:43,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 64 SyntacticMatches, 22 SemanticMatches, 113 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 4707 ImplicationChecksByTransitivity, 210.0s TimeCoverageRelationStatistics Valid=1925, Invalid=9641, Unknown=230, NotChecked=1314, Total=13110 [2022-11-22 02:00:43,375 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1114 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 3304 mSolverCounterSat, 232 mSolverCounterUnsat, 240 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 115.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 5012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 3304 IncrementalHoareTripleChecker+Invalid, 240 IncrementalHoareTripleChecker+Unknown, 1236 IncrementalHoareTripleChecker+Unchecked, 116.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:00:43,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 325 Invalid, 5012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 3304 Invalid, 240 Unknown, 1236 Unchecked, 116.6s Time] [2022-11-22 02:00:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2022-11-22 02:00:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2093. [2022-11-22 02:00:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 2088 states have (on average 2.335727969348659) internal successors, (4877), 2092 states have internal predecessors, (4877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:00:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 4877 transitions. [2022-11-22 02:00:43,413 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 4877 transitions. Word has length 49 [2022-11-22 02:00:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:00:43,414 INFO L495 AbstractCegarLoop]: Abstraction has 2093 states and 4877 transitions. [2022-11-22 02:00:43,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.8823529411764706) internal successors, (147), 51 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:00:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 4877 transitions. [2022-11-22 02:00:43,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-22 02:00:43,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:00:43,417 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:00:43,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-22 02:00:43,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:00:43,624 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 02:00:43,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:00:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash -597209236, now seen corresponding path program 2 times [2022-11-22 02:00:43,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:00:43,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493432727] [2022-11-22 02:00:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:00:43,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:00:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:00:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:00:45,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:00:45,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493432727] [2022-11-22 02:00:45,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493432727] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:00:45,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250363202] [2022-11-22 02:00:45,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:00:45,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:00:45,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:00:45,309 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:00:45,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 02:00:45,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 02:00:45,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:00:45,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-22 02:00:45,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:00:45,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:00:45,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:00:45,771 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 02:00:45,772 INFO L350 Elim1Store]: Elim1 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-22 02:00:45,791 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-22 02:00:45,792 INFO L350 Elim1Store]: Elim1 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-22 02:00:45,984 INFO L350 Elim1Store]: Elim1 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-22 02:00:46,120 INFO L350 Elim1Store]: Elim1 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-22 02:00:46,379 INFO L350 Elim1Store]: Elim1 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 53 treesize of output 46 [2022-11-22 02:00:46,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:00:46,491 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 42 [2022-11-22 02:00:46,781 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 51 [2022-11-22 02:00:47,008 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 49 [2022-11-22 02:00:47,628 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 58 [2022-11-22 02:00:50,285 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 54 [2022-11-22 02:00:52,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:00:52,092 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 54 [2022-11-22 02:00:52,835 INFO L350 Elim1Store]: Elim1 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-22 02:00:53,279 INFO L350 Elim1Store]: Elim1 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 59 treesize of output 54 [2022-11-22 02:00:57,618 INFO L350 Elim1Store]: Elim1 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 66 treesize of output 61 [2022-11-22 02:01:00,311 INFO L350 Elim1Store]: Elim1 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 71 treesize of output 66 [2022-11-22 02:01:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:01:07,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:01:08,548 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2538 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2532) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_2538) (+ |c_~#queue~0.offset| 3204)))) (< (+ v_ArrVal_2538 2147483648) 0))) is different from false [2022-11-22 02:01:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:01:40,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250363202] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:01:40,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2055817834] [2022-11-22 02:01:40,484 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 02:01:40,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:01:40,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 19] total 50 [2022-11-22 02:01:40,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405093006] [2022-11-22 02:01:40,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:01:40,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-22 02:01:40,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:01:40,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-22 02:01:40,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=2141, Unknown=48, NotChecked=98, Total=2652 [2022-11-22 02:01:40,488 INFO L87 Difference]: Start difference. First operand 2093 states and 4877 transitions. Second operand has 52 states, 51 states have (on average 2.8823529411764706) internal successors, (147), 51 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:01:47,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:01:50,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:01:52,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:01:55,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:01:57,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:02:04,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:02:19,826 WARN L233 SmtUtils]: Spent 9.78s on a formula simplification. DAG size of input: 174 DAG size of output: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:02:21,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:02:23,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:02:29,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:02:47,750 WARN L233 SmtUtils]: Spent 10.11s on a formula simplification. DAG size of input: 183 DAG size of output: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:02:53,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:03:01,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:03:08,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:03:12,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:03:25,063 WARN L233 SmtUtils]: Spent 10.00s on a formula simplification. DAG size of input: 180 DAG size of output: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:03:27,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:03:29,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:03:34,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:03:37,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:03:48,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:03:57,550 WARN L233 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 188 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:04:19,246 WARN L233 SmtUtils]: Spent 17.77s on a formula simplification. DAG size of input: 191 DAG size of output: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:04:21,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:04:23,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:04:25,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:04:36,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:04:38,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:04:40,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:04:42,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:05:04,171 WARN L233 SmtUtils]: Spent 7.77s on a formula simplification. DAG size of input: 165 DAG size of output: 138 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:05:06,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:05:08,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:05:26,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:05:28,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:05:48,422 WARN L233 SmtUtils]: Spent 11.22s on a formula simplification. DAG size of input: 159 DAG size of output: 138 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:05:50,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:05:52,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:06:08,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:06:10,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:06:12,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:06:15,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:06:17,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:06:19,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:06:22,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:06:35,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:06:37,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 02:06:49,196 WARN L233 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 174 DAG size of output: 151 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:06:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:06:53,499 INFO L93 Difference]: Finished difference Result 2434 states and 5584 transitions. [2022-11-22 02:06:53,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-22 02:06:53,500 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.8823529411764706) internal successors, (147), 51 states have internal predecessors, (147), 0 states have call successors, (0), 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 49 [2022-11-22 02:06:53,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:06:53,503 INFO L225 Difference]: With dead ends: 2434 [2022-11-22 02:06:53,503 INFO L226 Difference]: Without dead ends: 2408 [2022-11-22 02:06:53,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 67 SyntacticMatches, 10 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 8 DeprecatedPredicates, 2228 ImplicationChecksByTransitivity, 248.7s TimeCoverageRelationStatistics Valid=1410, Invalid=6512, Unknown=92, NotChecked=176, Total=8190 [2022-11-22 02:06:53,504 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 930 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 2738 mSolverCounterSat, 243 mSolverCounterUnsat, 100 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 114.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 3240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 2738 IncrementalHoareTripleChecker+Invalid, 100 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 116.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:06:53,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 359 Invalid, 3240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 2738 Invalid, 100 Unknown, 159 Unchecked, 116.1s Time] [2022-11-22 02:06:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2022-11-22 02:06:53,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1934. [2022-11-22 02:06:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1934 states, 1930 states have (on average 2.333678756476684) internal successors, (4504), 1933 states have internal predecessors, (4504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:06:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 4504 transitions. [2022-11-22 02:06:53,530 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 4504 transitions. Word has length 49 [2022-11-22 02:06:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:06:53,531 INFO L495 AbstractCegarLoop]: Abstraction has 1934 states and 4504 transitions. [2022-11-22 02:06:53,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.8823529411764706) internal successors, (147), 51 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:06:53,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 4504 transitions. [2022-11-22 02:06:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-22 02:06:53,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:06:53,533 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:06:53,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-22 02:06:53,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-11-22 02:06:53,741 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 02:06:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:06:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash -513926577, now seen corresponding path program 1 times [2022-11-22 02:06:53,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:06:53,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916581078] [2022-11-22 02:06:53,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:06:53,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:06:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:06:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:06:55,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:06:55,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916581078] [2022-11-22 02:06:55,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916581078] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:06:55,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306483087] [2022-11-22 02:06:55,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:06:55,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:06:55,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:06:55,069 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:06:55,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 02:06:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:06:55,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-22 02:06:55,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:06:55,837 INFO L350 Elim1Store]: Elim1 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-22 02:06:55,951 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 24 [2022-11-22 02:06:56,174 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-22 02:06:56,174 INFO L350 Elim1Store]: Elim1 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 36 [2022-11-22 02:06:56,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:06:56,423 INFO L350 Elim1Store]: Elim1 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 45 treesize of output 29 [2022-11-22 02:06:56,523 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 24 [2022-11-22 02:06:56,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:06:56,574 INFO L350 Elim1Store]: Elim1 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-22 02:06:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:06:56,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:06:56,752 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2697 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2697) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483648))) is different from false [2022-11-22 02:07:04,053 INFO L321 Elim1Store]: treesize reduction 226, result has 41.5 percent of original size [2022-11-22 02:07:04,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 100 treesize of output 206 [2022-11-22 02:07:04,091 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-22 02:07:04,091 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 156 treesize of output 142 [2022-11-22 02:07:04,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:07:04,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 179 treesize of output 215 [2022-11-22 02:07:04,164 INFO L350 Elim1Store]: Elim1 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-22 02:07:04,407 INFO L350 Elim1Store]: Elim1 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-22 02:07:04,422 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:07:04,423 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 41 [2022-11-22 02:07:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 7 refuted. 3 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-22 02:07:10,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306483087] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:07:10,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [822339055] [2022-11-22 02:07:10,673 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 02:07:10,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:07:10,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-22 02:07:10,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730632801] [2022-11-22 02:07:10,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:07:10,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-22 02:07:10,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:07:10,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-22 02:07:10,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=905, Unknown=22, NotChecked=64, Total=1190 [2022-11-22 02:07:10,676 INFO L87 Difference]: Start difference. First operand 1934 states and 4504 transitions. Second operand has 35 states, 34 states have (on average 5.205882352941177) internal successors, (177), 34 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:07:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:07:12,214 INFO L93 Difference]: Finished difference Result 1962 states and 4539 transitions. [2022-11-22 02:07:12,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:07:12,215 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 5.205882352941177) internal successors, (177), 34 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-22 02:07:12,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:07:12,218 INFO L225 Difference]: With dead ends: 1962 [2022-11-22 02:07:12,218 INFO L226 Difference]: Without dead ends: 1962 [2022-11-22 02:07:12,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=275, Invalid=1039, Unknown=22, NotChecked=70, Total=1406 [2022-11-22 02:07:12,219 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 320 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:07:12,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 122 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 903 Invalid, 0 Unknown, 75 Unchecked, 1.3s Time] [2022-11-22 02:07:12,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2022-11-22 02:07:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1926. [2022-11-22 02:07:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1923 states have (on average 2.3187727509100364) internal successors, (4459), 1925 states have internal predecessors, (4459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:07:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 4459 transitions. [2022-11-22 02:07:12,247 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 4459 transitions. Word has length 59 [2022-11-22 02:07:12,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:07:12,248 INFO L495 AbstractCegarLoop]: Abstraction has 1926 states and 4459 transitions. [2022-11-22 02:07:12,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 5.205882352941177) internal successors, (177), 34 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:07:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 4459 transitions. [2022-11-22 02:07:12,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-22 02:07:12,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:07:12,251 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:07:12,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-22 02:07:12,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d309a36-91e1-41cd-b522-cfe020e3a88d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:07:12,458 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-22 02:07:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:07:12,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1169398170, now seen corresponding path program 1 times [2022-11-22 02:07:12,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:07:12,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25819578] [2022-11-22 02:07:12,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:07:12,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:07:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat