./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longest-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash faf61a04ec090f6b1743a12583eb9c9759e6ed3e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:31:16,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:31:16,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:31:16,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:31:16,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:31:16,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:31:16,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:31:16,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:31:16,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:31:16,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:31:16,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:31:16,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:31:16,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:31:16,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:31:16,153 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:31:16,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:31:16,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:31:16,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:31:16,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:31:16,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:31:16,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:31:16,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:31:16,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:31:16,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:31:16,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:31:16,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:31:16,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:31:16,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:31:16,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:31:16,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:31:16,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:31:16,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:31:16,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:31:16,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:31:16,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:31:16,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:31:16,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:31:16,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:31:16,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:31:16,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:31:16,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:31:16,203 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:31:16,227 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:31:16,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:31:16,228 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:31:16,228 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:31:16,228 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:31:16,229 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:31:16,229 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:31:16,229 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:31:16,229 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:31:16,229 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:31:16,230 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:31:16,230 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:31:16,230 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:31:16,230 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:31:16,231 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:31:16,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:31:16,232 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:31:16,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:31:16,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:31:16,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:31:16,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:31:16,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:31:16,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:31:16,233 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:31:16,233 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:31:16,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:31:16,234 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:31:16,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:31:16,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:31:16,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:31:16,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:31:16,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:31:16,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:31:16,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:31:16,236 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:31:16,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:31:16,236 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:31:16,236 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:31:16,236 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:31:16,237 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/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_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI 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 ! call(reach_error())) ) 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 -> faf61a04ec090f6b1743a12583eb9c9759e6ed3e [2021-10-11 02:31:16,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:31:16,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:31:16,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:31:16,590 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:31:16,591 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:31:16,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/pthread/triangular-longest-2.i [2021-10-11 02:31:16,667 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/data/bdd143955/83fd4e59be294e57aaaabd5da1804e37/FLAGfabaf780e [2021-10-11 02:31:17,255 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:31:17,255 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/sv-benchmarks/c/pthread/triangular-longest-2.i [2021-10-11 02:31:17,273 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/data/bdd143955/83fd4e59be294e57aaaabd5da1804e37/FLAGfabaf780e [2021-10-11 02:31:17,545 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/data/bdd143955/83fd4e59be294e57aaaabd5da1804e37 [2021-10-11 02:31:17,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:31:17,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:31:17,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:31:17,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:31:17,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:31:17,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:31:17" (1/1) ... [2021-10-11 02:31:17,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf7672a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:17, skipping insertion in model container [2021-10-11 02:31:17,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:31:17" (1/1) ... [2021-10-11 02:31:17,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:31:17,606 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:31:17,975 WARN L226 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_2fe78ab9-55e6-4493-8610-dead8b113d25/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2021-10-11 02:31:17,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:31:17,986 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:31:18,025 WARN L226 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_2fe78ab9-55e6-4493-8610-dead8b113d25/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2021-10-11 02:31:18,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:31:18,108 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:31:18,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:18 WrapperNode [2021-10-11 02:31:18,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:31:18,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:31:18,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:31:18,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:31:18,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:18" (1/1) ... [2021-10-11 02:31:18,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:18" (1/1) ... [2021-10-11 02:31:18,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:31:18,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:31:18,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:31:18,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:31:18,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:18" (1/1) ... [2021-10-11 02:31:18,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:18" (1/1) ... [2021-10-11 02:31:18,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:18" (1/1) ... [2021-10-11 02:31:18,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:18" (1/1) ... [2021-10-11 02:31:18,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:18" (1/1) ... [2021-10-11 02:31:18,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:18" (1/1) ... [2021-10-11 02:31:18,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:18" (1/1) ... [2021-10-11 02:31:18,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:31:18,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:31:18,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:31:18,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:31:18,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:18" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:31:18,270 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-10-11 02:31:18,270 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-10-11 02:31:18,271 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-10-11 02:31:18,271 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-10-11 02:31:18,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 02:31:18,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-11 02:31:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:31:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 02:31:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:31:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-11 02:31:18,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:31:18,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:31:18,276 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-11 02:31:18,829 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:31:18,829 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-10-11 02:31:18,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:31:18 BoogieIcfgContainer [2021-10-11 02:31:18,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:31:18,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:31:18,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:31:18,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:31:18,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:31:17" (1/3) ... [2021-10-11 02:31:18,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c165e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:31:18, skipping insertion in model container [2021-10-11 02:31:18,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:18" (2/3) ... [2021-10-11 02:31:18,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c165e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:31:18, skipping insertion in model container [2021-10-11 02:31:18,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:31:18" (3/3) ... [2021-10-11 02:31:18,841 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2021-10-11 02:31:18,855 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-11 02:31:18,855 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:31:18,860 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 02:31:18,861 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-11 02:31:18,894 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,894 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,894 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,895 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,895 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,895 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,895 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,895 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,895 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,895 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,896 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,896 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,896 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,896 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,897 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,897 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,897 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,897 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,898 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,898 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,898 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,898 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,898 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,899 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,899 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,899 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,899 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,900 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,900 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,900 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,900 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,901 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,901 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,902 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,902 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,902 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,903 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,903 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,903 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,904 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,904 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,904 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,904 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,904 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,905 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,905 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,905 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,905 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,906 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,906 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,906 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,906 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,906 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,907 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,907 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,907 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,909 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,910 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,910 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,910 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,910 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,910 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,915 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,916 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,916 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,916 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,916 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,917 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:31:18,919 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-11 02:31:18,929 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-10-11 02:31:18,946 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:31:18,947 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:31:18,947 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:31:18,947 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:31:18,947 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:31:18,947 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:31:18,947 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:31:18,947 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:31:18,959 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-11 02:31:18,961 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 60 transitions, 130 flow [2021-10-11 02:31:18,964 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 60 transitions, 130 flow [2021-10-11 02:31:18,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 130 flow [2021-10-11 02:31:19,013 INFO L129 PetriNetUnfolder]: 5/58 cut-off events. [2021-10-11 02:31:19,013 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-11 02:31:19,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 58 events. 5/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2021-10-11 02:31:19,020 INFO L116 LiptonReduction]: Number of co-enabled transitions 968 [2021-10-11 02:31:21,621 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-10-11 02:31:21,813 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-10-11 02:31:22,586 WARN L197 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2021-10-11 02:31:22,741 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-10-11 02:31:23,065 WARN L197 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2021-10-11 02:31:23,220 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-10-11 02:31:23,290 INFO L131 LiptonReduction]: Checked pairs total: 998 [2021-10-11 02:31:23,291 INFO L133 LiptonReduction]: Total number of compositions: 52 [2021-10-11 02:31:23,297 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2021-10-11 02:31:23,319 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2021-10-11 02:31:23,321 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2021-10-11 02:31:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-11 02:31:23,338 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:23,339 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-11 02:31:23,339 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:23,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:23,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1332860337, now seen corresponding path program 1 times [2021-10-11 02:31:23,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:23,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351844797] [2021-10-11 02:31:23,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:23,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351844797] [2021-10-11 02:31:23,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:31:23,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:31:23,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682915019] [2021-10-11 02:31:23,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:31:23,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:23,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:31:23,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:31:23,718 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2021-10-11 02:31:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:23,795 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2021-10-11 02:31:23,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:31:23,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2021-10-11 02:31:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:23,810 INFO L225 Difference]: With dead ends: 59 [2021-10-11 02:31:23,810 INFO L226 Difference]: Without dead ends: 38 [2021-10-11 02:31:23,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:31:23,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-10-11 02:31:23,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-10-11 02:31:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-10-11 02:31:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 92 transitions. [2021-10-11 02:31:23,853 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 92 transitions. Word has length 6 [2021-10-11 02:31:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:23,853 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 92 transitions. [2021-10-11 02:31:23,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:31:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 92 transitions. [2021-10-11 02:31:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-11 02:31:23,854 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:23,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:23,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:31:23,854 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:23,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:23,855 INFO L82 PathProgramCache]: Analyzing trace with hash -978539367, now seen corresponding path program 1 times [2021-10-11 02:31:23,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:23,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346010459] [2021-10-11 02:31:23,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:24,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346010459] [2021-10-11 02:31:24,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:31:24,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:31:24,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786548712] [2021-10-11 02:31:24,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:31:24,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:24,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:31:24,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:31:24,018 INFO L87 Difference]: Start difference. First operand 38 states and 92 transitions. Second operand 5 states. [2021-10-11 02:31:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:24,074 INFO L93 Difference]: Finished difference Result 82 states and 192 transitions. [2021-10-11 02:31:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:31:24,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2021-10-11 02:31:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:24,077 INFO L225 Difference]: With dead ends: 82 [2021-10-11 02:31:24,077 INFO L226 Difference]: Without dead ends: 74 [2021-10-11 02:31:24,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:31:24,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-10-11 02:31:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2021-10-11 02:31:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-10-11 02:31:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 129 transitions. [2021-10-11 02:31:24,089 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 129 transitions. Word has length 8 [2021-10-11 02:31:24,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:24,089 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 129 transitions. [2021-10-11 02:31:24,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:31:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 129 transitions. [2021-10-11 02:31:24,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-11 02:31:24,090 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:24,091 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:24,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:31:24,091 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:24,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:24,091 INFO L82 PathProgramCache]: Analyzing trace with hash -978459387, now seen corresponding path program 2 times [2021-10-11 02:31:24,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:24,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827337774] [2021-10-11 02:31:24,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:24,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827337774] [2021-10-11 02:31:24,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:31:24,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:31:24,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646003710] [2021-10-11 02:31:24,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:31:24,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:24,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:31:24,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:31:24,188 INFO L87 Difference]: Start difference. First operand 52 states and 129 transitions. Second operand 5 states. [2021-10-11 02:31:24,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:24,276 INFO L93 Difference]: Finished difference Result 62 states and 143 transitions. [2021-10-11 02:31:24,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:31:24,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2021-10-11 02:31:24,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:24,277 INFO L225 Difference]: With dead ends: 62 [2021-10-11 02:31:24,278 INFO L226 Difference]: Without dead ends: 50 [2021-10-11 02:31:24,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:31:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-10-11 02:31:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2021-10-11 02:31:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2021-10-11 02:31:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2021-10-11 02:31:24,286 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 100 transitions. Word has length 8 [2021-10-11 02:31:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:24,290 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 100 transitions. [2021-10-11 02:31:24,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:31:24,290 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 100 transitions. [2021-10-11 02:31:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:31:24,292 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:24,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:24,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:31:24,293 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:24,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:24,293 INFO L82 PathProgramCache]: Analyzing trace with hash 220478720, now seen corresponding path program 1 times [2021-10-11 02:31:24,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:24,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962703189] [2021-10-11 02:31:24,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:24,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962703189] [2021-10-11 02:31:24,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:31:24,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:31:24,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788236497] [2021-10-11 02:31:24,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:31:24,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:24,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:31:24,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:31:24,389 INFO L87 Difference]: Start difference. First operand 42 states and 100 transitions. Second operand 6 states. [2021-10-11 02:31:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:24,498 INFO L93 Difference]: Finished difference Result 58 states and 132 transitions. [2021-10-11 02:31:24,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:31:24,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2021-10-11 02:31:24,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:24,501 INFO L225 Difference]: With dead ends: 58 [2021-10-11 02:31:24,501 INFO L226 Difference]: Without dead ends: 51 [2021-10-11 02:31:24,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:31:24,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-10-11 02:31:24,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2021-10-11 02:31:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2021-10-11 02:31:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 107 transitions. [2021-10-11 02:31:24,521 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 107 transitions. Word has length 10 [2021-10-11 02:31:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:24,521 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 107 transitions. [2021-10-11 02:31:24,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:31:24,521 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 107 transitions. [2021-10-11 02:31:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:31:24,522 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:24,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:24,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:31:24,523 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:24,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:24,523 INFO L82 PathProgramCache]: Analyzing trace with hash 266866190, now seen corresponding path program 2 times [2021-10-11 02:31:24,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:24,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375330368] [2021-10-11 02:31:24,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:24,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375330368] [2021-10-11 02:31:24,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:31:24,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:31:24,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794978276] [2021-10-11 02:31:24,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:31:24,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:24,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:31:24,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:31:24,608 INFO L87 Difference]: Start difference. First operand 45 states and 107 transitions. Second operand 6 states. [2021-10-11 02:31:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:24,709 INFO L93 Difference]: Finished difference Result 78 states and 180 transitions. [2021-10-11 02:31:24,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:31:24,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2021-10-11 02:31:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:24,712 INFO L225 Difference]: With dead ends: 78 [2021-10-11 02:31:24,712 INFO L226 Difference]: Without dead ends: 71 [2021-10-11 02:31:24,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:31:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-10-11 02:31:24,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2021-10-11 02:31:24,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-10-11 02:31:24,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 113 transitions. [2021-10-11 02:31:24,719 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 113 transitions. Word has length 10 [2021-10-11 02:31:24,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:24,720 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 113 transitions. [2021-10-11 02:31:24,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:31:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 113 transitions. [2021-10-11 02:31:24,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:31:24,721 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:24,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:24,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:31:24,721 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:24,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:24,722 INFO L82 PathProgramCache]: Analyzing trace with hash 266888510, now seen corresponding path program 3 times [2021-10-11 02:31:24,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:24,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334094738] [2021-10-11 02:31:24,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:24,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334094738] [2021-10-11 02:31:24,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:31:24,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:31:24,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555164095] [2021-10-11 02:31:24,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:31:24,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:24,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:31:24,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:31:24,826 INFO L87 Difference]: Start difference. First operand 46 states and 113 transitions. Second operand 6 states. [2021-10-11 02:31:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:24,953 INFO L93 Difference]: Finished difference Result 58 states and 137 transitions. [2021-10-11 02:31:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:31:24,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2021-10-11 02:31:24,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:24,958 INFO L225 Difference]: With dead ends: 58 [2021-10-11 02:31:24,958 INFO L226 Difference]: Without dead ends: 42 [2021-10-11 02:31:24,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:31:24,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-10-11 02:31:24,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2021-10-11 02:31:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2021-10-11 02:31:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 82 transitions. [2021-10-11 02:31:24,964 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 82 transitions. Word has length 10 [2021-10-11 02:31:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:24,964 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 82 transitions. [2021-10-11 02:31:24,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:31:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 82 transitions. [2021-10-11 02:31:24,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:31:24,965 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:24,965 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:24,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:31:24,965 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:24,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:24,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1755209235, now seen corresponding path program 4 times [2021-10-11 02:31:24,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:24,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743570704] [2021-10-11 02:31:24,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:25,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743570704] [2021-10-11 02:31:25,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356489373] [2021-10-11 02:31:25,061 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:25,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-11 02:31:25,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:25,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:25,319 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:31:25,319 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:25,351 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:25,402 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:25,427 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:25,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:25,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1512272962] [2021-10-11 02:31:25,478 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:1603) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2021-10-11 02:31:25,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:25,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-10-11 02:31:25,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104274309] [2021-10-11 02:31:25,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-10-11 02:31:25,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:25,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-11 02:31:25,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:31:25,483 INFO L87 Difference]: Start difference. First operand 34 states and 82 transitions. Second operand 12 states. [2021-10-11 02:31:25,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:25,850 INFO L93 Difference]: Finished difference Result 70 states and 157 transitions. [2021-10-11 02:31:25,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-11 02:31:25,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2021-10-11 02:31:25,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:25,853 INFO L225 Difference]: With dead ends: 70 [2021-10-11 02:31:25,853 INFO L226 Difference]: Without dead ends: 52 [2021-10-11 02:31:25,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-10-11 02:31:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-10-11 02:31:25,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2021-10-11 02:31:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2021-10-11 02:31:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 113 transitions. [2021-10-11 02:31:25,870 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 113 transitions. Word has length 11 [2021-10-11 02:31:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:25,871 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 113 transitions. [2021-10-11 02:31:25,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-10-11 02:31:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 113 transitions. [2021-10-11 02:31:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:31:25,877 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:25,877 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:26,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-10-11 02:31:26,109 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:26,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:26,110 INFO L82 PathProgramCache]: Analyzing trace with hash -319965345, now seen corresponding path program 5 times [2021-10-11 02:31:26,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:26,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251167652] [2021-10-11 02:31:26,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:26,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251167652] [2021-10-11 02:31:26,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952556443] [2021-10-11 02:31:26,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:26,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-11 02:31:26,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:31:26,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-11 02:31:26,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:26,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:26,392 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:31:26,392 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:26,415 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:26,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [24622815] [2021-10-11 02:31:26,509 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:1603) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2021-10-11 02:31:26,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:26,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-10-11 02:31:26,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311676567] [2021-10-11 02:31:26,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-10-11 02:31:26,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:26,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-11 02:31:26,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:31:26,518 INFO L87 Difference]: Start difference. First operand 48 states and 113 transitions. Second operand 12 states. [2021-10-11 02:31:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:26,997 INFO L93 Difference]: Finished difference Result 111 states and 257 transitions. [2021-10-11 02:31:26,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-11 02:31:26,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2021-10-11 02:31:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:27,000 INFO L225 Difference]: With dead ends: 111 [2021-10-11 02:31:27,000 INFO L226 Difference]: Without dead ends: 84 [2021-10-11 02:31:27,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2021-10-11 02:31:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-10-11 02:31:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 55. [2021-10-11 02:31:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2021-10-11 02:31:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 137 transitions. [2021-10-11 02:31:27,008 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 137 transitions. Word has length 11 [2021-10-11 02:31:27,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:27,008 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 137 transitions. [2021-10-11 02:31:27,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-10-11 02:31:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 137 transitions. [2021-10-11 02:31:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 02:31:27,009 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:27,009 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:27,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:27,223 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:27,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:27,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1426667684, now seen corresponding path program 6 times [2021-10-11 02:31:27,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:27,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845498144] [2021-10-11 02:31:27,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:27,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845498144] [2021-10-11 02:31:27,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029382329] [2021-10-11 02:31:27,372 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:27,467 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:31:27,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:31:27,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-11 02:31:27,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:27,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:27,528 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:31:27,528 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:27,554 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:27,601 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:27,642 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:27,672 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:27,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1704539587] [2021-10-11 02:31:27,738 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:1603) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2021-10-11 02:31:27,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:27,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2021-10-11 02:31:27,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324886028] [2021-10-11 02:31:27,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-10-11 02:31:27,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:27,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-11 02:31:27,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-10-11 02:31:27,742 INFO L87 Difference]: Start difference. First operand 55 states and 137 transitions. Second operand 15 states. [2021-10-11 02:31:28,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:28,100 INFO L93 Difference]: Finished difference Result 93 states and 213 transitions. [2021-10-11 02:31:28,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-11 02:31:28,100 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2021-10-11 02:31:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:28,101 INFO L225 Difference]: With dead ends: 93 [2021-10-11 02:31:28,101 INFO L226 Difference]: Without dead ends: 74 [2021-10-11 02:31:28,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2021-10-11 02:31:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-10-11 02:31:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2021-10-11 02:31:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2021-10-11 02:31:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 143 transitions. [2021-10-11 02:31:28,108 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 143 transitions. Word has length 12 [2021-10-11 02:31:28,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:28,108 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 143 transitions. [2021-10-11 02:31:28,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-10-11 02:31:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 143 transitions. [2021-10-11 02:31:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 02:31:28,109 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:28,109 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:28,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:28,321 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:28,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:28,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1239613902, now seen corresponding path program 7 times [2021-10-11 02:31:28,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:28,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574760833] [2021-10-11 02:31:28,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:28,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:28,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574760833] [2021-10-11 02:31:28,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610354074] [2021-10-11 02:31:28,429 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:28,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-11 02:31:28,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:28,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:28,569 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:31:28,569 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:28,592 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:28,627 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:28,653 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:28,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1888727103] [2021-10-11 02:31:28,725 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:1603) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2021-10-11 02:31:28,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:28,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-10-11 02:31:28,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48567432] [2021-10-11 02:31:28,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-10-11 02:31:28,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:28,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-11 02:31:28,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:31:28,729 INFO L87 Difference]: Start difference. First operand 58 states and 143 transitions. Second operand 14 states. [2021-10-11 02:31:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:29,121 INFO L93 Difference]: Finished difference Result 137 states and 309 transitions. [2021-10-11 02:31:29,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-11 02:31:29,122 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 12 [2021-10-11 02:31:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:29,123 INFO L225 Difference]: With dead ends: 137 [2021-10-11 02:31:29,123 INFO L226 Difference]: Without dead ends: 118 [2021-10-11 02:31:29,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2021-10-11 02:31:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-10-11 02:31:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 58. [2021-10-11 02:31:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2021-10-11 02:31:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 149 transitions. [2021-10-11 02:31:29,131 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 149 transitions. Word has length 12 [2021-10-11 02:31:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:29,131 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 149 transitions. [2021-10-11 02:31:29,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-10-11 02:31:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 149 transitions. [2021-10-11 02:31:29,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 02:31:29,132 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:29,132 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:29,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:29,349 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:29,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:29,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1217334822, now seen corresponding path program 8 times [2021-10-11 02:31:29,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:29,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684828397] [2021-10-11 02:31:29,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:29,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684828397] [2021-10-11 02:31:29,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486265825] [2021-10-11 02:31:29,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:29,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-11 02:31:29,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:31:29,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-11 02:31:29,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:29,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:29,603 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:31:29,603 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:29,648 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:29,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [86963138] [2021-10-11 02:31:29,739 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:1603) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2021-10-11 02:31:29,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:29,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2021-10-11 02:31:29,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867063251] [2021-10-11 02:31:29,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-10-11 02:31:29,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:29,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-11 02:31:29,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-10-11 02:31:29,745 INFO L87 Difference]: Start difference. First operand 58 states and 149 transitions. Second operand 15 states. [2021-10-11 02:31:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:30,354 INFO L93 Difference]: Finished difference Result 119 states and 281 transitions. [2021-10-11 02:31:30,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-11 02:31:30,354 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2021-10-11 02:31:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:30,355 INFO L225 Difference]: With dead ends: 119 [2021-10-11 02:31:30,355 INFO L226 Difference]: Without dead ends: 83 [2021-10-11 02:31:30,356 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2021-10-11 02:31:30,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-10-11 02:31:30,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 53. [2021-10-11 02:31:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-10-11 02:31:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 128 transitions. [2021-10-11 02:31:30,365 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 128 transitions. Word has length 12 [2021-10-11 02:31:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:30,365 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 128 transitions. [2021-10-11 02:31:30,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-10-11 02:31:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 128 transitions. [2021-10-11 02:31:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:31:30,366 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:30,366 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:30,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-10-11 02:31:30,577 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:30,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:30,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1385885646, now seen corresponding path program 9 times [2021-10-11 02:31:30,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:30,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88712805] [2021-10-11 02:31:30,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:30,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88712805] [2021-10-11 02:31:30,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254193751] [2021-10-11 02:31:30,714 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:30,795 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:31:30,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:31:30,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-11 02:31:30,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:30,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:31:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:30,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:30,863 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:31:30,864 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:30,905 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:31,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [567824484] [2021-10-11 02:31:31,116 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:1603) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2021-10-11 02:31:31,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:31,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2021-10-11 02:31:31,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007399909] [2021-10-11 02:31:31,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-10-11 02:31:31,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:31,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-11 02:31:31,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2021-10-11 02:31:31,118 INFO L87 Difference]: Start difference. First operand 53 states and 128 transitions. Second operand 23 states. [2021-10-11 02:31:32,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:32,367 INFO L93 Difference]: Finished difference Result 150 states and 363 transitions. [2021-10-11 02:31:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-11 02:31:32,368 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2021-10-11 02:31:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:32,369 INFO L225 Difference]: With dead ends: 150 [2021-10-11 02:31:32,369 INFO L226 Difference]: Without dead ends: 93 [2021-10-11 02:31:32,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=980, Invalid=2100, Unknown=0, NotChecked=0, Total=3080 [2021-10-11 02:31:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-10-11 02:31:32,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 66. [2021-10-11 02:31:32,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-10-11 02:31:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 161 transitions. [2021-10-11 02:31:32,375 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 161 transitions. Word has length 16 [2021-10-11 02:31:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:32,375 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 161 transitions. [2021-10-11 02:31:32,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-10-11 02:31:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 161 transitions. [2021-10-11 02:31:32,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:31:32,376 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:32,376 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:32,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:32,590 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:32,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:32,590 INFO L82 PathProgramCache]: Analyzing trace with hash -985011240, now seen corresponding path program 10 times [2021-10-11 02:31:32,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:32,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968931914] [2021-10-11 02:31:32,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:32,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968931914] [2021-10-11 02:31:32,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893684577] [2021-10-11 02:31:32,898 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:33,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjunts are in the unsatisfiable core [2021-10-11 02:31:33,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:33,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:33,118 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:31:33,119 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:33,157 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:33,196 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:33,237 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:33,275 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:33,323 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:33,371 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:33,423 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:33,463 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:33,512 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:33,556 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:33,590 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:33,641 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:33,693 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:33,730 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:33,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1639088330] [2021-10-11 02:31:33,796 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:1603) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2021-10-11 02:31:33,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:33,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 33 [2021-10-11 02:31:33,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290810215] [2021-10-11 02:31:33,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-10-11 02:31:33,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:33,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-10-11 02:31:33,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2021-10-11 02:31:33,798 INFO L87 Difference]: Start difference. First operand 66 states and 161 transitions. Second operand 35 states. [2021-10-11 02:31:35,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:35,080 INFO L93 Difference]: Finished difference Result 163 states and 356 transitions. [2021-10-11 02:31:35,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-10-11 02:31:35,081 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 22 [2021-10-11 02:31:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:35,082 INFO L225 Difference]: With dead ends: 163 [2021-10-11 02:31:35,082 INFO L226 Difference]: Without dead ends: 114 [2021-10-11 02:31:35,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1265, Invalid=2895, Unknown=0, NotChecked=0, Total=4160 [2021-10-11 02:31:35,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-10-11 02:31:35,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 82. [2021-10-11 02:31:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2021-10-11 02:31:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 194 transitions. [2021-10-11 02:31:35,089 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 194 transitions. Word has length 22 [2021-10-11 02:31:35,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:35,089 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 194 transitions. [2021-10-11 02:31:35,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2021-10-11 02:31:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 194 transitions. [2021-10-11 02:31:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:31:35,090 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:35,090 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:35,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:35,297 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:35,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:35,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1090086938, now seen corresponding path program 11 times [2021-10-11 02:31:35,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:35,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227112005] [2021-10-11 02:31:35,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:35,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227112005] [2021-10-11 02:31:35,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222078147] [2021-10-11 02:31:35,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:35,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-10-11 02:31:35,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:31:35,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-11 02:31:35,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:35,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:35,765 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:31:35,767 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:35,812 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:35,841 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:35,870 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:35,898 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:35,935 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:35,969 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:36,012 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:36,045 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:36,084 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:36,121 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:36,155 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:36,194 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:36,226 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:36,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1545650727] [2021-10-11 02:31:36,328 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:1603) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2021-10-11 02:31:36,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:36,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2021-10-11 02:31:36,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548056851] [2021-10-11 02:31:36,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-10-11 02:31:36,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:36,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-10-11 02:31:36,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2021-10-11 02:31:36,331 INFO L87 Difference]: Start difference. First operand 82 states and 194 transitions. Second operand 34 states. [2021-10-11 02:31:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:37,384 INFO L93 Difference]: Finished difference Result 238 states and 509 transitions. [2021-10-11 02:31:37,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-11 02:31:37,385 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2021-10-11 02:31:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:37,386 INFO L225 Difference]: With dead ends: 238 [2021-10-11 02:31:37,386 INFO L226 Difference]: Without dead ends: 189 [2021-10-11 02:31:37,387 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1293, Invalid=3129, Unknown=0, NotChecked=0, Total=4422 [2021-10-11 02:31:37,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-10-11 02:31:37,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 85. [2021-10-11 02:31:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-10-11 02:31:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 203 transitions. [2021-10-11 02:31:37,392 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 203 transitions. Word has length 22 [2021-10-11 02:31:37,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:37,392 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 203 transitions. [2021-10-11 02:31:37,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2021-10-11 02:31:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 203 transitions. [2021-10-11 02:31:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:31:37,393 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:37,393 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:37,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-11 02:31:37,601 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:37,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:37,602 INFO L82 PathProgramCache]: Analyzing trace with hash -825842986, now seen corresponding path program 12 times [2021-10-11 02:31:37,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:37,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147078269] [2021-10-11 02:31:37,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:37,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147078269] [2021-10-11 02:31:37,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185471114] [2021-10-11 02:31:37,891 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:37,998 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:31:37,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:31:38,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-11 02:31:38,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:38,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:38,062 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:31:38,063 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:38,093 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:38,124 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:38,154 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:38,189 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:38,224 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:38,251 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:38,279 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:38,309 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:38,340 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:38,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [630782264] [2021-10-11 02:31:38,560 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:1603) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2021-10-11 02:31:38,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:38,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2021-10-11 02:31:38,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567939310] [2021-10-11 02:31:38,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-10-11 02:31:38,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:38,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-10-11 02:31:38,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2021-10-11 02:31:38,562 INFO L87 Difference]: Start difference. First operand 85 states and 203 transitions. Second operand 34 states. [2021-10-11 02:31:39,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:39,988 INFO L93 Difference]: Finished difference Result 242 states and 525 transitions. [2021-10-11 02:31:39,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-10-11 02:31:39,989 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2021-10-11 02:31:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:39,990 INFO L225 Difference]: With dead ends: 242 [2021-10-11 02:31:39,990 INFO L226 Difference]: Without dead ends: 191 [2021-10-11 02:31:39,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1487, Invalid=4063, Unknown=0, NotChecked=0, Total=5550 [2021-10-11 02:31:39,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-10-11 02:31:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 94. [2021-10-11 02:31:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-10-11 02:31:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 229 transitions. [2021-10-11 02:31:39,998 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 229 transitions. Word has length 22 [2021-10-11 02:31:39,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:39,998 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 229 transitions. [2021-10-11 02:31:39,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2021-10-11 02:31:39,998 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 229 transitions. [2021-10-11 02:31:39,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:31:39,999 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:39,999 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:40,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-10-11 02:31:40,215 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:40,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:40,215 INFO L82 PathProgramCache]: Analyzing trace with hash 382967990, now seen corresponding path program 13 times [2021-10-11 02:31:40,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:40,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449893093] [2021-10-11 02:31:40,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:40,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449893093] [2021-10-11 02:31:40,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591978447] [2021-10-11 02:31:40,460 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:40,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-11 02:31:40,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:40,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:40,594 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:31:40,595 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:40,622 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:41,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [902419175] [2021-10-11 02:31:41,037 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:1603) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2021-10-11 02:31:41,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:41,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2021-10-11 02:31:41,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228231668] [2021-10-11 02:31:41,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-10-11 02:31:41,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:41,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-10-11 02:31:41,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2021-10-11 02:31:41,039 INFO L87 Difference]: Start difference. First operand 94 states and 229 transitions. Second operand 34 states. [2021-10-11 02:31:43,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:43,401 INFO L93 Difference]: Finished difference Result 302 states and 711 transitions. [2021-10-11 02:31:43,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-10-11 02:31:43,401 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2021-10-11 02:31:43,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:43,403 INFO L225 Difference]: With dead ends: 302 [2021-10-11 02:31:43,404 INFO L226 Difference]: Without dead ends: 203 [2021-10-11 02:31:43,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2389 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2499, Invalid=5691, Unknown=0, NotChecked=0, Total=8190 [2021-10-11 02:31:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-10-11 02:31:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 96. [2021-10-11 02:31:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2021-10-11 02:31:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 240 transitions. [2021-10-11 02:31:43,412 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 240 transitions. Word has length 22 [2021-10-11 02:31:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:43,412 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 240 transitions. [2021-10-11 02:31:43,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2021-10-11 02:31:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 240 transitions. [2021-10-11 02:31:43,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-11 02:31:43,414 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:43,414 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:43,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-11 02:31:43,637 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:43,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:43,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1762907359, now seen corresponding path program 14 times [2021-10-11 02:31:43,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:43,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467600997] [2021-10-11 02:31:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:44,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467600997] [2021-10-11 02:31:44,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730002388] [2021-10-11 02:31:44,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:44,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2021-10-11 02:31:44,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:31:44,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 35 conjunts are in the unsatisfiable core [2021-10-11 02:31:44,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:44,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:44,611 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:31:44,611 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:44,671 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:45,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [973465896] [2021-10-11 02:31:45,694 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:1603) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2021-10-11 02:31:45,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:45,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 59 [2021-10-11 02:31:45,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967731628] [2021-10-11 02:31:45,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-10-11 02:31:45,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:45,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-10-11 02:31:45,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=856, Invalid=2804, Unknown=0, NotChecked=0, Total=3660 [2021-10-11 02:31:45,705 INFO L87 Difference]: Start difference. First operand 96 states and 240 transitions. Second operand 61 states. [2021-10-11 02:31:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:49,925 INFO L93 Difference]: Finished difference Result 304 states and 737 transitions. [2021-10-11 02:31:49,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-10-11 02:31:49,926 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 35 [2021-10-11 02:31:49,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:49,927 INFO L225 Difference]: With dead ends: 304 [2021-10-11 02:31:49,928 INFO L226 Difference]: Without dead ends: 206 [2021-10-11 02:31:49,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6138, Invalid=14454, Unknown=0, NotChecked=0, Total=20592 [2021-10-11 02:31:49,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-10-11 02:31:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 117. [2021-10-11 02:31:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2021-10-11 02:31:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 287 transitions. [2021-10-11 02:31:49,938 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 287 transitions. Word has length 35 [2021-10-11 02:31:49,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:49,938 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 287 transitions. [2021-10-11 02:31:49,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2021-10-11 02:31:49,939 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 287 transitions. [2021-10-11 02:31:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-11 02:31:49,940 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:49,940 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:50,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-11 02:31:50,145 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:50,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:50,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2024056099, now seen corresponding path program 15 times [2021-10-11 02:31:50,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:50,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61844512] [2021-10-11 02:31:50,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:31:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:51,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61844512] [2021-10-11 02:31:51,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253727797] [2021-10-11 02:31:51,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:31:51,375 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:31:51,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:31:51,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 45 conjunts are in the unsatisfiable core [2021-10-11 02:31:51,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:31:51,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:31:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:51,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:31:51,558 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2021-10-11 02:31:51,559 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:51,563 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:31:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:31:51,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [97394408] [2021-10-11 02:31:51,728 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) 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:1603) 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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2021-10-11 02:31:51,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:31:51,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 43 [2021-10-11 02:31:51,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114120396] [2021-10-11 02:31:51,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-10-11 02:31:51,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:31:51,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-10-11 02:31:51,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1528, Unknown=0, NotChecked=0, Total=1980 [2021-10-11 02:31:51,730 INFO L87 Difference]: Start difference. First operand 117 states and 287 transitions. Second operand 45 states. [2021-10-11 02:31:55,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:31:55,657 INFO L93 Difference]: Finished difference Result 204 states and 503 transitions. [2021-10-11 02:31:55,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-10-11 02:31:55,666 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 47 [2021-10-11 02:31:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:31:55,668 INFO L225 Difference]: With dead ends: 204 [2021-10-11 02:31:55,668 INFO L226 Difference]: Without dead ends: 199 [2021-10-11 02:31:55,670 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4582, Invalid=10180, Unknown=0, NotChecked=0, Total=14762 [2021-10-11 02:31:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-11 02:31:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 157. [2021-10-11 02:31:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2021-10-11 02:31:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 407 transitions. [2021-10-11 02:31:55,676 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 407 transitions. Word has length 47 [2021-10-11 02:31:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:31:55,677 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 407 transitions. [2021-10-11 02:31:55,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2021-10-11 02:31:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 407 transitions. [2021-10-11 02:31:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-11 02:31:55,678 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:31:55,678 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:31:55,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-11 02:31:55,885 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:31:55,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:31:55,886 INFO L82 PathProgramCache]: Analyzing trace with hash 988526380, now seen corresponding path program 16 times [2021-10-11 02:31:55,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:31:55,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219510434] [2021-10-11 02:31:55,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:31:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:31:55,924 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:31:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:31:55,989 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:31:56,037 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-11 02:31:56,038 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 02:31:56,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-11 02:31:56,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:31:56 BasicIcfg [2021-10-11 02:31:56,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:31:56,161 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:31:56,161 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:31:56,162 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:31:56,162 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:31:18" (3/4) ... [2021-10-11 02:31:56,164 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 02:31:56,278 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fe78ab9-55e6-4493-8610-dead8b113d25/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:31:56,279 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:31:56,280 INFO L168 Benchmark]: Toolchain (without parser) took 38730.67 ms. Allocated memory was 100.7 MB in the beginning and 264.2 MB in the end (delta: 163.6 MB). Free memory was 67.8 MB in the beginning and 205.8 MB in the end (delta: -138.0 MB). Peak memory consumption was 25.3 MB. Max. memory is 16.1 GB. [2021-10-11 02:31:56,280 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 100.7 MB. Free memory was 57.6 MB in the beginning and 57.5 MB in the end (delta: 76.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:31:56,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 558.43 ms. Allocated memory was 100.7 MB in the beginning and 142.6 MB in the end (delta: 41.9 MB). Free memory was 67.6 MB in the beginning and 98.7 MB in the end (delta: -31.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:31:56,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.75 ms. Allocated memory is still 142.6 MB. Free memory was 98.7 MB in the beginning and 97.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:31:56,282 INFO L168 Benchmark]: Boogie Preprocessor took 27.17 ms. Allocated memory is still 142.6 MB. Free memory was 97.2 MB in the beginning and 95.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:31:56,282 INFO L168 Benchmark]: RCFGBuilder took 650.71 ms. Allocated memory is still 142.6 MB. Free memory was 95.8 MB in the beginning and 75.6 MB in the end (delta: 20.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-11 02:31:56,283 INFO L168 Benchmark]: TraceAbstraction took 37327.65 ms. Allocated memory was 142.6 MB in the beginning and 264.2 MB in the end (delta: 121.6 MB). Free memory was 75.5 MB in the beginning and 219.5 MB in the end (delta: -144.0 MB). Peak memory consumption was 120.8 MB. Max. memory is 16.1 GB. [2021-10-11 02:31:56,284 INFO L168 Benchmark]: Witness Printer took 117.80 ms. Allocated memory is still 264.2 MB. Free memory was 219.5 MB in the beginning and 205.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:31:56,286 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 100.7 MB. Free memory was 57.6 MB in the beginning and 57.5 MB in the end (delta: 76.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 558.43 ms. Allocated memory was 100.7 MB in the beginning and 142.6 MB in the end (delta: 41.9 MB). Free memory was 67.6 MB in the beginning and 98.7 MB in the end (delta: -31.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.75 ms. Allocated memory is still 142.6 MB. Free memory was 98.7 MB in the beginning and 97.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.17 ms. Allocated memory is still 142.6 MB. Free memory was 97.2 MB in the beginning and 95.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 650.71 ms. Allocated memory is still 142.6 MB. Free memory was 95.8 MB in the beginning and 75.6 MB in the end (delta: 20.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 37327.65 ms. Allocated memory was 142.6 MB in the beginning and 264.2 MB in the end (delta: 121.6 MB). Free memory was 75.5 MB in the beginning and 219.5 MB in the end (delta: -144.0 MB). Peak memory consumption was 120.8 MB. Max. memory is 16.1 GB. * Witness Printer took 117.80 ms. Allocated memory is still 264.2 MB. Free memory was 219.5 MB in the beginning and 205.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 645 VarBasedMoverChecksPositive, 20 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 20 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.2s, 20 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.3s, 62 PlacesBefore, 20 PlacesAfterwards, 60 TransitionsBefore, 16 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 5 FixpointIterations, 16 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 52 TotalNumberOfCompositions, 998 MoverChecksTotal - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=3, j=6] [L716] 0 int condI = i >= (2*20 +6); VAL [arg={0:0}, arg={0:0}, i=3, j=6] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=2, k=1] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=4, k=3] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=9, k=8] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=12, k=11] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=14, k=13] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=17, k=16] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=18, k=17] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=20] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] [L719] 0 int condJ = j >= (2*20 +6); [L721] COND TRUE 0 condI || condJ [L722] 0 reach_error() VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 37.0s, OverallIterations: 19, TraceHistogramMax: 20, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 256 SDtfs, 2786 SDslu, 1347 SDs, 0 SdLazy, 1713 SolverSat, 2371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1086 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 760 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17977 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 706 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 588 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 742 ConstructedInterpolants, 0 QuantifiedInterpolants, 71762 SizeOfPredicates, 155 NumberOfNonLiveVariables, 1700 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 42 InterpolantComputations, 6 PerfectInterpolantSequences, 0/2154 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...