./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 2329fc70 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_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh --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-2329fc7 [2022-12-14 10:39:09,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 10:39:09,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 10:39:09,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 10:39:09,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 10:39:09,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 10:39:09,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 10:39:09,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 10:39:09,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 10:39:09,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 10:39:09,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 10:39:09,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 10:39:09,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 10:39:09,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 10:39:09,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 10:39:09,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 10:39:09,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 10:39:09,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 10:39:09,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 10:39:09,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 10:39:09,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 10:39:09,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 10:39:09,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 10:39:09,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 10:39:09,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 10:39:09,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 10:39:09,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 10:39:09,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 10:39:09,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 10:39:09,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 10:39:09,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 10:39:09,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 10:39:09,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 10:39:09,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 10:39:09,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 10:39:09,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 10:39:09,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 10:39:09,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 10:39:09,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 10:39:09,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 10:39:09,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 10:39:09,225 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 10:39:09,246 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 10:39:09,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 10:39:09,247 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 10:39:09,247 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 10:39:09,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 10:39:09,248 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 10:39:09,248 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 10:39:09,248 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 10:39:09,248 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 10:39:09,249 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 10:39:09,249 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 10:39:09,249 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 10:39:09,249 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 10:39:09,249 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 10:39:09,249 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 10:39:09,250 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 10:39:09,250 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 10:39:09,250 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 10:39:09,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 10:39:09,251 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 10:39:09,251 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 10:39:09,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 10:39:09,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 10:39:09,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 10:39:09,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 10:39:09,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 10:39:09,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 10:39:09,252 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 10:39:09,253 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 10:39:09,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 10:39:09,253 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 10:39:09,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 10:39:09,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 10:39:09,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 10:39:09,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:39:09,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 10:39:09,254 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 10:39:09,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 10:39:09,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 10:39:09,255 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 10:39:09,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 10:39:09,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 10:39:09,255 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 10:39:09,255 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_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/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_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh 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-12-14 10:39:09,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 10:39:09,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 10:39:09,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 10:39:09,440 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 10:39:09,441 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 10:39:09,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread/queue_longest.i [2022-12-14 10:39:11,980 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 10:39:12,168 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 10:39:12,168 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/sv-benchmarks/c/pthread/queue_longest.i [2022-12-14 10:39:12,178 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/data/772fd84dd/00d70e336d0b4ac784322732fbb2f6bf/FLAG8949346d3 [2022-12-14 10:39:12,189 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/data/772fd84dd/00d70e336d0b4ac784322732fbb2f6bf [2022-12-14 10:39:12,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 10:39:12,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 10:39:12,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 10:39:12,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 10:39:12,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 10:39:12,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:39:12" (1/1) ... [2022-12-14 10:39:12,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@384cc58f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:12, skipping insertion in model container [2022-12-14 10:39:12,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:39:12" (1/1) ... [2022-12-14 10:39:12,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 10:39:12,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 10:39:12,518 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_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/sv-benchmarks/c/pthread/queue_longest.i[43296,43309] [2022-12-14 10:39:12,521 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_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/sv-benchmarks/c/pthread/queue_longest.i[43503,43516] [2022-12-14 10:39:12,523 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_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/sv-benchmarks/c/pthread/queue_longest.i[43783,43796] [2022-12-14 10:39:12,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:39:12,535 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 10:39:12,567 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_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/sv-benchmarks/c/pthread/queue_longest.i[43296,43309] [2022-12-14 10:39:12,568 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_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/sv-benchmarks/c/pthread/queue_longest.i[43503,43516] [2022-12-14 10:39:12,570 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_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/sv-benchmarks/c/pthread/queue_longest.i[43783,43796] [2022-12-14 10:39:12,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:39:12,608 INFO L208 MainTranslator]: Completed translation [2022-12-14 10:39:12,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:12 WrapperNode [2022-12-14 10:39:12,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 10:39:12,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 10:39:12,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 10:39:12,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 10:39:12,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:12" (1/1) ... [2022-12-14 10:39:12,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:12" (1/1) ... [2022-12-14 10:39:12,666 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 259 [2022-12-14 10:39:12,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 10:39:12,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 10:39:12,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 10:39:12,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 10:39:12,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:12" (1/1) ... [2022-12-14 10:39:12,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:12" (1/1) ... [2022-12-14 10:39:12,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:12" (1/1) ... [2022-12-14 10:39:12,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:12" (1/1) ... [2022-12-14 10:39:12,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:12" (1/1) ... [2022-12-14 10:39:12,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:12" (1/1) ... [2022-12-14 10:39:12,689 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:12" (1/1) ... [2022-12-14 10:39:12,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:12" (1/1) ... [2022-12-14 10:39:12,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 10:39:12,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 10:39:12,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 10:39:12,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 10:39:12,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:12" (1/1) ... [2022-12-14 10:39:12,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:39:12,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:39:12,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 10:39:12,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 10:39:12,754 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-14 10:39:12,755 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-14 10:39:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-14 10:39:12,755 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-14 10:39:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 10:39:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 10:39:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 10:39:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 10:39:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 10:39:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 10:39:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 10:39:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 10:39:12,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 10:39:12,757 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 10:39:12,871 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 10:39:12,872 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 10:39:13,184 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 10:39:13,192 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 10:39:13,193 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 10:39:13,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:39:13 BoogieIcfgContainer [2022-12-14 10:39:13,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 10:39:13,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 10:39:13,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 10:39:13,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 10:39:13,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 10:39:12" (1/3) ... [2022-12-14 10:39:13,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7edde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:39:13, skipping insertion in model container [2022-12-14 10:39:13,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:39:12" (2/3) ... [2022-12-14 10:39:13,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7edde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:39:13, skipping insertion in model container [2022-12-14 10:39:13,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:39:13" (3/3) ... [2022-12-14 10:39:13,202 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2022-12-14 10:39:13,208 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 10:39:13,216 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 10:39:13,216 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-12-14 10:39:13,217 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 10:39:13,298 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 10:39:13,325 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 10:39:13,337 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 297 places, 305 transitions, 626 flow [2022-12-14 10:39:13,339 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 297 places, 305 transitions, 626 flow [2022-12-14 10:39:13,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 305 transitions, 626 flow [2022-12-14 10:39:13,419 INFO L130 PetriNetUnfolder]: 15/303 cut-off events. [2022-12-14 10:39:13,419 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 10:39:13,425 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 471 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-12-14 10:39:13,432 INFO L119 LiptonReduction]: Number of co-enabled transitions 23276 [2022-12-14 10:39:20,974 INFO L134 LiptonReduction]: Checked pairs total: 50834 [2022-12-14 10:39:20,974 INFO L136 LiptonReduction]: Total number of compositions: 293 [2022-12-14 10:39:20,982 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 80 transitions, 176 flow [2022-12-14 10:39:21,065 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-12-14 10:39:21,083 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 10:39:21,088 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;@64fb6634, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 10:39:21,089 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-12-14 10:39:21,095 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-12-14 10:39:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 10:39:21,100 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:21,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 10:39:21,101 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:21,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:21,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1281212597, now seen corresponding path program 1 times [2022-12-14 10:39:21,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:21,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535830409] [2022-12-14 10:39:21,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:21,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:22,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:22,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535830409] [2022-12-14 10:39:22,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535830409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:22,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:22,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:39:22,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362111471] [2022-12-14 10:39:22,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:22,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:39:22,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:22,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:39:22,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:39:22,545 INFO L87 Difference]: Start difference. First operand has 1882 states, 1792 states have (on average 2.8286830357142856) internal successors, (5069), 1881 states have internal predecessors, (5069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:24,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:24,419 INFO L93 Difference]: Finished difference Result 1880 states and 4939 transitions. [2022-12-14 10:39:24,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:39:24,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 10:39:24,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:24,438 INFO L225 Difference]: With dead ends: 1880 [2022-12-14 10:39:24,438 INFO L226 Difference]: Without dead ends: 1880 [2022-12-14 10:39:24,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 10:39:24,441 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:24,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 10:39:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-12-14 10:39:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1880. [2022-12-14 10:39:24,535 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-12-14 10:39:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 4939 transitions. [2022-12-14 10:39:24,542 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 4939 transitions. Word has length 6 [2022-12-14 10:39:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:24,543 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 4939 transitions. [2022-12-14 10:39:24,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 4939 transitions. [2022-12-14 10:39:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 10:39:24,543 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:24,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:39:24,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 10:39:24,544 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:24,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:24,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1062887374, now seen corresponding path program 1 times [2022-12-14 10:39:24,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:24,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26240089] [2022-12-14 10:39:24,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:24,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:24,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:24,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26240089] [2022-12-14 10:39:24,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26240089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:24,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:24,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:39:24,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450741131] [2022-12-14 10:39:24,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:24,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 10:39:24,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:24,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 10:39:24,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:39:24,960 INFO L87 Difference]: Start difference. First operand 1880 states and 4939 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:25,345 INFO L93 Difference]: Finished difference Result 1994 states and 5235 transitions. [2022-12-14 10:39:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:39:25,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 10:39:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:25,357 INFO L225 Difference]: With dead ends: 1994 [2022-12-14 10:39:25,357 INFO L226 Difference]: Without dead ends: 1994 [2022-12-14 10:39:25,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 10:39:25,358 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 81 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:25,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 31 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:39:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2022-12-14 10:39:25,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1970. [2022-12-14 10:39:25,406 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-12-14 10:39:25,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 5173 transitions. [2022-12-14 10:39:25,412 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 5173 transitions. Word has length 7 [2022-12-14 10:39:25,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:25,412 INFO L495 AbstractCegarLoop]: Abstraction has 1970 states and 5173 transitions. [2022-12-14 10:39:25,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:25,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 5173 transitions. [2022-12-14 10:39:25,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 10:39:25,413 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:25,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:39:25,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 10:39:25,413 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:25,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:25,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1742120641, now seen corresponding path program 1 times [2022-12-14 10:39:25,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:25,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446990434] [2022-12-14 10:39:25,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:25,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:25,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:25,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446990434] [2022-12-14 10:39:25,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446990434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:25,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:25,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:39:25,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570417709] [2022-12-14 10:39:25,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:25,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:39:25,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:25,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:39:25,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:39:25,447 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-12-14 10:39:25,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:25,597 INFO L93 Difference]: Finished difference Result 3434 states and 9083 transitions. [2022-12-14 10:39:25,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:39:25,598 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-12-14 10:39:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:25,609 INFO L225 Difference]: With dead ends: 3434 [2022-12-14 10:39:25,610 INFO L226 Difference]: Without dead ends: 3434 [2022-12-14 10:39:25,610 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-12-14 10:39:25,611 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 63 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:25,611 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.1s Time] [2022-12-14 10:39:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2022-12-14 10:39:25,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3114. [2022-12-14 10:39:25,666 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-12-14 10:39:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 8583 transitions. [2022-12-14 10:39:25,675 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 8583 transitions. Word has length 8 [2022-12-14 10:39:25,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:25,676 INFO L495 AbstractCegarLoop]: Abstraction has 3114 states and 8583 transitions. [2022-12-14 10:39:25,676 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-12-14 10:39:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 8583 transitions. [2022-12-14 10:39:25,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:39:25,676 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:25,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:39:25,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 10:39:25,677 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:25,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:25,677 INFO L85 PathProgramCache]: Analyzing trace with hash -774272492, now seen corresponding path program 1 times [2022-12-14 10:39:25,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:25,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083500096] [2022-12-14 10:39:25,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:25,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:26,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-12-14 10:39:26,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:26,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083500096] [2022-12-14 10:39:26,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083500096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:26,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:26,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:39:26,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473971120] [2022-12-14 10:39:26,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:26,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:39:26,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:26,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:39:26,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:39:26,172 INFO L87 Difference]: Start difference. First operand 3114 states and 8583 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:27,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:27,178 INFO L93 Difference]: Finished difference Result 3111 states and 8576 transitions. [2022-12-14 10:39:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:39:27,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 10:39:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:27,189 INFO L225 Difference]: With dead ends: 3111 [2022-12-14 10:39:27,189 INFO L226 Difference]: Without dead ends: 3111 [2022-12-14 10:39:27,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 10:39:27,190 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:27,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 10:39:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2022-12-14 10:39:27,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 3111. [2022-12-14 10:39:27,239 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-12-14 10:39:27,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 8576 transitions. [2022-12-14 10:39:27,246 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 8576 transitions. Word has length 9 [2022-12-14 10:39:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:27,246 INFO L495 AbstractCegarLoop]: Abstraction has 3111 states and 8576 transitions. [2022-12-14 10:39:27,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 8576 transitions. [2022-12-14 10:39:27,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:39:27,247 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:27,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:39:27,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 10:39:27,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:27,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:27,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1824752360, now seen corresponding path program 1 times [2022-12-14 10:39:27,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:27,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967172256] [2022-12-14 10:39:27,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:27,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:27,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:27,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967172256] [2022-12-14 10:39:27,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967172256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:27,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:27,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:39:27,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059449818] [2022-12-14 10:39:27,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:27,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:39:27,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:27,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:39:27,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:39:27,300 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-12-14 10:39:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:27,402 INFO L93 Difference]: Finished difference Result 2873 states and 7689 transitions. [2022-12-14 10:39:27,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:39:27,402 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-12-14 10:39:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:27,416 INFO L225 Difference]: With dead ends: 2873 [2022-12-14 10:39:27,416 INFO L226 Difference]: Without dead ends: 2865 [2022-12-14 10:39:27,417 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-12-14 10:39:27,417 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-12-14 10:39:27,418 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-12-14 10:39:27,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2022-12-14 10:39:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2705. [2022-12-14 10:39:27,468 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-12-14 10:39:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 7441 transitions. [2022-12-14 10:39:27,473 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 7441 transitions. Word has length 9 [2022-12-14 10:39:27,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:27,473 INFO L495 AbstractCegarLoop]: Abstraction has 2705 states and 7441 transitions. [2022-12-14 10:39:27,473 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-12-14 10:39:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 7441 transitions. [2022-12-14 10:39:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 10:39:27,474 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:27,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:39:27,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 10:39:27,474 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:27,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:27,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1767358995, now seen corresponding path program 1 times [2022-12-14 10:39:27,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:27,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270688872] [2022-12-14 10:39:27,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:27,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:27,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:27,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270688872] [2022-12-14 10:39:27,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270688872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:27,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:27,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:39:27,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074409136] [2022-12-14 10:39:27,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:27,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 10:39:27,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:27,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 10:39:27,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:39:27,835 INFO L87 Difference]: Start difference. First operand 2705 states and 7441 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:28,079 INFO L93 Difference]: Finished difference Result 2634 states and 7232 transitions. [2022-12-14 10:39:28,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:39:28,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 10:39:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:28,087 INFO L225 Difference]: With dead ends: 2634 [2022-12-14 10:39:28,087 INFO L226 Difference]: Without dead ends: 2634 [2022-12-14 10:39:28,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 10:39:28,088 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 81 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:28,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 25 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:39:28,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2022-12-14 10:39:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2634. [2022-12-14 10:39:28,126 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-12-14 10:39:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 7232 transitions. [2022-12-14 10:39:28,140 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 7232 transitions. Word has length 10 [2022-12-14 10:39:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:28,141 INFO L495 AbstractCegarLoop]: Abstraction has 2634 states and 7232 transitions. [2022-12-14 10:39:28,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 7232 transitions. [2022-12-14 10:39:28,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 10:39:28,142 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:28,142 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:39:28,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 10:39:28,142 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:28,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:28,143 INFO L85 PathProgramCache]: Analyzing trace with hash 875153288, now seen corresponding path program 1 times [2022-12-14 10:39:28,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:28,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846731789] [2022-12-14 10:39:28,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:28,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:28,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:28,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846731789] [2022-12-14 10:39:28,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846731789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:28,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:28,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:39:28,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341969699] [2022-12-14 10:39:28,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:28,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:39:28,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:28,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:39:28,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:39:28,173 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-12-14 10:39:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:28,275 INFO L93 Difference]: Finished difference Result 2562 states and 7001 transitions. [2022-12-14 10:39:28,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:39:28,275 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-12-14 10:39:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:28,282 INFO L225 Difference]: With dead ends: 2562 [2022-12-14 10:39:28,282 INFO L226 Difference]: Without dead ends: 2562 [2022-12-14 10:39:28,282 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-12-14 10:39:28,283 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 59 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:28,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 14 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:39:28,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2022-12-14 10:39:28,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2562. [2022-12-14 10:39:28,317 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-12-14 10:39:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 7001 transitions. [2022-12-14 10:39:28,323 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 7001 transitions. Word has length 11 [2022-12-14 10:39:28,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:28,323 INFO L495 AbstractCegarLoop]: Abstraction has 2562 states and 7001 transitions. [2022-12-14 10:39:28,323 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-12-14 10:39:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 7001 transitions. [2022-12-14 10:39:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 10:39:28,324 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:28,324 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:39:28,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 10:39:28,324 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:28,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:28,324 INFO L85 PathProgramCache]: Analyzing trace with hash 875153424, now seen corresponding path program 1 times [2022-12-14 10:39:28,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:28,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309245585] [2022-12-14 10:39:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:39:28,347 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:28,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309245585] [2022-12-14 10:39:28,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309245585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:28,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:28,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:39:28,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864723296] [2022-12-14 10:39:28,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:28,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:39:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:28,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:39:28,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:39:28,348 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-12-14 10:39:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:28,455 INFO L93 Difference]: Finished difference Result 2490 states and 6770 transitions. [2022-12-14 10:39:28,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:39:28,455 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-12-14 10:39:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:28,461 INFO L225 Difference]: With dead ends: 2490 [2022-12-14 10:39:28,461 INFO L226 Difference]: Without dead ends: 2420 [2022-12-14 10:39:28,461 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-12-14 10:39:28,462 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:28,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 14 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:39:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2022-12-14 10:39:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1576. [2022-12-14 10:39:28,486 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-12-14 10:39:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 4231 transitions. [2022-12-14 10:39:28,489 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 4231 transitions. Word has length 11 [2022-12-14 10:39:28,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:28,490 INFO L495 AbstractCegarLoop]: Abstraction has 1576 states and 4231 transitions. [2022-12-14 10:39:28,490 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-12-14 10:39:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 4231 transitions. [2022-12-14 10:39:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 10:39:28,490 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:28,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:39:28,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 10:39:28,491 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:28,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:28,491 INFO L85 PathProgramCache]: Analyzing trace with hash 676618660, now seen corresponding path program 1 times [2022-12-14 10:39:28,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:28,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044673815] [2022-12-14 10:39:28,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:28,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:28,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:28,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044673815] [2022-12-14 10:39:28,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044673815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:28,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:28,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:39:28,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864822455] [2022-12-14 10:39:28,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:28,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:39:28,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:39:28,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:39:28,521 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-12-14 10:39:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:28,619 INFO L93 Difference]: Finished difference Result 1948 states and 5225 transitions. [2022-12-14 10:39:28,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:39:28,619 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-12-14 10:39:28,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:28,623 INFO L225 Difference]: With dead ends: 1948 [2022-12-14 10:39:28,623 INFO L226 Difference]: Without dead ends: 1948 [2022-12-14 10:39:28,624 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-12-14 10:39:28,624 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-12-14 10:39:28,624 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-12-14 10:39:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2022-12-14 10:39:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1884. [2022-12-14 10:39:28,651 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-12-14 10:39:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 5125 transitions. [2022-12-14 10:39:28,654 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 5125 transitions. Word has length 17 [2022-12-14 10:39:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:28,654 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 5125 transitions. [2022-12-14 10:39:28,655 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-12-14 10:39:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 5125 transitions. [2022-12-14 10:39:28,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 10:39:28,655 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:28,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:39:28,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 10:39:28,656 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:28,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:28,656 INFO L85 PathProgramCache]: Analyzing trace with hash -502483707, now seen corresponding path program 1 times [2022-12-14 10:39:28,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:28,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508298836] [2022-12-14 10:39:28,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:28,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:29,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:29,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508298836] [2022-12-14 10:39:29,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508298836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:29,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:29,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 10:39:29,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952950899] [2022-12-14 10:39:29,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:29,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 10:39:29,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:29,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 10:39:29,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-14 10:39:29,399 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-12-14 10:39:30,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:30,040 INFO L93 Difference]: Finished difference Result 2359 states and 6367 transitions. [2022-12-14 10:39:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:39:30,040 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-12-14 10:39:30,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:30,045 INFO L225 Difference]: With dead ends: 2359 [2022-12-14 10:39:30,045 INFO L226 Difference]: Without dead ends: 2359 [2022-12-14 10:39:30,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-12-14 10:39:30,046 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 123 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:30,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 94 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 10:39:30,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2022-12-14 10:39:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2183. [2022-12-14 10:39:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 2131 states have (on average 2.8118254340685125) internal successors, (5992), 2182 states have internal predecessors, (5992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 5992 transitions. [2022-12-14 10:39:30,086 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 5992 transitions. Word has length 18 [2022-12-14 10:39:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:30,086 INFO L495 AbstractCegarLoop]: Abstraction has 2183 states and 5992 transitions. [2022-12-14 10:39:30,086 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-12-14 10:39:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 5992 transitions. [2022-12-14 10:39:30,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 10:39:30,087 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:30,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:39:30,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 10:39:30,087 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:30,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:30,087 INFO L85 PathProgramCache]: Analyzing trace with hash -502483670, now seen corresponding path program 1 times [2022-12-14 10:39:30,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:30,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45967460] [2022-12-14 10:39:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:30,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:31,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:31,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45967460] [2022-12-14 10:39:31,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45967460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:31,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:31,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 10:39:31,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436476744] [2022-12-14 10:39:31,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:31,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 10:39:31,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:31,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 10:39:31,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-14 10:39:31,149 INFO L87 Difference]: Start difference. First operand 2183 states and 5992 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:31,674 INFO L93 Difference]: Finished difference Result 2233 states and 6073 transitions. [2022-12-14 10:39:31,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 10:39:31,675 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 10:39:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:31,680 INFO L225 Difference]: With dead ends: 2233 [2022-12-14 10:39:31,680 INFO L226 Difference]: Without dead ends: 2233 [2022-12-14 10:39:31,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2022-12-14 10:39:31,680 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 55 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:31,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 39 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:39:31,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2022-12-14 10:39:31,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2182. [2022-12-14 10:39:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2130 states have (on average 2.811737089201878) internal successors, (5989), 2181 states have internal predecessors, (5989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 5989 transitions. [2022-12-14 10:39:31,711 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 5989 transitions. Word has length 18 [2022-12-14 10:39:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:31,711 INFO L495 AbstractCegarLoop]: Abstraction has 2182 states and 5989 transitions. [2022-12-14 10:39:31,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 5989 transitions. [2022-12-14 10:39:31,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 10:39:31,712 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:31,712 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-12-14 10:39:31,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 10:39:31,713 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:31,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:31,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1702659138, now seen corresponding path program 1 times [2022-12-14 10:39:31,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:31,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907449494] [2022-12-14 10:39:31,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:31,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:32,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:32,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907449494] [2022-12-14 10:39:32,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907449494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:32,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:32,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 10:39:32,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488654949] [2022-12-14 10:39:32,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:32,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 10:39:32,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:32,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 10:39:32,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-14 10:39:32,343 INFO L87 Difference]: Start difference. First operand 2182 states and 5989 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-12-14 10:39:33,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:33,011 INFO L93 Difference]: Finished difference Result 2428 states and 6611 transitions. [2022-12-14 10:39:33,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 10:39:33,012 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-12-14 10:39:33,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:33,016 INFO L225 Difference]: With dead ends: 2428 [2022-12-14 10:39:33,017 INFO L226 Difference]: Without dead ends: 2428 [2022-12-14 10:39:33,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2022-12-14 10:39:33,017 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 194 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:33,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 93 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 10:39:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2022-12-14 10:39:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2002. [2022-12-14 10:39:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 1950 states have (on average 2.812820512820513) internal successors, (5485), 2001 states have internal predecessors, (5485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 5485 transitions. [2022-12-14 10:39:33,047 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 5485 transitions. Word has length 19 [2022-12-14 10:39:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:33,048 INFO L495 AbstractCegarLoop]: Abstraction has 2002 states and 5485 transitions. [2022-12-14 10:39:33,048 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-12-14 10:39:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 5485 transitions. [2022-12-14 10:39:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 10:39:33,048 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:33,048 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-12-14 10:39:33,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 10:39:33,049 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:33,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:33,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1702659175, now seen corresponding path program 1 times [2022-12-14 10:39:33,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:33,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669905716] [2022-12-14 10:39:33,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:33,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:34,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:34,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669905716] [2022-12-14 10:39:34,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669905716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:34,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:34,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 10:39:34,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639805484] [2022-12-14 10:39:34,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:34,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 10:39:34,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:34,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 10:39:34,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-12-14 10:39:34,134 INFO L87 Difference]: Start difference. First operand 2002 states and 5485 transitions. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:34,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:34,858 INFO L93 Difference]: Finished difference Result 2077 states and 5627 transitions. [2022-12-14 10:39:34,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 10:39:34,858 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 10:39:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:34,861 INFO L225 Difference]: With dead ends: 2077 [2022-12-14 10:39:34,861 INFO L226 Difference]: Without dead ends: 2077 [2022-12-14 10:39:34,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2022-12-14 10:39:34,862 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 222 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:34,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 83 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:39:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2022-12-14 10:39:34,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2002. [2022-12-14 10:39:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 1950 states have (on average 2.7974358974358973) internal successors, (5455), 2001 states have internal predecessors, (5455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 5455 transitions. [2022-12-14 10:39:34,887 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 5455 transitions. Word has length 19 [2022-12-14 10:39:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:34,887 INFO L495 AbstractCegarLoop]: Abstraction has 2002 states and 5455 transitions. [2022-12-14 10:39:34,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:34,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 5455 transitions. [2022-12-14 10:39:34,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 10:39:34,888 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:34,888 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-12-14 10:39:34,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 10:39:34,888 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:34,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:34,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1602877578, now seen corresponding path program 2 times [2022-12-14 10:39:34,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:34,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241051480] [2022-12-14 10:39:34,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:34,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:35,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:35,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241051480] [2022-12-14 10:39:35,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241051480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:35,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:35,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 10:39:35,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256360384] [2022-12-14 10:39:35,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:35,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 10:39:35,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:35,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 10:39:35,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-12-14 10:39:35,579 INFO L87 Difference]: Start difference. First operand 2002 states and 5455 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-12-14 10:39:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:36,350 INFO L93 Difference]: Finished difference Result 2108 states and 5640 transitions. [2022-12-14 10:39:36,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 10:39:36,351 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-12-14 10:39:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:36,354 INFO L225 Difference]: With dead ends: 2108 [2022-12-14 10:39:36,354 INFO L226 Difference]: Without dead ends: 2108 [2022-12-14 10:39:36,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-12-14 10:39:36,354 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 223 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:36,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 99 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 10:39:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2022-12-14 10:39:36,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2017. [2022-12-14 10:39:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1965 states have (on average 2.7918575063613233) internal successors, (5486), 2016 states have internal predecessors, (5486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 5486 transitions. [2022-12-14 10:39:36,378 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 5486 transitions. Word has length 19 [2022-12-14 10:39:36,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:36,378 INFO L495 AbstractCegarLoop]: Abstraction has 2017 states and 5486 transitions. [2022-12-14 10:39:36,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:36,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 5486 transitions. [2022-12-14 10:39:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 10:39:36,379 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:36,379 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-12-14 10:39:36,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 10:39:36,379 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:36,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1602877615, now seen corresponding path program 2 times [2022-12-14 10:39:36,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:36,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930718063] [2022-12-14 10:39:36,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:36,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:37,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:37,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930718063] [2022-12-14 10:39:37,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930718063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:37,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:37,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 10:39:37,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622801755] [2022-12-14 10:39:37,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:37,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 10:39:37,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:37,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 10:39:37,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-12-14 10:39:37,086 INFO L87 Difference]: Start difference. First operand 2017 states and 5486 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-12-14 10:39:37,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:37,779 INFO L93 Difference]: Finished difference Result 2093 states and 5586 transitions. [2022-12-14 10:39:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 10:39:37,779 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-12-14 10:39:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:37,782 INFO L225 Difference]: With dead ends: 2093 [2022-12-14 10:39:37,782 INFO L226 Difference]: Without dead ends: 2093 [2022-12-14 10:39:37,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-12-14 10:39:37,783 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 313 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:37,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 82 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 10:39:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2022-12-14 10:39:37,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1952. [2022-12-14 10:39:37,805 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-12-14 10:39:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 5291 transitions. [2022-12-14 10:39:37,808 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 5291 transitions. Word has length 19 [2022-12-14 10:39:37,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:37,809 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 5291 transitions. [2022-12-14 10:39:37,809 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-12-14 10:39:37,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 5291 transitions. [2022-12-14 10:39:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 10:39:37,809 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:37,810 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:39:37,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 10:39:37,810 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:37,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:37,810 INFO L85 PathProgramCache]: Analyzing trace with hash 870247718, now seen corresponding path program 1 times [2022-12-14 10:39:37,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:37,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12257013] [2022-12-14 10:39:37,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:37,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:37,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:37,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12257013] [2022-12-14 10:39:37,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12257013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:37,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:37,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:39:37,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449703808] [2022-12-14 10:39:37,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:37,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:39:37,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:37,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:39:37,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:39:37,846 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-12-14 10:39:37,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:37,938 INFO L93 Difference]: Finished difference Result 1832 states and 4965 transitions. [2022-12-14 10:39:37,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:39:37,938 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-12-14 10:39:37,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:37,941 INFO L225 Difference]: With dead ends: 1832 [2022-12-14 10:39:37,941 INFO L226 Difference]: Without dead ends: 1832 [2022-12-14 10:39:37,941 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-12-14 10:39:37,942 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:37,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 8 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:39:37,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2022-12-14 10:39:37,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1832. [2022-12-14 10:39:37,969 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-12-14 10:39:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 4965 transitions. [2022-12-14 10:39:37,971 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 4965 transitions. Word has length 20 [2022-12-14 10:39:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:37,972 INFO L495 AbstractCegarLoop]: Abstraction has 1832 states and 4965 transitions. [2022-12-14 10:39:37,972 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-12-14 10:39:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 4965 transitions. [2022-12-14 10:39:37,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 10:39:37,972 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:37,972 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:39:37,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 10:39:37,973 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:37,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:37,973 INFO L85 PathProgramCache]: Analyzing trace with hash 870247822, now seen corresponding path program 1 times [2022-12-14 10:39:37,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:37,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267148685] [2022-12-14 10:39:37,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:37,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:39:38,001 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:38,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267148685] [2022-12-14 10:39:38,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267148685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:38,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:38,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:39:38,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726613692] [2022-12-14 10:39:38,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:38,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:39:38,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:38,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:39:38,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:39:38,002 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-12-14 10:39:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:38,106 INFO L93 Difference]: Finished difference Result 1712 states and 4639 transitions. [2022-12-14 10:39:38,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:39:38,106 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-12-14 10:39:38,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:38,109 INFO L225 Difference]: With dead ends: 1712 [2022-12-14 10:39:38,109 INFO L226 Difference]: Without dead ends: 1712 [2022-12-14 10:39:38,109 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-12-14 10:39:38,110 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:38,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 9 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:39:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-12-14 10:39:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1384. [2022-12-14 10:39:38,132 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-12-14 10:39:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3727 transitions. [2022-12-14 10:39:38,135 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 3727 transitions. Word has length 20 [2022-12-14 10:39:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:38,135 INFO L495 AbstractCegarLoop]: Abstraction has 1384 states and 3727 transitions. [2022-12-14 10:39:38,136 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-12-14 10:39:38,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 3727 transitions. [2022-12-14 10:39:38,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 10:39:38,136 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:38,136 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-12-14 10:39:38,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 10:39:38,136 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:38,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1528899927, now seen corresponding path program 1 times [2022-12-14 10:39:38,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:38,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281504521] [2022-12-14 10:39:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:38,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:38,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:38,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281504521] [2022-12-14 10:39:38,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281504521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:38,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:38,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 10:39:38,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538814373] [2022-12-14 10:39:38,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:38,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 10:39:38,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:38,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 10:39:38,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-14 10:39:38,412 INFO L87 Difference]: Start difference. First operand 1384 states and 3727 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-12-14 10:39:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:38,874 INFO L93 Difference]: Finished difference Result 3136 states and 8498 transitions. [2022-12-14 10:39:38,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 10:39:38,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-12-14 10:39:38,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:38,879 INFO L225 Difference]: With dead ends: 3136 [2022-12-14 10:39:38,879 INFO L226 Difference]: Without dead ends: 3136 [2022-12-14 10:39:38,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-12-14 10:39:38,880 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 511 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:38,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 46 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:39:38,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2022-12-14 10:39:38,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 2214. [2022-12-14 10:39:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 2186 states have (on average 2.8536139066788655) internal successors, (6238), 2213 states have internal predecessors, (6238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 6238 transitions. [2022-12-14 10:39:38,911 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 6238 transitions. Word has length 21 [2022-12-14 10:39:38,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:38,911 INFO L495 AbstractCegarLoop]: Abstraction has 2214 states and 6238 transitions. [2022-12-14 10:39:38,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-12-14 10:39:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 6238 transitions. [2022-12-14 10:39:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 10:39:38,912 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:38,912 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-12-14 10:39:38,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 10:39:38,913 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:38,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1528899926, now seen corresponding path program 1 times [2022-12-14 10:39:38,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:38,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703622457] [2022-12-14 10:39:38,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:38,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:39,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:39,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703622457] [2022-12-14 10:39:39,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703622457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:39,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:39,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 10:39:39,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688211221] [2022-12-14 10:39:39,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:39,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 10:39:39,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:39,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 10:39:39,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-14 10:39:39,362 INFO L87 Difference]: Start difference. First operand 2214 states and 6238 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:39,678 INFO L93 Difference]: Finished difference Result 2485 states and 6911 transitions. [2022-12-14 10:39:39,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:39:39,678 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 10:39:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:39,682 INFO L225 Difference]: With dead ends: 2485 [2022-12-14 10:39:39,682 INFO L226 Difference]: Without dead ends: 2485 [2022-12-14 10:39:39,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2022-12-14 10:39:39,682 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 128 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:39,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 58 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:39:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2022-12-14 10:39:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2419. [2022-12-14 10:39:39,709 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-12-14 10:39:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 6788 transitions. [2022-12-14 10:39:39,713 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 6788 transitions. Word has length 21 [2022-12-14 10:39:39,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:39,713 INFO L495 AbstractCegarLoop]: Abstraction has 2419 states and 6788 transitions. [2022-12-14 10:39:39,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:39,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 6788 transitions. [2022-12-14 10:39:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 10:39:39,714 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:39,714 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-12-14 10:39:39,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 10:39:39,714 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:39,715 INFO L85 PathProgramCache]: Analyzing trace with hash 356803148, now seen corresponding path program 1 times [2022-12-14 10:39:39,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:39,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895393896] [2022-12-14 10:39:39,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:39,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:40,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:40,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895393896] [2022-12-14 10:39:40,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895393896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:40,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:40,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 10:39:40,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060093218] [2022-12-14 10:39:40,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:40,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 10:39:40,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:40,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 10:39:40,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-12-14 10:39:40,227 INFO L87 Difference]: Start difference. First operand 2419 states and 6788 transitions. Second operand has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:40,736 INFO L93 Difference]: Finished difference Result 2641 states and 7366 transitions. [2022-12-14 10:39:40,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 10:39:40,736 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 10:39:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:40,740 INFO L225 Difference]: With dead ends: 2641 [2022-12-14 10:39:40,740 INFO L226 Difference]: Without dead ends: 2641 [2022-12-14 10:39:40,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-12-14 10:39:40,741 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 149 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:40,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 82 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:39:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2022-12-14 10:39:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 2299. [2022-12-14 10:39:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2299 states, 2271 states have (on average 2.845002201673272) internal successors, (6461), 2298 states have internal predecessors, (6461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 6461 transitions. [2022-12-14 10:39:40,768 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 6461 transitions. Word has length 22 [2022-12-14 10:39:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:40,768 INFO L495 AbstractCegarLoop]: Abstraction has 2299 states and 6461 transitions. [2022-12-14 10:39:40,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 6461 transitions. [2022-12-14 10:39:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 10:39:40,769 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:40,769 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-12-14 10:39:40,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 10:39:40,769 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash 356803149, now seen corresponding path program 1 times [2022-12-14 10:39:40,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:40,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267872618] [2022-12-14 10:39:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:40,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:41,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:41,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267872618] [2022-12-14 10:39:41,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267872618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:41,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:41,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 10:39:41,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873769737] [2022-12-14 10:39:41,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:41,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 10:39:41,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:41,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 10:39:41,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-12-14 10:39:41,271 INFO L87 Difference]: Start difference. First operand 2299 states and 6461 transitions. Second operand has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:41,801 INFO L93 Difference]: Finished difference Result 2410 states and 6688 transitions. [2022-12-14 10:39:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 10:39:41,801 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 10:39:41,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:41,805 INFO L225 Difference]: With dead ends: 2410 [2022-12-14 10:39:41,805 INFO L226 Difference]: Without dead ends: 2410 [2022-12-14 10:39:41,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2022-12-14 10:39:41,806 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 173 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:41,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 64 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:39:41,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2022-12-14 10:39:41,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2119. [2022-12-14 10:39:41,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 2091 states have (on average 2.852702056432329) internal successors, (5965), 2118 states have internal predecessors, (5965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 5965 transitions. [2022-12-14 10:39:41,834 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 5965 transitions. Word has length 22 [2022-12-14 10:39:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:41,834 INFO L495 AbstractCegarLoop]: Abstraction has 2119 states and 5965 transitions. [2022-12-14 10:39:41,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 5965 transitions. [2022-12-14 10:39:41,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 10:39:41,835 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:41,835 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-12-14 10:39:41,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 10:39:41,835 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:41,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:41,835 INFO L85 PathProgramCache]: Analyzing trace with hash -151254200, now seen corresponding path program 2 times [2022-12-14 10:39:41,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:41,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866966292] [2022-12-14 10:39:41,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:41,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:42,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:42,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866966292] [2022-12-14 10:39:42,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866966292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:42,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:42,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 10:39:42,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092754199] [2022-12-14 10:39:42,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:42,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 10:39:42,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:42,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 10:39:42,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-14 10:39:42,209 INFO L87 Difference]: Start difference. First operand 2119 states and 5965 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-12-14 10:39:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:42,798 INFO L93 Difference]: Finished difference Result 3238 states and 8921 transitions. [2022-12-14 10:39:42,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 10:39:42,798 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-12-14 10:39:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:42,803 INFO L225 Difference]: With dead ends: 3238 [2022-12-14 10:39:42,803 INFO L226 Difference]: Without dead ends: 3238 [2022-12-14 10:39:42,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-12-14 10:39:42,803 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 504 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:42,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 53 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:39:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3238 states. [2022-12-14 10:39:42,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3238 to 2114. [2022-12-14 10:39:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 2086 states have (on average 2.8528283796740173) internal successors, (5951), 2113 states have internal predecessors, (5951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 5951 transitions. [2022-12-14 10:39:42,832 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 5951 transitions. Word has length 22 [2022-12-14 10:39:42,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:42,832 INFO L495 AbstractCegarLoop]: Abstraction has 2114 states and 5951 transitions. [2022-12-14 10:39:42,832 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-12-14 10:39:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 5951 transitions. [2022-12-14 10:39:42,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 10:39:42,833 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:42,833 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-12-14 10:39:42,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 10:39:42,833 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:42,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:42,833 INFO L85 PathProgramCache]: Analyzing trace with hash -151254199, now seen corresponding path program 2 times [2022-12-14 10:39:42,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:42,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866705018] [2022-12-14 10:39:42,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:42,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:43,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:43,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866705018] [2022-12-14 10:39:43,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866705018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:43,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:43,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 10:39:43,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309144296] [2022-12-14 10:39:43,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:43,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 10:39:43,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:43,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 10:39:43,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-12-14 10:39:43,461 INFO L87 Difference]: Start difference. First operand 2114 states and 5951 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-12-14 10:39:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:44,113 INFO L93 Difference]: Finished difference Result 2205 states and 6126 transitions. [2022-12-14 10:39:44,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:39:44,113 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-12-14 10:39:44,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:44,116 INFO L225 Difference]: With dead ends: 2205 [2022-12-14 10:39:44,116 INFO L226 Difference]: Without dead ends: 2205 [2022-12-14 10:39:44,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2022-12-14 10:39:44,117 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 144 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:44,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 106 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 10:39:44,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2022-12-14 10:39:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2044. [2022-12-14 10:39:44,140 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-12-14 10:39:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 5756 transitions. [2022-12-14 10:39:44,143 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 5756 transitions. Word has length 22 [2022-12-14 10:39:44,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:44,144 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 5756 transitions. [2022-12-14 10:39:44,144 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-12-14 10:39:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 5756 transitions. [2022-12-14 10:39:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 10:39:44,144 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:44,144 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-12-14 10:39:44,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 10:39:44,145 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:44,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:44,145 INFO L85 PathProgramCache]: Analyzing trace with hash -974875033, now seen corresponding path program 1 times [2022-12-14 10:39:44,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:44,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222964784] [2022-12-14 10:39:44,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:44,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:44,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:44,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222964784] [2022-12-14 10:39:44,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222964784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:44,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:44,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:39:44,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042558457] [2022-12-14 10:39:44,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:44,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:39:44,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:44,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:39:44,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:39:44,190 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-12-14 10:39:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:44,265 INFO L93 Difference]: Finished difference Result 886 states and 2306 transitions. [2022-12-14 10:39:44,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:39:44,265 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-12-14 10:39:44,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:44,267 INFO L225 Difference]: With dead ends: 886 [2022-12-14 10:39:44,267 INFO L226 Difference]: Without dead ends: 812 [2022-12-14 10:39:44,267 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-12-14 10:39:44,268 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-12-14 10:39:44,268 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-12-14 10:39:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-12-14 10:39:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 658. [2022-12-14 10:39:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 642 states have (on average 2.5576323987538943) internal successors, (1642), 657 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1642 transitions. [2022-12-14 10:39:44,276 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1642 transitions. Word has length 31 [2022-12-14 10:39:44,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:44,276 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 1642 transitions. [2022-12-14 10:39:44,276 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-12-14 10:39:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1642 transitions. [2022-12-14 10:39:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 10:39:44,277 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:44,277 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-12-14 10:39:44,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 10:39:44,277 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:44,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:44,277 INFO L85 PathProgramCache]: Analyzing trace with hash -841433234, now seen corresponding path program 1 times [2022-12-14 10:39:44,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:44,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249114768] [2022-12-14 10:39:44,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:44,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:44,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:44,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249114768] [2022-12-14 10:39:44,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249114768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:44,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:44,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:39:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761751787] [2022-12-14 10:39:44,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:44,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:39:44,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:44,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:39:44,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:39:44,326 INFO L87 Difference]: Start difference. First operand 658 states and 1642 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:44,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:44,400 INFO L93 Difference]: Finished difference Result 458 states and 1006 transitions. [2022-12-14 10:39:44,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:39:44,400 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-12-14 10:39:44,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:44,401 INFO L225 Difference]: With dead ends: 458 [2022-12-14 10:39:44,401 INFO L226 Difference]: Without dead ends: 440 [2022-12-14 10:39:44,401 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-12-14 10:39:44,402 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 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-12-14 10:39:44,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 4 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:39:44,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-12-14 10:39:44,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2022-12-14 10:39:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 432 states have (on average 2.2453703703703702) internal successors, (970), 439 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 970 transitions. [2022-12-14 10:39:44,408 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 970 transitions. Word has length 32 [2022-12-14 10:39:44,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:44,408 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 970 transitions. [2022-12-14 10:39:44,408 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-12-14 10:39:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 970 transitions. [2022-12-14 10:39:44,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 10:39:44,409 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:44,409 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-12-14 10:39:44,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 10:39:44,409 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:44,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1131581653, now seen corresponding path program 1 times [2022-12-14 10:39:44,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:44,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584317850] [2022-12-14 10:39:44,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:44,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:45,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:45,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584317850] [2022-12-14 10:39:45,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584317850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:45,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:45,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-14 10:39:45,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296342041] [2022-12-14 10:39:45,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:45,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 10:39:45,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:45,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 10:39:45,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-12-14 10:39:45,431 INFO L87 Difference]: Start difference. First operand 440 states and 970 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 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-12-14 10:39:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:46,479 INFO L93 Difference]: Finished difference Result 575 states and 1268 transitions. [2022-12-14 10:39:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 10:39:46,480 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 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-12-14 10:39:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:46,481 INFO L225 Difference]: With dead ends: 575 [2022-12-14 10:39:46,481 INFO L226 Difference]: Without dead ends: 575 [2022-12-14 10:39:46,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2022-12-14 10:39:46,481 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 164 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:46,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 89 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 10:39:46,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-12-14 10:39:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 554. [2022-12-14 10:39:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 546 states have (on average 2.2564102564102564) internal successors, (1232), 553 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1232 transitions. [2022-12-14 10:39:46,487 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1232 transitions. Word has length 33 [2022-12-14 10:39:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:46,487 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 1232 transitions. [2022-12-14 10:39:46,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 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-12-14 10:39:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1232 transitions. [2022-12-14 10:39:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 10:39:46,488 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:46,489 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-12-14 10:39:46,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-14 10:39:46,489 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:46,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:46,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1131581549, now seen corresponding path program 1 times [2022-12-14 10:39:46,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:46,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340147843] [2022-12-14 10:39:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:46,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:47,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:47,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340147843] [2022-12-14 10:39:47,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340147843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:47,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:47,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-14 10:39:47,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91377837] [2022-12-14 10:39:47,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:47,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 10:39:47,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:47,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 10:39:47,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-12-14 10:39:47,307 INFO L87 Difference]: Start difference. First operand 554 states and 1232 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 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-12-14 10:39:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:48,010 INFO L93 Difference]: Finished difference Result 567 states and 1251 transitions. [2022-12-14 10:39:48,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 10:39:48,010 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 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-12-14 10:39:48,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:48,011 INFO L225 Difference]: With dead ends: 567 [2022-12-14 10:39:48,011 INFO L226 Difference]: Without dead ends: 567 [2022-12-14 10:39:48,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=642, Unknown=0, NotChecked=0, Total=870 [2022-12-14 10:39:48,012 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 167 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:48,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 82 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 10:39:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-12-14 10:39:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 554. [2022-12-14 10:39:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 546 states have (on average 2.241758241758242) internal successors, (1224), 553 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:48,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1224 transitions. [2022-12-14 10:39:48,017 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1224 transitions. Word has length 33 [2022-12-14 10:39:48,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:48,017 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 1224 transitions. [2022-12-14 10:39:48,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 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-12-14 10:39:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1224 transitions. [2022-12-14 10:39:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 10:39:48,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:48,018 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-12-14 10:39:48,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 10:39:48,018 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:48,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1449575561, now seen corresponding path program 2 times [2022-12-14 10:39:48,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:48,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429748089] [2022-12-14 10:39:48,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:48,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:48,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:48,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429748089] [2022-12-14 10:39:48,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429748089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:48,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:48,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 10:39:48,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508412658] [2022-12-14 10:39:48,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:48,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 10:39:48,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:48,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 10:39:48,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-12-14 10:39:48,577 INFO L87 Difference]: Start difference. First operand 554 states and 1224 transitions. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 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-12-14 10:39:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:49,252 INFO L93 Difference]: Finished difference Result 630 states and 1392 transitions. [2022-12-14 10:39:49,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:39:49,252 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 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-12-14 10:39:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:49,253 INFO L225 Difference]: With dead ends: 630 [2022-12-14 10:39:49,253 INFO L226 Difference]: Without dead ends: 630 [2022-12-14 10:39:49,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2022-12-14 10:39:49,254 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 326 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:49,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 62 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:39:49,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-12-14 10:39:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 614. [2022-12-14 10:39:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 606 states have (on average 2.254125412541254) internal successors, (1366), 613 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1366 transitions. [2022-12-14 10:39:49,260 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1366 transitions. Word has length 33 [2022-12-14 10:39:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:49,260 INFO L495 AbstractCegarLoop]: Abstraction has 614 states and 1366 transitions. [2022-12-14 10:39:49,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 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-12-14 10:39:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1366 transitions. [2022-12-14 10:39:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 10:39:49,261 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:49,261 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-12-14 10:39:49,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-14 10:39:49,261 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:49,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:49,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1449575457, now seen corresponding path program 2 times [2022-12-14 10:39:49,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:49,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049851528] [2022-12-14 10:39:49,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:49,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:50,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:50,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049851528] [2022-12-14 10:39:50,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049851528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:50,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:50,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-14 10:39:50,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082719907] [2022-12-14 10:39:50,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:50,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 10:39:50,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:50,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 10:39:50,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-12-14 10:39:50,290 INFO L87 Difference]: Start difference. First operand 614 states and 1366 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:50,891 INFO L93 Difference]: Finished difference Result 622 states and 1375 transitions. [2022-12-14 10:39:50,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 10:39:50,891 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-12-14 10:39:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:50,892 INFO L225 Difference]: With dead ends: 622 [2022-12-14 10:39:50,892 INFO L226 Difference]: Without dead ends: 622 [2022-12-14 10:39:50,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2022-12-14 10:39:50,893 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 195 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:50,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 53 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:39:50,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-12-14 10:39:50,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 508. [2022-12-14 10:39:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 500 states have (on average 2.248) internal successors, (1124), 507 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1124 transitions. [2022-12-14 10:39:50,898 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1124 transitions. Word has length 33 [2022-12-14 10:39:50,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:50,898 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 1124 transitions. [2022-12-14 10:39:50,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1124 transitions. [2022-12-14 10:39:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 10:39:50,899 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:50,899 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-12-14 10:39:50,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-14 10:39:50,899 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:50,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash 250335073, now seen corresponding path program 1 times [2022-12-14 10:39:50,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:50,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586913304] [2022-12-14 10:39:50,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:50,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:39:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:39:51,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:39:51,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586913304] [2022-12-14 10:39:51,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586913304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:39:51,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:39:51,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 10:39:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478410999] [2022-12-14 10:39:51,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:39:51,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 10:39:51,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:39:51,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 10:39:51,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-12-14 10:39:51,772 INFO L87 Difference]: Start difference. First operand 508 states and 1124 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-12-14 10:39:52,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:39:52,177 INFO L93 Difference]: Finished difference Result 700 states and 1549 transitions. [2022-12-14 10:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 10:39:52,178 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-12-14 10:39:52,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:39:52,179 INFO L225 Difference]: With dead ends: 700 [2022-12-14 10:39:52,179 INFO L226 Difference]: Without dead ends: 700 [2022-12-14 10:39:52,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2022-12-14 10:39:52,180 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 166 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:39:52,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 60 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:39:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-12-14 10:39:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 638. [2022-12-14 10:39:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 630 states have (on average 2.249206349206349) internal successors, (1417), 637 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:39:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1417 transitions. [2022-12-14 10:39:52,186 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1417 transitions. Word has length 36 [2022-12-14 10:39:52,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:39:52,186 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 1417 transitions. [2022-12-14 10:39:52,186 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-12-14 10:39:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1417 transitions. [2022-12-14 10:39:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 10:39:52,186 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:39:52,187 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-12-14 10:39:52,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-14 10:39:52,187 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:39:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:39:52,187 INFO L85 PathProgramCache]: Analyzing trace with hash 250335107, now seen corresponding path program 1 times [2022-12-14 10:39:52,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:39:52,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930858967] [2022-12-14 10:39:52,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:39:52,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:39:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:40:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:40:05,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:40:05,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930858967] [2022-12-14 10:40:05,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930858967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:40:05,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:40:05,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-14 10:40:05,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816710207] [2022-12-14 10:40:05,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:40:05,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 10:40:05,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:40:05,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 10:40:05,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-12-14 10:40:05,362 INFO L87 Difference]: Start difference. First operand 638 states and 1417 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 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-12-14 10:40:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:40:22,302 INFO L93 Difference]: Finished difference Result 642 states and 1413 transitions. [2022-12-14 10:40:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:40:22,303 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 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-12-14 10:40:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:40:22,303 INFO L225 Difference]: With dead ends: 642 [2022-12-14 10:40:22,304 INFO L226 Difference]: Without dead ends: 601 [2022-12-14 10:40:22,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2022-12-14 10:40:22,304 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 187 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:40:22,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 49 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2022-12-14 10:40:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-12-14 10:40:22,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 597. [2022-12-14 10:40:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 589 states have (on average 2.229202037351443) internal successors, (1313), 596 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:40:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1313 transitions. [2022-12-14 10:40:22,310 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1313 transitions. Word has length 36 [2022-12-14 10:40:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:40:22,310 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 1313 transitions. [2022-12-14 10:40:22,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 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-12-14 10:40:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1313 transitions. [2022-12-14 10:40:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 10:40:22,311 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:40:22,311 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-12-14 10:40:22,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-14 10:40:22,311 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:40:22,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:40:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1591676821, now seen corresponding path program 2 times [2022-12-14 10:40:22,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:40:22,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108663192] [2022-12-14 10:40:22,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:40:22,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:40:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:40:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:40:23,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:40:23,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108663192] [2022-12-14 10:40:23,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108663192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:40:23,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:40:23,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 10:40:23,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991853662] [2022-12-14 10:40:23,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:40:23,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 10:40:23,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:40:23,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 10:40:23,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-12-14 10:40:23,324 INFO L87 Difference]: Start difference. First operand 597 states and 1313 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-12-14 10:40:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:40:23,897 INFO L93 Difference]: Finished difference Result 683 states and 1504 transitions. [2022-12-14 10:40:23,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 10:40:23,897 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-12-14 10:40:23,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:40:23,898 INFO L225 Difference]: With dead ends: 683 [2022-12-14 10:40:23,898 INFO L226 Difference]: Without dead ends: 683 [2022-12-14 10:40:23,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2022-12-14 10:40:23,899 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 132 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:40:23,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 59 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:40:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-12-14 10:40:23,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 621. [2022-12-14 10:40:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 613 states have (on average 2.238172920065253) internal successors, (1372), 620 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:40:23,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1372 transitions. [2022-12-14 10:40:23,905 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1372 transitions. Word has length 36 [2022-12-14 10:40:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:40:23,905 INFO L495 AbstractCegarLoop]: Abstraction has 621 states and 1372 transitions. [2022-12-14 10:40:23,905 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-12-14 10:40:23,905 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1372 transitions. [2022-12-14 10:40:23,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 10:40:23,905 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:40:23,905 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-12-14 10:40:23,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-14 10:40:23,905 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:40:23,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:40:23,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1591676855, now seen corresponding path program 2 times [2022-12-14 10:40:23,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:40:23,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8730557] [2022-12-14 10:40:23,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:40:23,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:40:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:40:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:40:24,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:40:24,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8730557] [2022-12-14 10:40:24,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8730557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:40:24,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:40:24,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 10:40:24,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962594355] [2022-12-14 10:40:24,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:40:24,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 10:40:24,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:40:24,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 10:40:24,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-12-14 10:40:24,871 INFO L87 Difference]: Start difference. First operand 621 states and 1372 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-12-14 10:40:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:40:25,391 INFO L93 Difference]: Finished difference Result 625 states and 1368 transitions. [2022-12-14 10:40:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 10:40:25,392 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-12-14 10:40:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:40:25,392 INFO L225 Difference]: With dead ends: 625 [2022-12-14 10:40:25,392 INFO L226 Difference]: Without dead ends: 583 [2022-12-14 10:40:25,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2022-12-14 10:40:25,393 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 150 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:40:25,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 46 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:40:25,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-12-14 10:40:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 490. [2022-12-14 10:40:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 482 states have (on average 2.2344398340248963) internal successors, (1077), 489 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:40:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1077 transitions. [2022-12-14 10:40:25,398 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1077 transitions. Word has length 36 [2022-12-14 10:40:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:40:25,398 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 1077 transitions. [2022-12-14 10:40:25,398 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-12-14 10:40:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1077 transitions. [2022-12-14 10:40:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 10:40:25,398 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:40:25,399 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-12-14 10:40:25,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-14 10:40:25,399 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:40:25,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:40:25,399 INFO L85 PathProgramCache]: Analyzing trace with hash -527647439, now seen corresponding path program 1 times [2022-12-14 10:40:25,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:40:25,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277384938] [2022-12-14 10:40:25,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:40:25,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:40:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:40:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:40:25,696 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:40:25,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277384938] [2022-12-14 10:40:25,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277384938] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:40:25,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214459888] [2022-12-14 10:40:25,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:40:25,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:40:25,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:40:25,697 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:40:25,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 10:40:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:40:25,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 122 conjunts are in the unsatisfiable core [2022-12-14 10:40:25,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:40:25,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:40:25,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:40:25,914 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 10:40:25,915 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-12-14 10:40:25,935 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 10:40:25,935 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-12-14 10:40:26,081 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-12-14 10:40:26,223 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 53 treesize of output 46 [2022-12-14 10:40:26,423 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 58 treesize of output 51 [2022-12-14 10:40:26,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:40:26,502 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 45 treesize of output 47 [2022-12-14 10:40:26,606 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 45 treesize of output 47 [2022-12-14 10:40:26,821 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 63 treesize of output 56 [2022-12-14 10:40:27,237 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 70 treesize of output 63 [2022-12-14 10:40:27,674 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 75 treesize of output 68 [2022-12-14 10:40:27,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:40:27,852 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 62 treesize of output 64 [2022-12-14 10:40:30,856 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 80 treesize of output 73 [2022-12-14 10:40:33,471 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 74 treesize of output 69 [2022-12-14 10:40:38,775 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 90 treesize of output 83 [2022-12-14 10:40:49,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:40:49,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:40:52,079 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| Int) (v_ArrVal_1600 Int) (v_ArrVal_1599 Int) (v_ArrVal_1603 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_1595)) |c_~#stored_elements~0.base| v_ArrVal_1597) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ v_ArrVal_1599 1) (select .cse0 .cse1)) (not (<= v_ArrVal_1595 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< 0 (+ 2147483650 (select (store (store (store .cse0 .cse1 v_ArrVal_1599) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1600) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| 4) |c_~#queue~0.offset|) v_ArrVal_1603) .cse1)))))) is different from false [2022-12-14 10:40:52,104 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| Int) (v_ArrVal_1600 Int) (v_ArrVal_1599 Int) (v_ArrVal_1603 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_1595)) |c_~#stored_elements~0.base| v_ArrVal_1597) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ v_ArrVal_1599 1) (select .cse0 .cse1)) (< 0 (+ 2147483650 (select (store (store (store .cse0 .cse1 v_ArrVal_1599) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1600) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| 4) |c_~#queue~0.offset|) v_ArrVal_1603) .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1595))))) is different from false [2022-12-14 10:40:52,155 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1594 Int) (v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| Int) (v_ArrVal_1600 Int) (v_ArrVal_1599 Int) (v_ArrVal_1603 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_1594) .cse3 v_ArrVal_1595)) |c_~#stored_elements~0.base| v_ArrVal_1597) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (not (<= (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1) v_ArrVal_1594)) (< 0 (+ (select (store (store (store .cse0 .cse1 v_ArrVal_1599) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1600) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| 4) |c_~#queue~0.offset|) v_ArrVal_1603) .cse1) 2147483650)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1595) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ v_ArrVal_1599 1) (select .cse0 .cse1)))))) is different from false [2022-12-14 10:40:52,193 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1594 Int) (v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| Int) (v_ArrVal_1600 Int) (v_ArrVal_1599 Int) (v_ArrVal_1603 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.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 .cse4 v_ArrVal_1594) .cse3 v_ArrVal_1595)) |c_~#stored_elements~0.base| v_ArrVal_1597) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< 0 (+ (select (store (store (store .cse0 .cse1 v_ArrVal_1599) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1600) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| 4) |c_~#queue~0.offset|) v_ArrVal_1603) .cse1) 2147483650)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1595) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ v_ArrVal_1599 1) (select .cse0 .cse1)) (< v_ArrVal_1594 (+ 1 (select .cse2 .cse4))))))) is different from false [2022-12-14 10:40:52,230 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 Int) (v_ArrVal_1594 Int) (v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| Int) (v_ArrVal_1600 Int) (v_ArrVal_1599 Int) (v_ArrVal_1603 Int)) (let ((.cse0 (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_1592)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1594) .cse4 v_ArrVal_1595)) |c_~#stored_elements~0.base| v_ArrVal_1597) |c_~#queue~0.base|))) (or (< v_ArrVal_1594 (+ (select .cse0 .cse1) 1)) (< (+ v_ArrVal_1599 1) (select .cse2 .cse3)) (< 0 (+ 2147483650 (select (store (store (store .cse2 .cse3 v_ArrVal_1599) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1600) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| 4) |c_~#queue~0.offset|) v_ArrVal_1603) .cse3))) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1595) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-12-14 10:41:00,288 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 Int) (v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1594 Int) (v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| Int) (v_ArrVal_1600 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| Int) (v_ArrVal_1599 Int) (v_ArrVal_1590 (Array Int Int)) (v_ArrVal_1603 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1590))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| 4) |c_~#queue~0.offset|) v_ArrVal_1592)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1594) .cse1 v_ArrVal_1595)) |c_~#stored_elements~0.base| v_ArrVal_1597) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1595) (< 0 (+ 2147483650 (select (store (store (store .cse2 .cse3 v_ArrVal_1599) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1600) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| 4) |c_~#queue~0.offset|) v_ArrVal_1603) .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| (select .cse4 .cse1))) (< v_ArrVal_1594 (+ (select .cse0 .cse3) 1)) (< (+ v_ArrVal_1599 1) (select .cse2 .cse3)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| (select .cse2 .cse1))))))))) is different from false [2022-12-14 10:41:00,333 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1597 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| Int) (v_ArrVal_1590 (Array Int Int)) (v_ArrVal_1592 Int) (v_ArrVal_1594 Int) (v_ArrVal_1595 Int) (v_ArrVal_1600 Int) (v_ArrVal_1588 Int) (v_ArrVal_1599 Int) (v_ArrVal_1603 Int)) (let ((.cse5 (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|) v_ArrVal_1588)) |c_~#stored_elements~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1590))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| 4) |c_~#queue~0.offset|) v_ArrVal_1592)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1594) .cse3 v_ArrVal_1595)) |c_~#stored_elements~0.base| v_ArrVal_1597) |c_~#queue~0.base|))) (or (< 0 (+ (select (store (store (store .cse0 .cse1 v_ArrVal_1599) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1600) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| 4) |c_~#queue~0.offset|) v_ArrVal_1603) .cse1) 2147483650)) (< v_ArrVal_1594 (+ (select .cse2 .cse1) 1)) (< (+ v_ArrVal_1599 1) (select .cse0 .cse1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1595) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| (select .cse0 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| (select .cse4 .cse3))) (not (<= v_ArrVal_1588 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))))))) is different from false [2022-12-14 10:41:00,377 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1597 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| Int) (v_ArrVal_1590 (Array Int Int)) (v_ArrVal_1592 Int) (v_ArrVal_1594 Int) (v_ArrVal_1595 Int) (v_ArrVal_1600 Int) (v_ArrVal_1588 Int) (v_ArrVal_1599 Int) (v_ArrVal_1603 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1588)) |c_~#stored_elements~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1590))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| 4) |c_~#queue~0.offset|) v_ArrVal_1592)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1594) .cse5 v_ArrVal_1595)) |c_~#stored_elements~0.base| v_ArrVal_1597) |c_~#queue~0.base|))) (or (< 0 (+ (select (store (store (store .cse0 .cse1 v_ArrVal_1599) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1600) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| 4) |c_~#queue~0.offset|) v_ArrVal_1603) .cse1) 2147483650)) (< v_ArrVal_1594 (+ (select .cse2 .cse1) 1)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1588) (< (+ v_ArrVal_1599 1) (select .cse0 .cse1)) (< (+ (select .cse2 .cse5) 1) v_ArrVal_1595) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| (select .cse0 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| (select .cse6 .cse5)))))))))) is different from false [2022-12-14 10:41:00,466 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1597 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| Int) (v_ArrVal_1590 (Array Int Int)) (v_ArrVal_1592 Int) (v_ArrVal_1594 Int) (v_ArrVal_1595 Int) (v_ArrVal_1586 Int) (v_ArrVal_1600 Int) (v_ArrVal_1588 Int) (v_ArrVal_1599 Int) (v_ArrVal_1603 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1586) .cse6 v_ArrVal_1588)) |c_~#stored_elements~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1590))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| 4) |c_~#queue~0.offset|) v_ArrVal_1592)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1594) .cse1 v_ArrVal_1595)) |c_~#stored_elements~0.base| v_ArrVal_1597) |c_~#queue~0.base|))) (or (not (<= (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1) v_ArrVal_1586)) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1595) (< (+ v_ArrVal_1599 1) (select .cse2 .cse3)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| (select .cse4 .cse1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1588) (< v_ArrVal_1594 (+ (select .cse0 .cse3) 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| (select .cse2 .cse1))) (< 0 (+ 2147483650 (select (store (store (store .cse2 .cse3 v_ArrVal_1599) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1600) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| 4) |c_~#queue~0.offset|) v_ArrVal_1603) .cse3)))))))))) is different from false [2022-12-14 10:41:00,524 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1597 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| Int) (v_ArrVal_1590 (Array Int Int)) (v_ArrVal_1592 Int) (v_ArrVal_1594 Int) (v_ArrVal_1595 Int) (v_ArrVal_1586 Int) (v_ArrVal_1600 Int) (v_ArrVal_1588 Int) (v_ArrVal_1599 Int) (v_ArrVal_1603 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse7 v_ArrVal_1586) .cse6 v_ArrVal_1588)) |c_~#stored_elements~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1590))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| 4) |c_~#queue~0.offset|) v_ArrVal_1592)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1594) .cse1 v_ArrVal_1595)) |c_~#stored_elements~0.base| v_ArrVal_1597) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1595) (< (+ v_ArrVal_1599 1) (select .cse2 .cse3)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| (select .cse4 .cse1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1588) (< v_ArrVal_1594 (+ (select .cse0 .cse3) 1)) (< v_ArrVal_1586 (+ 1 (select .cse5 .cse7))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| (select .cse2 .cse1))) (< 0 (+ 2147483650 (select (store (store (store .cse2 .cse3 v_ArrVal_1599) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1600) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| 4) |c_~#queue~0.offset|) v_ArrVal_1603) .cse3)))))))))) is different from false [2022-12-14 10:41:00,587 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1597 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| Int) (v_ArrVal_1590 (Array Int Int)) (v_ArrVal_1592 Int) (v_ArrVal_1594 Int) (v_ArrVal_1584 Int) (v_ArrVal_1595 Int) (v_ArrVal_1586 Int) (v_ArrVal_1600 Int) (v_ArrVal_1588 Int) (v_ArrVal_1599 Int) (v_ArrVal_1603 Int)) (let ((.cse5 (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_1584)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1586) .cse7 v_ArrVal_1588)) |c_~#stored_elements~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1590))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| 4) |c_~#queue~0.offset|) v_ArrVal_1592)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1594) .cse3 v_ArrVal_1595)) |c_~#stored_elements~0.base| v_ArrVal_1597) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store (store (store .cse0 .cse1 v_ArrVal_1599) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1600) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| 4) |c_~#queue~0.offset|) v_ArrVal_1603) .cse1))) (< v_ArrVal_1594 (+ 1 (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| (select .cse0 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| (select .cse4 .cse3))) (< v_ArrVal_1586 (+ (select .cse5 .cse6) 1)) (< (+ v_ArrVal_1599 1) (select .cse0 .cse1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1595) (< (+ (select .cse5 .cse7) 1) v_ArrVal_1588)))))))) is different from false [2022-12-14 10:41:00,657 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1597 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| Int) (v_ArrVal_1590 (Array Int Int)) (v_ArrVal_1592 Int) (v_ArrVal_1594 Int) (v_ArrVal_1584 Int) (v_ArrVal_1595 Int) (v_ArrVal_1586 Int) (v_ArrVal_1600 Int) (v_ArrVal_1588 Int) (v_ArrVal_1599 Int) (v_ArrVal_1603 Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse8 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| 4)) v_ArrVal_1584)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse9 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1586) .cse5 v_ArrVal_1588)) |c_~#stored_elements~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1590))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| 4) |c_~#queue~0.offset|) v_ArrVal_1592)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_1594) .cse3 v_ArrVal_1595)) |c_~#stored_elements~0.base| v_ArrVal_1597) |c_~#queue~0.base|))) (or (< v_ArrVal_1586 (+ (select .cse0 .cse1) 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| (select .cse2 .cse3))) (< 0 (+ 2147483650 (select (store (store (store .cse2 .cse4 v_ArrVal_1599) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1600) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_190| 4) |c_~#queue~0.offset|) v_ArrVal_1603) .cse4))) (< (+ 1 (select .cse0 .cse5)) v_ArrVal_1588) (< (+ v_ArrVal_1599 1) (select .cse2 .cse4)) (< v_ArrVal_1594 (+ (select .cse6 .cse4) 1)) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1595) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_192| (select .cse7 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| (select .cse8 .cse5))))))))))) is different from false [2022-12-14 10:41:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 10:41:04,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214459888] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:41:04,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1115879780] [2022-12-14 10:41:04,589 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:337) 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-12-14 10:41:04,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:41:04,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 22, 23] total 52 [2022-12-14 10:41:04,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370323735] [2022-12-14 10:41:04,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:41:04,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-14 10:41:04,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:41:04,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-14 10:41:04,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1396, Unknown=42, NotChecked=1092, Total=2862 [2022-12-14 10:41:04,594 INFO L87 Difference]: Start difference. First operand 490 states and 1077 transitions. Second operand has 54 states, 53 states have (on average 2.6037735849056602) internal successors, (138), 53 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-12-14 10:41:09,926 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-12-14 10:41:14,287 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-12-14 10:41:18,580 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-12-14 10:41:20,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 10:41:25,258 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-12-14 10:41:27,269 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-12-14 10:41:29,300 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-12-14 10:41:31,386 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-12-14 10:41:34,285 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-12-14 10:41:36,621 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-12-14 10:41:38,663 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-12-14 10:41:40,778 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-12-14 10:41:50,389 WARN L233 SmtUtils]: Spent 7.29s on a formula simplification. DAG size of input: 227 DAG size of output: 189 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:42:11,125 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-12-14 10:42:15,731 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-12-14 10:42:18,081 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 [1] [2022-12-14 10:42:20,540 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 [1] [2022-12-14 10:42:28,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 10:42:32,104 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-12-14 10:42:34,135 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-12-14 10:42:36,228 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-12-14 10:42:38,299 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-12-14 10:42:40,351 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] [2022-12-14 10:42:42,438 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-12-14 10:42:44,783 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 [1] [2022-12-14 10:42:46,873 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 [1] [2022-12-14 10:42:48,934 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 [1] [2022-12-14 10:42:51,004 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-12-14 10:42:53,078 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-12-14 10:42:55,132 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-12-14 10:42:57,177 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-12-14 10:43:01,425 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-12-14 10:43:03,439 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-12-14 10:43:05,454 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 [1] [2022-12-14 10:43:07,501 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 [1] [2022-12-14 10:43:09,534 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 [1] [2022-12-14 10:43:11,792 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 [1] [2022-12-14 10:43:22,653 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-12-14 10:43:24,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] [2022-12-14 10:43:26,679 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] [2022-12-14 10:43:28,755 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-12-14 10:43:32,289 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-12-14 10:43:34,336 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-12-14 10:43:36,425 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-12-14 10:43:38,499 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-12-14 10:43:47,657 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-12-14 10:43:49,669 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-12-14 10:43:51,677 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] [2022-12-14 10:43:53,729 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-12-14 10:43:55,798 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-12-14 10:43:57,862 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-12-14 10:44:00,344 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-12-14 10:44:04,470 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-12-14 10:44:06,511 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-12-14 10:44:14,655 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-12-14 10:44:40,002 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-12-14 10:44:42,165 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-12-14 10:44:44,718 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-12-14 10:44:49,510 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-12-14 10:44:53,969 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] [2022-12-14 10:45:04,448 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-12-14 10:45:06,562 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-12-14 10:45:08,616 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-12-14 10:45:10,629 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-12-14 10:45:21,028 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-12-14 10:45:23,039 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-12-14 10:45:25,043 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-12-14 10:45:27,048 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-12-14 10:45:29,092 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-12-14 10:45:31,105 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-12-14 10:45:32,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 10:45:34,340 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-12-14 10:45:36,343 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-12-14 10:45:38,360 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-12-14 10:45:40,364 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-12-14 10:45:42,378 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-12-14 10:45:44,711 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-12-14 10:45:46,783 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-12-14 10:45:48,795 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-12-14 10:45:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:45:49,292 INFO L93 Difference]: Finished difference Result 783 states and 1701 transitions. [2022-12-14 10:45:49,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-14 10:45:49,292 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.6037735849056602) internal successors, (138), 53 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-12-14 10:45:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:45:49,293 INFO L225 Difference]: With dead ends: 783 [2022-12-14 10:45:49,293 INFO L226 Difference]: Without dead ends: 783 [2022-12-14 10:45:49,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 81 ConstructedPredicates, 12 IntricatePredicates, 3 DeprecatedPredicates, 1673 ImplicationChecksByTransitivity, 149.9s TimeCoverageRelationStatistics Valid=844, Invalid=4082, Unknown=92, NotChecked=1788, Total=6806 [2022-12-14 10:45:49,295 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 517 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 2823 mSolverCounterSat, 68 mSolverCounterUnsat, 151 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 169.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 5135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2823 IncrementalHoareTripleChecker+Invalid, 151 IncrementalHoareTripleChecker+Unknown, 2093 IncrementalHoareTripleChecker+Unchecked, 170.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:45:49,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 257 Invalid, 5135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2823 Invalid, 151 Unknown, 2093 Unchecked, 170.1s Time] [2022-12-14 10:45:49,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2022-12-14 10:45:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 484. [2022-12-14 10:45:49,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 477 states have (on average 2.230607966457023) internal successors, (1064), 483 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:45:49,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1064 transitions. [2022-12-14 10:45:49,300 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1064 transitions. Word has length 46 [2022-12-14 10:45:49,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:45:49,300 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 1064 transitions. [2022-12-14 10:45:49,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.6037735849056602) internal successors, (138), 53 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-12-14 10:45:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1064 transitions. [2022-12-14 10:45:49,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 10:45:49,301 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:45:49,301 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-12-14 10:45:49,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 10:45:49,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-14 10:45:49,503 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:45:49,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:45:49,504 INFO L85 PathProgramCache]: Analyzing trace with hash -527647402, now seen corresponding path program 1 times [2022-12-14 10:45:49,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:45:49,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140009966] [2022-12-14 10:45:49,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:45:49,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:45:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:45:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:45:51,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:45:51,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140009966] [2022-12-14 10:45:51,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140009966] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:45:51,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410597692] [2022-12-14 10:45:51,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:45:51,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:45:51,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:45:51,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:45:51,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 10:45:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:45:51,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 101 conjunts are in the unsatisfiable core [2022-12-14 10:45:51,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:45:51,383 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 10:45:51,384 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-12-14 10:45:51,601 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-12-14 10:45:51,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:45:51,645 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-12-14 10:45:51,679 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-12-14 10:45:51,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:45:51,780 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 10:45:51,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2022-12-14 10:45:51,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:45:51,874 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-12-14 10:45:51,995 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-12-14 10:45:52,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:45:52,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 26 treesize of output 26 [2022-12-14 10:45:52,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:45:52,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:45:52,251 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-12-14 10:45:52,317 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-12-14 10:45:52,462 INFO L321 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-12-14 10:45:52,462 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-12-14 10:45:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:45:52,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:45:53,059 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1744 Int) (v_ArrVal_1747 Int) (v_ArrVal_1746 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1744 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1744) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1746) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_1747) .cse1) 2147483647)))) is different from false [2022-12-14 10:45:53,182 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1744 Int) (v_ArrVal_1747 Int) (v_ArrVal_1746 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_1742) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1744 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1744) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1746) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_1747) .cse1) 2147483647)))) is different from false [2022-12-14 10:45:53,208 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1739 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1744 Int) (v_ArrVal_1747 Int) (v_ArrVal_1746 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_1739) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1744 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1744) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1746) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_1747) .cse1) 2147483647) (not (<= v_ArrVal_1739 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))) is different from false [2022-12-14 10:45:53,227 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1739 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1744 Int) (v_ArrVal_1747 Int) (v_ArrVal_1746 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_1739) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1744 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1744) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1746) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_1747) .cse1) 2147483647) (< 2147483647 v_ArrVal_1739)))) is different from false [2022-12-14 10:45:53,249 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1739 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1744 Int) (v_ArrVal_1736 Int) (v_ArrVal_1747 Int) (v_ArrVal_1746 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_1736)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1739) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1744) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1746) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_1747) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1744 1)) (< 2147483647 v_ArrVal_1739)))) is different from false [2022-12-14 10:45:53,456 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1739 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1744 Int) (v_ArrVal_1736 Int) (v_ArrVal_1747 Int) (v_ArrVal_1746 Int)) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1735))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1736)))) (store (store .cse4 .cse1 v_ArrVal_1739) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1744) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1746) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) v_ArrVal_1747) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1744 1)) (< 2147483647 v_ArrVal_1739))))) is different from false [2022-12-14 10:45:53,511 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1739 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1744 Int) (v_ArrVal_1736 Int) (v_ArrVal_1747 Int) (v_ArrVal_1746 Int)) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1734) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1735))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1736)))) (store (store .cse4 .cse1 v_ArrVal_1739) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1744) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1746) (+ (* 4 (select .cse0 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1747) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1744 1)) (< 2147483647 v_ArrVal_1739))))) is different from false [2022-12-14 10:45:53,533 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1739 Int) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1744 Int) (v_ArrVal_1736 Int) (v_ArrVal_1747 Int) (v_ArrVal_1746 Int)) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (let ((.cse3 (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_1734) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1735))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1736)))) (store (store .cse4 .cse1 v_ArrVal_1739) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1744 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1744) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_1746) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1747) .cse1) 2147483647) (< 2147483647 v_ArrVal_1739))))) is different from false [2022-12-14 10:45:53,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:45:53,724 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 569 treesize of output 305 [2022-12-14 10:45:53,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:45:53,740 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 640 treesize of output 634 [2022-12-14 10:45:53,747 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 418 treesize of output 402 [2022-12-14 10:45:53,757 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:45:53,758 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 527 treesize of output 479 [2022-12-14 10:45:53,768 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 146 treesize of output 138 [2022-12-14 10:45:53,787 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-12-14 10:45:53,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:45:53,891 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 97 treesize of output 85 [2022-12-14 10:45:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 10:45:54,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410597692] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:45:54,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [659890713] [2022-12-14 10:45:54,154 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:337) 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-12-14 10:45:54,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:45:54,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 21] total 65 [2022-12-14 10:45:54,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204481837] [2022-12-14 10:45:54,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:45:54,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-14 10:45:54,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:45:54,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-14 10:45:54,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=3042, Unknown=12, NotChecked=968, Total=4422 [2022-12-14 10:45:54,156 INFO L87 Difference]: Start difference. First operand 484 states and 1064 transitions. Second operand has 67 states, 66 states have (on average 2.090909090909091) internal successors, (138), 66 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-12-14 10:46:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:46:13,730 INFO L93 Difference]: Finished difference Result 1234 states and 2739 transitions. [2022-12-14 10:46:13,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-14 10:46:13,731 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.090909090909091) internal successors, (138), 66 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-12-14 10:46:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:46:13,732 INFO L225 Difference]: With dead ends: 1234 [2022-12-14 10:46:13,732 INFO L226 Difference]: Without dead ends: 1234 [2022-12-14 10:46:13,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 50 SyntacticMatches, 16 SemanticMatches, 115 ConstructedPredicates, 8 IntricatePredicates, 7 DeprecatedPredicates, 3541 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=2133, Invalid=9658, Unknown=13, NotChecked=1768, Total=13572 [2022-12-14 10:46:13,734 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1726 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 3724 mSolverCounterSat, 352 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 5579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 3724 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 1497 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:46:13,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1726 Valid, 392 Invalid, 5579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 3724 Invalid, 6 Unknown, 1497 Unchecked, 3.9s Time] [2022-12-14 10:46:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-12-14 10:46:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 832. [2022-12-14 10:46:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 825 states have (on average 2.3212121212121213) internal successors, (1915), 831 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:46:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1915 transitions. [2022-12-14 10:46:13,743 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1915 transitions. Word has length 46 [2022-12-14 10:46:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:46:13,743 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 1915 transitions. [2022-12-14 10:46:13,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.090909090909091) internal successors, (138), 66 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-12-14 10:46:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1915 transitions. [2022-12-14 10:46:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 10:46:13,744 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:46:13,744 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-12-14 10:46:13,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 10:46:13,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-14 10:46:13,946 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:46:13,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:46:13,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1832880654, now seen corresponding path program 2 times [2022-12-14 10:46:13,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:46:13,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698125530] [2022-12-14 10:46:13,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:46:13,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:46:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:46:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:46:17,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:46:17,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698125530] [2022-12-14 10:46:17,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698125530] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:46:17,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553826113] [2022-12-14 10:46:17,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:46:17,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:46:17,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:46:17,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:46:17,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 10:46:17,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:46:17,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:46:17,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 116 conjunts are in the unsatisfiable core [2022-12-14 10:46:17,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:46:17,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:46:17,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:46:17,365 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 10:46:17,366 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-12-14 10:46:17,381 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 10:46:17,381 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-12-14 10:46:17,558 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-12-14 10:46:17,663 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-12-14 10:46:17,859 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 58 treesize of output 51 [2022-12-14 10:46:17,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:46:17,961 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 45 treesize of output 47 [2022-12-14 10:46:18,165 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 63 treesize of output 56 [2022-12-14 10:46:18,562 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-12-14 10:46:18,728 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-12-14 10:46:19,134 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 75 treesize of output 68 [2022-12-14 10:46:19,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:46:19,355 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 62 treesize of output 64 [2022-12-14 10:46:20,247 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 80 treesize of output 73 [2022-12-14 10:46:21,197 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 74 treesize of output 69 [2022-12-14 10:46:43,036 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 90 treesize of output 83 [2022-12-14 10:46:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:46:52,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:46:53,175 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1904 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483648)) (forall ((v_ArrVal_1904 (Array Int Int))) (not (<= 802 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)))))) is different from false [2022-12-14 10:46:56,007 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (and (forall ((v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1901 Int)) (or (not (<= v_ArrVal_1901 .cse0)) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1904 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse2 (select .cse1 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< (select (select (store (store .cse1 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1901) .cse4 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483648) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1902))))))) (forall ((v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1901 Int)) (or (forall ((v_ArrVal_1902 Int) (v_ArrVal_1904 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= 802 (select (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse3 v_ArrVal_1901) .cse4 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse6 .cse4) 1) v_ArrVal_1902))))) (not (<= v_ArrVal_1901 .cse0)))))) is different from false [2022-12-14 10:46:56,046 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< 2147483647 v_ArrVal_1901) (< (select (select (store (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1901) .cse3 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483648) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1902))))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< 2147483647 v_ArrVal_1901) (not (<= 802 (select (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse2 v_ArrVal_1901) .cse3 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1902))))))) is different from false [2022-12-14 10:46:56,082 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1898 Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1898)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< 2147483647 v_ArrVal_1901) (< (select (select (store (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1901) .cse3 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483648) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1902))))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1898 Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1898)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse6 (select .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< 2147483647 v_ArrVal_1901) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1902) (not (<= 802 (select (select (store (store .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse2 v_ArrVal_1901) .cse3 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)))))))))) is different from false [2022-12-14 10:46:56,119 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse5 .cse4)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| .cse0)) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1898 Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_1898)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (or (not (<= 802 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1901) .cse4 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) .cse4))) (< 2147483647 v_ArrVal_1901) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1902))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| .cse0)) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1898 Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_1898)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1901) (< (+ (select .cse6 .cse4) 1) v_ArrVal_1902) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_1901) .cse4 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) .cse3) 2147483648)))))))))) is different from false [2022-12-14 10:46:57,678 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ (select .cse7 .cse8) 1))) (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_1898 Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse6 |c_~#queue~0.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_1898)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1901) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1902) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse2 .cse1))) (not (<= 802 (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1901) .cse1 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) .cse1))) (< .cse5 v_ArrVal_1895))))))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_1898 Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896))) (let ((.cse10 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_1898)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse9 (select .cse11 |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1901) (< (+ (select .cse9 .cse1) 1) v_ArrVal_1902) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse10 .cse1))) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_1901) .cse1 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) .cse4) 2147483648) (< .cse5 v_ArrVal_1895)))))))))) is different from false [2022-12-14 10:46:57,772 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (+ (select .cse7 .cse9) 1)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1893 Int) (v_ArrVal_1895 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_1898 Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_1893) .cse9 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse6 |c_~#queue~0.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_1898)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1901) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1902) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse2 .cse1))) (not (<= 802 (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1901) .cse1 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) .cse1))) (< .cse5 v_ArrVal_1895))))))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1893 Int) (v_ArrVal_1895 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_1898 Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_1893) .cse9 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896))) (let ((.cse11 (select .cse13 |c_~#queue~0.base|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store .cse11 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_1898)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse10 (select .cse12 |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1901) (< (+ (select .cse10 .cse1) 1) v_ArrVal_1902) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse11 .cse1))) (< .cse5 v_ArrVal_1895) (< (select (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_1901) .cse1 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) .cse4) 2147483648)))))))))) is different from false [2022-12-14 10:46:57,885 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1890 Int) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1893 Int) (v_ArrVal_1895 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_1898 Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse4 (store .cse9 .cse10 v_ArrVal_1890))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse8 v_ArrVal_1893) .cse5 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse7 |c_~#queue~0.base| (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_1898)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1901) (< (+ 1 (select .cse0 .cse1)) v_ArrVal_1902) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1901) .cse1 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) .cse3) 2147483648) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1895) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse6 .cse1)))))))))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1890 Int) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1893 Int) (v_ArrVal_1895 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_1898 Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse12 (store .cse9 .cse10 v_ArrVal_1890))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 .cse8 v_ArrVal_1893) .cse5 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896))) (let ((.cse13 (select .cse15 |c_~#queue~0.base|))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store .cse13 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_1898)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse11 (select .cse14 |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1901) (< (+ 1 (select .cse11 .cse1)) v_ArrVal_1902) (< (+ (select .cse12 .cse5) 1) v_ArrVal_1895) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse13 .cse1))) (not (<= 802 (select (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse11 .cse3 v_ArrVal_1901) .cse1 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) .cse1)))))))))))) is different from false [2022-12-14 10:46:57,973 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse10 (select .cse9 .cse1)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_209| Int)) (or (forall ((v_ArrVal_1902 Int) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1890 Int) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1893 Int) (v_ArrVal_1895 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_1898 Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (store .cse9 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_209| 4)) v_ArrVal_1890))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse8 v_ArrVal_1893) .cse1 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse7 |c_~#queue~0.base| (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_1898)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1901) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1895) (not (<= 802 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1901) .cse5 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) .cse5))) (< (+ (select .cse3 .cse5) 1) v_ArrVal_1902) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse6 .cse5)))))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_209| .cse10)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_209| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_209| .cse10)) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1890 Int) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1893 Int) (v_ArrVal_1895 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_1898 Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse13 (store .cse9 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_209| 4)) v_ArrVal_1890))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse13 .cse8 v_ArrVal_1893) .cse1 v_ArrVal_1895)) |c_~#stored_elements~0.base| v_ArrVal_1896))) (let ((.cse14 (select .cse15 |c_~#queue~0.base|))) (let ((.cse11 (store (store .cse15 |c_~#queue~0.base| (store .cse14 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_1898)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1899))) (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1901) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_1901) .cse5 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) .cse4) 2147483648) (< (+ (select .cse13 .cse1) 1) v_ArrVal_1895) (< (+ (select .cse12 .cse5) 1) v_ArrVal_1902) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse14 .cse5))))))))))))))) is different from false [2022-12-14 10:47:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-14 10:47:02,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553826113] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:47:02,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [772980607] [2022-12-14 10:47:02,981 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:337) 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-12-14 10:47:02,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:47:02,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 22] total 65 [2022-12-14 10:47:02,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179279793] [2022-12-14 10:47:02,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:47:02,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-14 10:47:02,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:47:02,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-14 10:47:02,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=3000, Unknown=48, NotChecked=1080, Total=4422 [2022-12-14 10:47:02,984 INFO L87 Difference]: Start difference. First operand 832 states and 1915 transitions. Second operand has 67 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 66 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-12-14 10:47:07,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-12-14 10:47:10,714 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-12-14 10:47:13,615 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-12-14 10:47:19,035 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-12-14 10:47:24,355 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-12-14 10:47:27,031 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-12-14 10:47:34,152 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-12-14 10:47:43,297 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-12-14 10:47:45,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 10:47:47,709 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-12-14 10:47:50,131 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-12-14 10:47:57,264 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-12-14 10:47:58,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 10:48:10,461 WARN L233 SmtUtils]: Spent 5.75s on a formula simplification. DAG size of input: 131 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:48:12,501 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] [2022-12-14 10:48:14,680 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-12-14 10:48:19,181 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-12-14 10:48:21,372 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-12-14 10:48:23,841 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-12-14 10:48:26,023 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-12-14 10:48:28,158 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-12-14 10:48:30,332 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-12-14 10:48:33,228 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-12-14 10:48:35,299 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-12-14 10:48:37,376 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-12-14 10:48:40,611 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-12-14 10:48:42,624 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-12-14 10:48:44,646 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-12-14 10:48:46,647 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-12-14 10:48:48,653 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-12-14 10:48:50,658 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-12-14 10:48:52,661 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-12-14 10:48:54,682 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-12-14 10:48:56,683 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-12-14 10:48:58,685 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-12-14 10:49:00,691 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-12-14 10:49:02,770 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-12-14 10:49:04,799 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-12-14 10:49:06,805 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-12-14 10:49:08,807 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-12-14 10:49:10,847 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-12-14 10:49:14,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 10:49:16,985 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-12-14 10:49:19,106 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-12-14 10:49:21,160 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-12-14 10:49:23,182 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-12-14 10:49:25,341 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-12-14 10:49:27,508 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-12-14 10:49:29,513 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-12-14 10:49:31,539 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-12-14 10:49:34,709 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-12-14 10:49:47,028 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-12-14 10:49:53,732 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-12-14 10:50:12,573 WARN L233 SmtUtils]: Spent 10.50s on a formula simplification. DAG size of input: 135 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:50:48,175 WARN L233 SmtUtils]: Spent 15.75s on a formula simplification. DAG size of input: 142 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:50:50,219 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-12-14 10:50:52,336 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-12-14 10:50:54,766 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-12-14 10:51:03,952 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-12-14 10:51:05,978 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-12-14 10:51:08,155 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-12-14 10:51:10,165 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-12-14 10:51:10,830 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ (select .cse0 .cse1) 1)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1902 Int)) (or (forall ((v_ArrVal_1904 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) .cse2) 2147483648)) (not (<= v_ArrVal_1902 .cse3)))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1904 (Array Int Int))) (or (< .cse4 v_ArrVal_1902) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) .cse2) 2147483648))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1904 (Array Int Int))) (or (< .cse4 v_ArrVal_1902) (not (<= 802 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) .cse5))))) (forall ((v_ArrVal_1902 Int)) (or (not (<= v_ArrVal_1902 .cse3)) (forall ((v_ArrVal_1904 (Array Int Int))) (not (<= 802 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1902)) |c_~#stored_elements~0.base| v_ArrVal_1904) |c_~#queue~0.base|) .cse5))))))))) is different from false [2022-12-14 10:51:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:51:13,199 INFO L93 Difference]: Finished difference Result 1419 states and 3257 transitions. [2022-12-14 10:51:13,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-14 10:51:13,200 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 66 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-12-14 10:51:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:51:13,201 INFO L225 Difference]: With dead ends: 1419 [2022-12-14 10:51:13,201 INFO L226 Difference]: Without dead ends: 1419 [2022-12-14 10:51:13,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 48 SyntacticMatches, 11 SemanticMatches, 100 ConstructedPredicates, 10 IntricatePredicates, 4 DeprecatedPredicates, 2446 ImplicationChecksByTransitivity, 157.0s TimeCoverageRelationStatistics Valid=1036, Invalid=7305, Unknown=71, NotChecked=1890, Total=10302 [2022-12-14 10:51:13,204 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 864 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 4080 mSolverCounterSat, 188 mSolverCounterUnsat, 127 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 135.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 6124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 4080 IncrementalHoareTripleChecker+Invalid, 127 IncrementalHoareTripleChecker+Unknown, 1729 IncrementalHoareTripleChecker+Unchecked, 136.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:51:13,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 299 Invalid, 6124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 4080 Invalid, 127 Unknown, 1729 Unchecked, 136.9s Time] [2022-12-14 10:51:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2022-12-14 10:51:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 992. [2022-12-14 10:51:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 985 states have (on average 2.3746192893401017) internal successors, (2339), 991 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:51:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 2339 transitions. [2022-12-14 10:51:13,216 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 2339 transitions. Word has length 46 [2022-12-14 10:51:13,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:51:13,216 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 2339 transitions. [2022-12-14 10:51:13,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 66 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-12-14 10:51:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 2339 transitions. [2022-12-14 10:51:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 10:51:13,217 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:51:13,217 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-12-14 10:51:13,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 10:51:13,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:51:13,418 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:51:13,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:51:13,418 INFO L85 PathProgramCache]: Analyzing trace with hash 437636861, now seen corresponding path program 1 times [2022-12-14 10:51:13,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:51:13,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531165623] [2022-12-14 10:51:13,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:51:13,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:51:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:51:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:51:14,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:51:14,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531165623] [2022-12-14 10:51:14,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531165623] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:51:14,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548942568] [2022-12-14 10:51:14,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:51:14,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:51:14,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:51:14,659 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:51:14,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 10:51:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:51:14,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-14 10:51:14,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:51:15,052 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-12-14 10:51:15,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:51:15,095 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-12-14 10:51:15,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:51:15,212 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-12-14 10:51:15,250 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-12-14 10:51:15,342 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 10:51:15,342 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-12-14 10:51:15,387 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-12-14 10:51:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:51:15,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:51:15,738 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2049 Int) (v_ArrVal_2043 (Array Int 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_2043) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2049)) .cse1))))) is different from false [2022-12-14 10:51:15,747 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2049 Int) (v_ArrVal_2043 (Array Int 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_2043) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2049)) .cse1)) 2147483650))) is different from false [2022-12-14 10:51:15,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:51:15,818 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-12-14 10:51:15,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:51:15,825 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-12-14 10:51:15,829 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-12-14 10:51:15,842 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-12-14 10:51:15,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:51:15,856 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-12-14 10:51:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:51:15,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548942568] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:51:15,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [90815989] [2022-12-14 10:51:15,941 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:337) 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-12-14 10:51:15,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:51:15,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 10] total 36 [2022-12-14 10:51:15,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730998819] [2022-12-14 10:51:15,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:51:15,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 10:51:15,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:51:15,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 10:51:15,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1083, Unknown=2, NotChecked=138, Total=1406 [2022-12-14 10:51:15,944 INFO L87 Difference]: Start difference. First operand 992 states and 2339 transitions. Second operand has 38 states, 37 states have (on average 3.972972972972973) internal successors, (147), 37 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-12-14 10:51:20,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:51:20,327 INFO L93 Difference]: Finished difference Result 2397 states and 5510 transitions. [2022-12-14 10:51:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 10:51:20,327 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.972972972972973) internal successors, (147), 37 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-12-14 10:51:20,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:51:20,330 INFO L225 Difference]: With dead ends: 2397 [2022-12-14 10:51:20,330 INFO L226 Difference]: Without dead ends: 2361 [2022-12-14 10:51:20,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 82 SyntacticMatches, 11 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=806, Invalid=3360, Unknown=2, NotChecked=254, Total=4422 [2022-12-14 10:51:20,332 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1100 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 3149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 426 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:51:20,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 281 Invalid, 3149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 2513 Invalid, 0 Unknown, 426 Unchecked, 2.2s Time] [2022-12-14 10:51:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2022-12-14 10:51:20,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1714. [2022-12-14 10:51:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1707 states have (on average 2.397773872290568) internal successors, (4093), 1713 states have internal predecessors, (4093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:51:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 4093 transitions. [2022-12-14 10:51:20,353 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 4093 transitions. Word has length 49 [2022-12-14 10:51:20,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:51:20,354 INFO L495 AbstractCegarLoop]: Abstraction has 1714 states and 4093 transitions. [2022-12-14 10:51:20,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.972972972972973) internal successors, (147), 37 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-12-14 10:51:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 4093 transitions. [2022-12-14 10:51:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 10:51:20,354 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:51:20,354 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-12-14 10:51:20,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 10:51:20,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-14 10:51:20,556 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:51:20,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:51:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash -695408811, now seen corresponding path program 2 times [2022-12-14 10:51:20,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:51:20,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478554583] [2022-12-14 10:51:20,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:51:20,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:51:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:51:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:51:21,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:51:21,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478554583] [2022-12-14 10:51:21,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478554583] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:51:21,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198615245] [2022-12-14 10:51:21,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:51:21,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:51:21,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:51:21,315 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:51:21,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 10:51:21,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:51:21,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:51:21,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 80 conjunts are in the unsatisfiable core [2022-12-14 10:51:21,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:51:21,613 INFO L321 Elim1Store]: treesize reduction 37, result has 49.3 percent of original size [2022-12-14 10:51:21,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 67 [2022-12-14 10:51:22,047 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-12-14 10:51:22,103 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-12-14 10:51:22,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12-14 10:51:22,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:51:22,303 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-12-14 10:51:22,331 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-12-14 10:51:22,413 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 10:51:22,413 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-12-14 10:51:22,479 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-12-14 10:51:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:51:22,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:51:22,875 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_2186 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2186) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_2191) (+ |c_~#queue~0.offset| 3204)))) (< (+ v_ArrVal_2191 2147483648) 0))) is different from false [2022-12-14 10:51:23,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:51:23,019 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 1 case distinctions, treesize of input 34 treesize of output 35 [2022-12-14 10:51:23,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:51:23,031 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 214 treesize of output 216 [2022-12-14 10:51:23,036 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 246 treesize of output 230 [2022-12-14 10:51:23,043 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 254 treesize of output 246 [2022-12-14 10:51:23,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 10 treesize of output 6 [2022-12-14 10:51:23,198 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:51:23,198 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 52 treesize of output 52 [2022-12-14 10:51:23,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:51:23,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198615245] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:51:23,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [613186555] [2022-12-14 10:51:23,375 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:337) 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-12-14 10:51:23,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:51:23,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-12-14 10:51:23,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797363185] [2022-12-14 10:51:23,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:51:23,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 10:51:23,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:51:23,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 10:51:23,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=865, Unknown=8, NotChecked=60, Total=1056 [2022-12-14 10:51:23,377 INFO L87 Difference]: Start difference. First operand 1714 states and 4093 transitions. Second operand has 33 states, 32 states have (on average 4.59375) internal successors, (147), 32 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-12-14 10:51:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:51:24,792 INFO L93 Difference]: Finished difference Result 1744 states and 4160 transitions. [2022-12-14 10:51:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 10:51:24,792 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.59375) internal successors, (147), 32 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-12-14 10:51:24,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:51:24,794 INFO L225 Difference]: With dead ends: 1744 [2022-12-14 10:51:24,794 INFO L226 Difference]: Without dead ends: 1744 [2022-12-14 10:51:24,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=361, Invalid=1441, Unknown=8, NotChecked=82, Total=1892 [2022-12-14 10:51:24,795 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 731 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 93 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 10:51:24,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 95 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 819 Invalid, 2 Unknown, 106 Unchecked, 0.8s Time] [2022-12-14 10:51:24,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2022-12-14 10:51:24,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1634. [2022-12-14 10:51:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1628 states have (on average 2.401105651105651) internal successors, (3909), 1633 states have internal predecessors, (3909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:51:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 3909 transitions. [2022-12-14 10:51:24,821 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 3909 transitions. Word has length 49 [2022-12-14 10:51:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:51:24,821 INFO L495 AbstractCegarLoop]: Abstraction has 1634 states and 3909 transitions. [2022-12-14 10:51:24,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.59375) internal successors, (147), 32 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-12-14 10:51:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 3909 transitions. [2022-12-14 10:51:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 10:51:24,822 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:51:24,822 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-12-14 10:51:24,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 10:51:25,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-14 10:51:25,023 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 10:51:25,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:51:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash -695408810, now seen corresponding path program 1 times [2022-12-14 10:51:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:51:25,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153073773] [2022-12-14 10:51:25,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:51:25,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:51:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:51:26,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:51:26,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:51:26,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153073773] [2022-12-14 10:51:26,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153073773] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:51:26,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558203472] [2022-12-14 10:51:26,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:51:26,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:51:26,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:51:26,826 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:51:26,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9433ed-1ec2-4cc2-87dc-d85ebcdc44bf/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 10:51:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:51:26,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 105 conjunts are in the unsatisfiable core [2022-12-14 10:51:26,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:51:27,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:51:27,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:51:27,020 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 10:51:27,020 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-12-14 10:51:27,037 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 10:51:27,037 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-12-14 10:51:27,190 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-12-14 10:51:27,269 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-12-14 10:51:27,438 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 58 treesize of output 51 [2022-12-14 10:51:27,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:51:27,507 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 45 treesize of output 47 [2022-12-14 10:51:27,687 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 63 treesize of output 56 [2022-12-14 10:51:27,961 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-12-14 10:51:28,498 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 70 treesize of output 63 [2022-12-14 10:51:28,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:51:28,692 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 57 treesize of output 59 [2022-12-14 10:51:28,927 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 57 treesize of output 59 [2022-12-14 10:51:29,373 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 64 treesize of output 59 [2022-12-14 10:51:29,580 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 64 treesize of output 59 [2022-12-14 10:51:30,246 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 80 treesize of output 73 [2022-12-14 10:51:30,955 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 76 treesize of output 71 [2022-12-14 10:51:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:51:35,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:51:35,904 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2354 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2359 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2354) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2359) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_229| (select .cse0 .cse1)))))) is different from false [2022-12-14 10:51:35,942 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2359 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2353) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2354) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_229| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2359) .cse1) 2147483647)))) is different from false [2022-12-14 10:51:49,766 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2350 Int) (v_ArrVal_2352 Int) (v_ArrVal_2346 (Array Int Int)) (v_ArrVal_2345 Int) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2359 Int) (v_ArrVal_2347 Int)) (let ((.cse4 (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_2345)) |c_~#stored_elements~0.base| v_ArrVal_2346))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2347)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2350) .cse1 v_ArrVal_2352)) |c_~#stored_elements~0.base| v_ArrVal_2353) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2354) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_2345 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_2352) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_229| (select .cse2 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2359) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_231| (select .cse3 .cse1))))))))) is different from false [2022-12-14 10:51:52,488 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2350 Int) (v_ArrVal_2352 Int) (v_ArrVal_2346 (Array Int Int)) (v_ArrVal_2343 Int) (v_ArrVal_2345 Int) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2359 Int) (v_ArrVal_2347 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2343) .cse3 v_ArrVal_2345)) |c_~#stored_elements~0.base| v_ArrVal_2346))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2347)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2350) .cse1 v_ArrVal_2352)) |c_~#stored_elements~0.base| v_ArrVal_2353) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2354) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2359) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2345) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2352) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_229| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_231| (select .cse5 .cse1)))))))))) is different from false [2022-12-14 10:51:55,128 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2346 (Array Int Int)) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_231| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_232| Int) (v_ArrVal_2340 Int) (v_ArrVal_2350 Int) (v_ArrVal_2352 Int) (v_ArrVal_2343 Int) (v_ArrVal_2345 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2359 Int) (v_ArrVal_2347 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_232| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_2340)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_2343) .cse3 v_ArrVal_2345)) |c_~#stored_elements~0.base| v_ArrVal_2346))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2347)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2350) .cse1 v_ArrVal_2352)) |c_~#stored_elements~0.base| v_ArrVal_2353) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2354) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_231| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_232| (select .cse2 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2352) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2359) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_229| (select .cse5 .cse1))) (< (+ (select .cse6 .cse3) 1) v_ArrVal_2345))))))))) is different from false [2022-12-14 10:52:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:52:08,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558203472] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:52:08,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2089901054] [2022-12-14 10:52:08,408 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:337) 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-12-14 10:52:08,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:52:08,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 19] total 54 [2022-12-14 10:52:08,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400888323] [2022-12-14 10:52:08,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:52:08,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-14 10:52:08,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:52:08,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-14 10:52:08,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=2052, Unknown=80, NotChecked=510, Total=3080 [2022-12-14 10:52:08,409 INFO L87 Difference]: Start difference. First operand 1634 states and 3909 transitions. Second operand has 56 states, 55 states have (on average 2.672727272727273) internal successors, (147), 55 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-12-14 10:52:12,969 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-12-14 10:52:21,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 10:52:24,287 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-12-14 10:52:26,656 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-12-14 10:52:28,707 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-12-14 10:52:39,615 WARN L233 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 114 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:53:04,271 WARN L233 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 104 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:53:15,115 WARN L233 SmtUtils]: Spent 10.16s on a formula simplification. DAG size of input: 209 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:53:17,195 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-12-14 10:53:19,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 10:53:21,389 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-12-14 10:53:23,419 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-12-14 10:53:25,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 10:53:27,599 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-12-14 10:53:29,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 10:53:40,615 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-12-14 10:53:42,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]