./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longer-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan --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 ff437623f349039c7c835e26d53647ec95811c37 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-a4ecdab [2020-11-30 01:41:09,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:41:09,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:41:09,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:41:09,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:41:09,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:41:09,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:41:09,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:41:09,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:41:09,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:41:09,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:41:09,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:41:09,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:41:09,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:41:09,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:41:09,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:41:09,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:41:09,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:41:09,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:41:09,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:41:09,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:41:09,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:41:09,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:41:09,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:41:09,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:41:09,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:41:09,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:41:09,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:41:09,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:41:09,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:41:09,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:41:09,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:41:09,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:41:09,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:41:09,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:41:09,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:41:09,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:41:09,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:41:09,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:41:09,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:41:09,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:41:09,675 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 01:41:09,723 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:41:09,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:41:09,725 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 01:41:09,726 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 01:41:09,726 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 01:41:09,726 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 01:41:09,726 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 01:41:09,726 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 01:41:09,727 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 01:41:09,727 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 01:41:09,728 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 01:41:09,728 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 01:41:09,729 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 01:41:09,729 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 01:41:09,729 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 01:41:09,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:41:09,730 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:41:09,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:41:09,731 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:41:09,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:41:09,731 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:41:09,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:41:09,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:41:09,732 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 01:41:09,732 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:41:09,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:41:09,732 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:41:09,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:41:09,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:41:09,733 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:41:09,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:41:09,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:41:09,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:41:09,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:41:09,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:41:09,735 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 01:41:09,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:41:09,735 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:41:09,735 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:41:09,735 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 01:41:09,736 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-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/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-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan 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 -> ff437623f349039c7c835e26d53647ec95811c37 [2020-11-30 01:41:10,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:41:10,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:41:10,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:41:10,120 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:41:10,121 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:41:10,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/../../sv-benchmarks/c/pthread/triangular-longer-2.i [2020-11-30 01:41:10,190 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/data/2bc9f4cd2/3f58f99b23a548d1af3bcc24eee73730/FLAGbc76a7b62 [2020-11-30 01:41:10,861 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:41:10,861 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/sv-benchmarks/c/pthread/triangular-longer-2.i [2020-11-30 01:41:10,877 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/data/2bc9f4cd2/3f58f99b23a548d1af3bcc24eee73730/FLAGbc76a7b62 [2020-11-30 01:41:11,136 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/data/2bc9f4cd2/3f58f99b23a548d1af3bcc24eee73730 [2020-11-30 01:41:11,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:41:11,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:41:11,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:41:11,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:41:11,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:41:11,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:41:11" (1/1) ... [2020-11-30 01:41:11,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157c993e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:11, skipping insertion in model container [2020-11-30 01:41:11,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:41:11" (1/1) ... [2020-11-30 01:41:11,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:41:11,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:41:11,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:41:11,763 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:41:11,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:41:11,879 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:41:11,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:11 WrapperNode [2020-11-30 01:41:11,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:41:11,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:41:11,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:41:11,882 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:41:11,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:11" (1/1) ... [2020-11-30 01:41:11,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:11" (1/1) ... [2020-11-30 01:41:11,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:41:11,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:41:11,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:41:11,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:41:11,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:11" (1/1) ... [2020-11-30 01:41:11,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:11" (1/1) ... [2020-11-30 01:41:11,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:11" (1/1) ... [2020-11-30 01:41:11,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:11" (1/1) ... [2020-11-30 01:41:11,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:11" (1/1) ... [2020-11-30 01:41:11,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:11" (1/1) ... [2020-11-30 01:41:11,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:11" (1/1) ... [2020-11-30 01:41:11,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:41:11,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:41:11,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:41:11,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:41:11,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/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 [2020-11-30 01:41:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-11-30 01:41:12,044 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-11-30 01:41:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-11-30 01:41:12,044 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-11-30 01:41:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 01:41:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-30 01:41:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:41:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:41:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:41:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-30 01:41:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:41:12,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:41:12,049 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-30 01:41:12,514 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:41:12,515 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-11-30 01:41:12,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:41:12 BoogieIcfgContainer [2020-11-30 01:41:12,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:41:12,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:41:12,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:41:12,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:41:12,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:41:11" (1/3) ... [2020-11-30 01:41:12,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df0d50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:41:12, skipping insertion in model container [2020-11-30 01:41:12,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:11" (2/3) ... [2020-11-30 01:41:12,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df0d50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:41:12, skipping insertion in model container [2020-11-30 01:41:12,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:41:12" (3/3) ... [2020-11-30 01:41:12,529 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2020-11-30 01:41:12,543 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 01:41:12,543 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:41:12,548 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 01:41:12,549 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 01:41:12,577 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,577 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,578 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,578 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,578 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,578 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,579 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,579 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,579 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,579 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,579 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,580 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,580 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,580 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,581 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,581 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,581 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,581 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,581 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,582 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,582 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,582 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,582 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,583 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,583 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,583 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,583 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,583 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,585 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,586 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,586 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,586 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,586 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,587 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,591 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,592 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,592 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,592 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,592 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,593 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 01:41:12,597 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-30 01:41:12,609 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-11-30 01:41:12,630 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:41:12,630 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:41:12,630 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:41:12,631 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:41:12,631 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:41:12,631 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:41:12,631 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:41:12,631 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:41:12,642 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 01:41:12,644 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 64 transitions, 138 flow [2020-11-30 01:41:12,648 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 64 transitions, 138 flow [2020-11-30 01:41:12,650 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 65 places, 64 transitions, 138 flow [2020-11-30 01:41:12,689 INFO L129 PetriNetUnfolder]: 6/62 cut-off events. [2020-11-30 01:41:12,689 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-30 01:41:12,694 INFO L80 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 62 events. 6/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-11-30 01:41:12,697 INFO L116 LiptonReduction]: Number of co-enabled transitions 1144 [2020-11-30 01:41:14,408 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-11-30 01:41:14,820 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-11-30 01:41:14,969 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-30 01:41:14,981 INFO L131 LiptonReduction]: Checked pairs total: 1062 [2020-11-30 01:41:14,981 INFO L133 LiptonReduction]: Total number of compositions: 60 [2020-11-30 01:41:14,986 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2020-11-30 01:41:14,998 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-11-30 01:41:15,000 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-11-30 01:41:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-30 01:41:15,005 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:15,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-30 01:41:15,006 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:15,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:15,011 INFO L82 PathProgramCache]: Analyzing trace with hash -720017533, now seen corresponding path program 1 times [2020-11-30 01:41:15,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:15,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574716641] [2020-11-30 01:41:15,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:15,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574716641] [2020-11-30 01:41:15,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:15,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:15,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066328040] [2020-11-30 01:41:15,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:41:15,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:15,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:41:15,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:41:15,304 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-11-30 01:41:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:15,379 INFO L93 Difference]: Finished difference Result 75 states and 190 transitions. [2020-11-30 01:41:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:41:15,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-11-30 01:41:15,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:15,394 INFO L225 Difference]: With dead ends: 75 [2020-11-30 01:41:15,395 INFO L226 Difference]: Without dead ends: 42 [2020-11-30 01:41:15,396 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 [2020-11-30 01:41:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-30 01:41:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-30 01:41:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-30 01:41:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2020-11-30 01:41:15,448 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 98 transitions. Word has length 6 [2020-11-30 01:41:15,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:15,449 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 98 transitions. [2020-11-30 01:41:15,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:41:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 98 transitions. [2020-11-30 01:41:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 01:41:15,450 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:15,451 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:15,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:41:15,452 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:15,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:15,455 INFO L82 PathProgramCache]: Analyzing trace with hash -447013893, now seen corresponding path program 1 times [2020-11-30 01:41:15,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:15,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487528875] [2020-11-30 01:41:15,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:15,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487528875] [2020-11-30 01:41:15,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:15,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:41:15,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390350258] [2020-11-30 01:41:15,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:41:15,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:15,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:41:15,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:41:15,626 INFO L87 Difference]: Start difference. First operand 42 states and 98 transitions. Second operand 5 states. [2020-11-30 01:41:15,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:15,693 INFO L93 Difference]: Finished difference Result 56 states and 130 transitions. [2020-11-30 01:41:15,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:41:15,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-11-30 01:41:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:15,696 INFO L225 Difference]: With dead ends: 56 [2020-11-30 01:41:15,696 INFO L226 Difference]: Without dead ends: 50 [2020-11-30 01:41:15,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:41:15,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-30 01:41:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2020-11-30 01:41:15,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-30 01:41:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2020-11-30 01:41:15,708 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 100 transitions. Word has length 8 [2020-11-30 01:41:15,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:15,709 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 100 transitions. [2020-11-30 01:41:15,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:41:15,710 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 100 transitions. [2020-11-30 01:41:15,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:41:15,712 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:15,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:15,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:41:15,713 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:15,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:15,714 INFO L82 PathProgramCache]: Analyzing trace with hash -190894617, now seen corresponding path program 1 times [2020-11-30 01:41:15,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:15,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079868088] [2020-11-30 01:41:15,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:15,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079868088] [2020-11-30 01:41:15,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:15,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:41:15,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370674395] [2020-11-30 01:41:15,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:41:15,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:15,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:41:15,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:41:15,822 INFO L87 Difference]: Start difference. First operand 42 states and 100 transitions. Second operand 6 states. [2020-11-30 01:41:15,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:15,938 INFO L93 Difference]: Finished difference Result 54 states and 124 transitions. [2020-11-30 01:41:15,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:41:15,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 01:41:15,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:15,943 INFO L225 Difference]: With dead ends: 54 [2020-11-30 01:41:15,943 INFO L226 Difference]: Without dead ends: 47 [2020-11-30 01:41:15,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:41:15,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-30 01:41:15,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-11-30 01:41:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-30 01:41:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 106 transitions. [2020-11-30 01:41:15,954 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 106 transitions. Word has length 10 [2020-11-30 01:41:15,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:15,954 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 106 transitions. [2020-11-30 01:41:15,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:41:15,955 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 106 transitions. [2020-11-30 01:41:15,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:41:15,956 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:15,956 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:15,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:41:15,956 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:15,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:15,957 INFO L82 PathProgramCache]: Analyzing trace with hash -83647017, now seen corresponding path program 2 times [2020-11-30 01:41:15,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:15,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525913551] [2020-11-30 01:41:15,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:16,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525913551] [2020-11-30 01:41:16,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:16,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:41:16,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687487539] [2020-11-30 01:41:16,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:41:16,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:16,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:41:16,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:41:16,025 INFO L87 Difference]: Start difference. First operand 45 states and 106 transitions. Second operand 6 states. [2020-11-30 01:41:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:16,120 INFO L93 Difference]: Finished difference Result 84 states and 192 transitions. [2020-11-30 01:41:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:41:16,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 01:41:16,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:16,122 INFO L225 Difference]: With dead ends: 84 [2020-11-30 01:41:16,122 INFO L226 Difference]: Without dead ends: 77 [2020-11-30 01:41:16,123 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 [2020-11-30 01:41:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-30 01:41:16,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2020-11-30 01:41:16,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-30 01:41:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 115 transitions. [2020-11-30 01:41:16,135 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 115 transitions. Word has length 10 [2020-11-30 01:41:16,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:16,135 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 115 transitions. [2020-11-30 01:41:16,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:41:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 115 transitions. [2020-11-30 01:41:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:41:16,136 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:16,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:16,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 01:41:16,137 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:16,138 INFO L82 PathProgramCache]: Analyzing trace with hash -83970657, now seen corresponding path program 3 times [2020-11-30 01:41:16,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:16,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800562227] [2020-11-30 01:41:16,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:16,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800562227] [2020-11-30 01:41:16,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:16,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:41:16,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753660856] [2020-11-30 01:41:16,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:41:16,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:16,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:41:16,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:41:16,202 INFO L87 Difference]: Start difference. First operand 47 states and 115 transitions. Second operand 6 states. [2020-11-30 01:41:16,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:16,291 INFO L93 Difference]: Finished difference Result 61 states and 139 transitions. [2020-11-30 01:41:16,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:41:16,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 01:41:16,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:16,293 INFO L225 Difference]: With dead ends: 61 [2020-11-30 01:41:16,293 INFO L226 Difference]: Without dead ends: 50 [2020-11-30 01:41:16,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:41:16,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-30 01:41:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2020-11-30 01:41:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-30 01:41:16,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 96 transitions. [2020-11-30 01:41:16,301 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 96 transitions. Word has length 10 [2020-11-30 01:41:16,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:16,301 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 96 transitions. [2020-11-30 01:41:16,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:41:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 96 transitions. [2020-11-30 01:41:16,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:41:16,302 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:16,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:16,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 01:41:16,303 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:16,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash -118912617, now seen corresponding path program 4 times [2020-11-30 01:41:16,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:16,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095813437] [2020-11-30 01:41:16,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:16,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095813437] [2020-11-30 01:41:16,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:16,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:41:16,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712404815] [2020-11-30 01:41:16,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:41:16,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:16,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:41:16,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:41:16,389 INFO L87 Difference]: Start difference. First operand 40 states and 96 transitions. Second operand 6 states. [2020-11-30 01:41:16,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:16,521 INFO L93 Difference]: Finished difference Result 55 states and 129 transitions. [2020-11-30 01:41:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:41:16,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-30 01:41:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:16,526 INFO L225 Difference]: With dead ends: 55 [2020-11-30 01:41:16,526 INFO L226 Difference]: Without dead ends: 49 [2020-11-30 01:41:16,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:41:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-30 01:41:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2020-11-30 01:41:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-30 01:41:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 99 transitions. [2020-11-30 01:41:16,538 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 99 transitions. Word has length 10 [2020-11-30 01:41:16,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:16,538 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 99 transitions. [2020-11-30 01:41:16,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:41:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 99 transitions. [2020-11-30 01:41:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 01:41:16,539 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:16,539 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:16,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 01:41:16,539 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:16,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:16,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1691902418, now seen corresponding path program 5 times [2020-11-30 01:41:16,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:16,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45987580] [2020-11-30 01:41:16,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:16,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45987580] [2020-11-30 01:41:16,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553636728] [2020-11-30 01:41:16,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/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 [2020-11-30 01:41:16,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-11-30 01:41:16,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:41:16,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 01:41:16,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:41:16,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:41:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:16,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:41:16,990 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:41:16,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:17,017 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:41:17,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:17,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:17,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2117757091] [2020-11-30 01:41:17,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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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) [2020-11-30 01:41:17,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:41:17,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2020-11-30 01:41:17,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521376390] [2020-11-30 01:41:17,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-30 01:41:17,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:17,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 01:41:17,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:41:17,130 INFO L87 Difference]: Start difference. First operand 41 states and 99 transitions. Second operand 13 states. [2020-11-30 01:41:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:17,535 INFO L93 Difference]: Finished difference Result 82 states and 197 transitions. [2020-11-30 01:41:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:41:17,537 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2020-11-30 01:41:17,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:17,538 INFO L225 Difference]: With dead ends: 82 [2020-11-30 01:41:17,538 INFO L226 Difference]: Without dead ends: 56 [2020-11-30 01:41:17,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2020-11-30 01:41:17,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-30 01:41:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2020-11-30 01:41:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-30 01:41:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2020-11-30 01:41:17,544 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 11 [2020-11-30 01:41:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:17,544 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2020-11-30 01:41:17,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-30 01:41:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2020-11-30 01:41:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 01:41:17,545 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:17,545 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:17,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-30 01:41:17,746 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:17,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1230025166, now seen corresponding path program 6 times [2020-11-30 01:41:17,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:17,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774983473] [2020-11-30 01:41:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:41:17,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774983473] [2020-11-30 01:41:17,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678794941] [2020-11-30 01:41:17,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/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 [2020-11-30 01:41:17,971 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 01:41:17,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:41:17,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:41:17,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:41:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:41:18,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:41:18,017 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:41:18,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:18,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:18,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:18,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:18,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:18,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:18,193 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:41:18,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:41:18,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [865213624] [2020-11-30 01:41:18,230 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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) [2020-11-30 01:41:18,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:41:18,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2020-11-30 01:41:18,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88725410] [2020-11-30 01:41:18,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 01:41:18,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:18,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 01:41:18,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-11-30 01:41:18,236 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand 16 states. [2020-11-30 01:41:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:18,582 INFO L93 Difference]: Finished difference Result 91 states and 202 transitions. [2020-11-30 01:41:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 01:41:18,583 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-11-30 01:41:18,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:18,584 INFO L225 Difference]: With dead ends: 91 [2020-11-30 01:41:18,584 INFO L226 Difference]: Without dead ends: 66 [2020-11-30 01:41:18,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2020-11-30 01:41:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-30 01:41:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2020-11-30 01:41:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-11-30 01:41:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 136 transitions. [2020-11-30 01:41:18,591 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 136 transitions. Word has length 14 [2020-11-30 01:41:18,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:18,598 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 136 transitions. [2020-11-30 01:41:18,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 01:41:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 136 transitions. [2020-11-30 01:41:18,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 01:41:18,602 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:18,602 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:18,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:41:18,816 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:18,816 INFO L82 PathProgramCache]: Analyzing trace with hash 415819444, now seen corresponding path program 7 times [2020-11-30 01:41:18,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:18,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178364366] [2020-11-30 01:41:18,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:41:18,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178364366] [2020-11-30 01:41:18,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474199870] [2020-11-30 01:41:18,904 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/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 [2020-11-30 01:41:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:18,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:41:18,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:41:19,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:41:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:41:19,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:41:19,057 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:41:19,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:19,087 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:41:19,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:19,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:41:19,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1076004216] [2020-11-30 01:41:19,231 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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) [2020-11-30 01:41:19,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:41:19,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2020-11-30 01:41:19,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397078427] [2020-11-30 01:41:19,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-30 01:41:19,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:19,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-30 01:41:19,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2020-11-30 01:41:19,232 INFO L87 Difference]: Start difference. First operand 58 states and 136 transitions. Second operand 17 states. [2020-11-30 01:41:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:19,943 INFO L93 Difference]: Finished difference Result 157 states and 377 transitions. [2020-11-30 01:41:19,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-30 01:41:19,943 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2020-11-30 01:41:19,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:19,944 INFO L225 Difference]: With dead ends: 157 [2020-11-30 01:41:19,944 INFO L226 Difference]: Without dead ends: 108 [2020-11-30 01:41:19,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=478, Invalid=1004, Unknown=0, NotChecked=0, Total=1482 [2020-11-30 01:41:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-11-30 01:41:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 65. [2020-11-30 01:41:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-30 01:41:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 161 transitions. [2020-11-30 01:41:19,953 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 161 transitions. Word has length 14 [2020-11-30 01:41:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:19,953 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 161 transitions. [2020-11-30 01:41:19,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-30 01:41:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 161 transitions. [2020-11-30 01:41:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 01:41:19,954 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:19,954 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:20,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:41:20,176 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:20,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:20,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1483738395, now seen corresponding path program 8 times [2020-11-30 01:41:20,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:20,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331302354] [2020-11-30 01:41:20,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:20,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331302354] [2020-11-30 01:41:20,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064271533] [2020-11-30 01:41:20,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/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 [2020-11-30 01:41:20,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-30 01:41:20,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:41:20,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 01:41:20,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:41:20,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:41:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:20,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:41:20,509 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:41:20,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:20,530 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:41:20,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:20,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:20,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1116001700] [2020-11-30 01:41:20,743 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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) [2020-11-30 01:41:20,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:41:20,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2020-11-30 01:41:20,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947079594] [2020-11-30 01:41:20,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-30 01:41:20,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:20,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-30 01:41:20,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2020-11-30 01:41:20,746 INFO L87 Difference]: Start difference. First operand 65 states and 161 transitions. Second operand 25 states. [2020-11-30 01:41:21,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:21,763 INFO L93 Difference]: Finished difference Result 210 states and 515 transitions. [2020-11-30 01:41:21,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-30 01:41:21,764 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 17 [2020-11-30 01:41:21,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:21,766 INFO L225 Difference]: With dead ends: 210 [2020-11-30 01:41:21,766 INFO L226 Difference]: Without dead ends: 129 [2020-11-30 01:41:21,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1117, Invalid=2423, Unknown=0, NotChecked=0, Total=3540 [2020-11-30 01:41:21,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-30 01:41:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 64. [2020-11-30 01:41:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-30 01:41:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 157 transitions. [2020-11-30 01:41:21,777 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 157 transitions. Word has length 17 [2020-11-30 01:41:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:21,777 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 157 transitions. [2020-11-30 01:41:21,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-30 01:41:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 157 transitions. [2020-11-30 01:41:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 01:41:21,778 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:21,779 INFO L422 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:22,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:41:22,004 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:22,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:22,004 INFO L82 PathProgramCache]: Analyzing trace with hash -154578414, now seen corresponding path program 9 times [2020-11-30 01:41:22,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:22,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293481243] [2020-11-30 01:41:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:41:22,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293481243] [2020-11-30 01:41:22,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002447414] [2020-11-30 01:41:22,340 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/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 [2020-11-30 01:41:22,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 01:41:22,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:41:22,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-30 01:41:22,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:41:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:41:22,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:41:22,441 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:41:22,441 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,503 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:22,979 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:41:22,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:41:23,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [130610608] [2020-11-30 01:41:23,015 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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) [2020-11-30 01:41:23,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:41:23,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2020-11-30 01:41:23,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036905456] [2020-11-30 01:41:23,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-11-30 01:41:23,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:23,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-11-30 01:41:23,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=1171, Unknown=0, NotChecked=0, Total=1560 [2020-11-30 01:41:23,018 INFO L87 Difference]: Start difference. First operand 64 states and 157 transitions. Second operand 40 states. [2020-11-30 01:41:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:23,734 INFO L93 Difference]: Finished difference Result 125 states and 282 transitions. [2020-11-30 01:41:23,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-30 01:41:23,735 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2020-11-30 01:41:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:23,736 INFO L225 Difference]: With dead ends: 125 [2020-11-30 01:41:23,736 INFO L226 Difference]: Without dead ends: 106 [2020-11-30 01:41:23,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1060, Invalid=2600, Unknown=0, NotChecked=0, Total=3660 [2020-11-30 01:41:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-30 01:41:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 86. [2020-11-30 01:41:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-30 01:41:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 204 transitions. [2020-11-30 01:41:23,745 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 204 transitions. Word has length 26 [2020-11-30 01:41:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:23,746 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 204 transitions. [2020-11-30 01:41:23,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-11-30 01:41:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 204 transitions. [2020-11-30 01:41:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 01:41:23,747 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:23,747 INFO L422 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:23,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-11-30 01:41:23,972 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:23,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:23,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1558563116, now seen corresponding path program 10 times [2020-11-30 01:41:23,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:23,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479467441] [2020-11-30 01:41:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:41:24,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479467441] [2020-11-30 01:41:24,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60825940] [2020-11-30 01:41:24,403 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/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 [2020-11-30 01:41:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:24,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-30 01:41:24,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:41:24,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:41:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:41:24,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:41:24,565 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:41:24,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:24,591 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 01:41:24,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:24,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:41:25,043 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:41:25,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [834183871] [2020-11-30 01:41:25,044 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:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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) [2020-11-30 01:41:25,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 01:41:25,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 39 [2020-11-30 01:41:25,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018324452] [2020-11-30 01:41:25,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-11-30 01:41:25,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:25,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-11-30 01:41:25,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1270, Unknown=0, NotChecked=0, Total=1640 [2020-11-30 01:41:25,047 INFO L87 Difference]: Start difference. First operand 86 states and 204 transitions. Second operand 41 states. [2020-11-30 01:41:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:26,624 INFO L93 Difference]: Finished difference Result 214 states and 517 transitions. [2020-11-30 01:41:26,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-11-30 01:41:26,625 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 26 [2020-11-30 01:41:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:26,626 INFO L225 Difference]: With dead ends: 214 [2020-11-30 01:41:26,626 INFO L226 Difference]: Without dead ends: 173 [2020-11-30 01:41:26,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2088, Invalid=5052, Unknown=0, NotChecked=0, Total=7140 [2020-11-30 01:41:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-11-30 01:41:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 97. [2020-11-30 01:41:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-30 01:41:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 247 transitions. [2020-11-30 01:41:26,635 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 247 transitions. Word has length 26 [2020-11-30 01:41:26,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:26,635 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 247 transitions. [2020-11-30 01:41:26,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-11-30 01:41:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 247 transitions. [2020-11-30 01:41:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 01:41:26,637 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:26,637 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:26,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:41:26,852 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:26,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:26,852 INFO L82 PathProgramCache]: Analyzing trace with hash 130555458, now seen corresponding path program 11 times [2020-11-30 01:41:26,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:26,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986220321] [2020-11-30 01:41:26,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:41:26,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:41:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:41:26,916 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:41:26,951 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-30 01:41:26,952 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:41:26,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 01:41:27,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:41:27 BasicIcfg [2020-11-30 01:41:27,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:41:27,073 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:41:27,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:41:27,074 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:41:27,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:41:12" (3/4) ... [2020-11-30 01:41:27,077 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 01:41:27,207 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_131d7335-8b6c-470f-9522-3076a831a924/bin/utaipan/witness.graphml [2020-11-30 01:41:27,211 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:41:27,213 INFO L168 Benchmark]: Toolchain (without parser) took 16070.27 ms. Allocated memory was 98.6 MB in the beginning and 268.4 MB in the end (delta: 169.9 MB). Free memory was 61.4 MB in the beginning and 237.2 MB in the end (delta: -175.8 MB). Peak memory consumption was 116.9 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:27,213 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 98.6 MB. Free memory was 79.0 MB in the beginning and 79.0 MB in the end (delta: 55.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:41:27,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 736.60 ms. Allocated memory is still 98.6 MB. Free memory was 61.2 MB in the beginning and 56.7 MB in the end (delta: 4.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:27,215 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.92 ms. Allocated memory is still 98.6 MB. Free memory was 56.7 MB in the beginning and 54.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:27,216 INFO L168 Benchmark]: Boogie Preprocessor took 26.77 ms. Allocated memory is still 98.6 MB. Free memory was 54.9 MB in the beginning and 53.6 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:41:27,216 INFO L168 Benchmark]: RCFGBuilder took 566.11 ms. Allocated memory was 98.6 MB in the beginning and 121.6 MB in the end (delta: 23.1 MB). Free memory was 53.4 MB in the beginning and 96.3 MB in the end (delta: -42.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:27,217 INFO L168 Benchmark]: TraceAbstraction took 14554.73 ms. Allocated memory was 121.6 MB in the beginning and 222.3 MB in the end (delta: 100.7 MB). Free memory was 96.3 MB in the beginning and 68.8 MB in the end (delta: 27.5 MB). Peak memory consumption was 129.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:27,217 INFO L168 Benchmark]: Witness Printer took 138.32 ms. Allocated memory was 222.3 MB in the beginning and 268.4 MB in the end (delta: 46.1 MB). Free memory was 68.8 MB in the beginning and 237.2 MB in the end (delta: -168.4 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:27,220 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.20 ms. Allocated memory is still 98.6 MB. Free memory was 79.0 MB in the beginning and 79.0 MB in the end (delta: 55.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 736.60 ms. Allocated memory is still 98.6 MB. Free memory was 61.2 MB in the beginning and 56.7 MB in the end (delta: 4.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.92 ms. Allocated memory is still 98.6 MB. Free memory was 56.7 MB in the beginning and 54.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 26.77 ms. Allocated memory is still 98.6 MB. Free memory was 54.9 MB in the beginning and 53.6 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 566.11 ms. Allocated memory was 98.6 MB in the beginning and 121.6 MB in the end (delta: 23.1 MB). Free memory was 53.4 MB in the beginning and 96.3 MB in the end (delta: -42.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14554.73 ms. Allocated memory was 121.6 MB in the beginning and 222.3 MB in the end (delta: 100.7 MB). Free memory was 96.3 MB in the beginning and 68.8 MB in the end (delta: 27.5 MB). Peak memory consumption was 129.5 MB. Max. memory is 16.1 GB. * Witness Printer took 138.32 ms. Allocated memory was 222.3 MB in the beginning and 268.4 MB in the end (delta: 46.1 MB). Free memory was 68.8 MB in the beginning and 237.2 MB in the end (delta: -168.4 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 751 VarBasedMoverChecksPositive, 13 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 13 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 10 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.3s, 65 PlacesBefore, 20 PlacesAfterwards, 64 TransitionsBefore, 16 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 5 FixpointIterations, 16 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 60 TotalNumberOfCompositions, 1062 MoverChecksTotal - CounterExampleResult [Line: 693]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_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*10 +6); VAL [arg={0:0}, arg={0:0}, i=3, j=6] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=1] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=1, k=0] [L704] COND TRUE 2 k < 10 [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 < 10 [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 < 10 [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 < 10 [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 < 10 [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 < 10 [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 < 10 [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 < 10 [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=5, k=4] [L704] COND TRUE 2 k < 10 [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 < 10 [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 < 10 [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 < 10 [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 < 10 [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 < 10 [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 < 10 [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 < 10 [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 < 10 [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 < 10 [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=9, k=10] [L704] COND TRUE 2 k < 10 [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] [L719] 0 int condJ = j >= (2*10 +6); [L721] COND TRUE 0 condI || condJ [L693] COND FALSE 0 !(0) [L693] 0 __assert_fail ("0", "triangular-longer-2.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.3s, OverallIterations: 13, TraceHistogramMax: 10, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 176 SDtfs, 918 SDslu, 656 SDs, 0 SdLazy, 764 SolverSat, 644 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 126 SyntacticMatches, 6 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4824 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=12, 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, 12 MinimizatonAttempts, 286 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 28790 SizeOfPredicates, 56 NumberOfNonLiveVariables, 768 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 12/531 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...