./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longest-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/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 faf61a04ec090f6b1743a12583eb9c9759e6ed3e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-03 12:35:30,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 12:35:30,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 12:35:30,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 12:35:30,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 12:35:30,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 12:35:30,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 12:35:30,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 12:35:30,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 12:35:30,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 12:35:30,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 12:35:30,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 12:35:30,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 12:35:30,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 12:35:30,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 12:35:30,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 12:35:30,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 12:35:30,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 12:35:30,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 12:35:30,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 12:35:30,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 12:35:30,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 12:35:30,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 12:35:30,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 12:35:30,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 12:35:30,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 12:35:30,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 12:35:30,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 12:35:30,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 12:35:30,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 12:35:30,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 12:35:30,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 12:35:30,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 12:35:30,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 12:35:30,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 12:35:30,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 12:35:30,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 12:35:30,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 12:35:30,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 12:35:30,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 12:35:30,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 12:35:30,676 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-03 12:35:30,714 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 12:35:30,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 12:35:30,716 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-03 12:35:30,716 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-03 12:35:30,716 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-03 12:35:30,716 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-03 12:35:30,717 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-03 12:35:30,717 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-03 12:35:30,717 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-03 12:35:30,717 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-03 12:35:30,718 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-03 12:35:30,719 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-03 12:35:30,719 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-03 12:35:30,719 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-03 12:35:30,720 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-03 12:35:30,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 12:35:30,721 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 12:35:30,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-03 12:35:30,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 12:35:30,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 12:35:30,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 12:35:30,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 12:35:30,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 12:35:30,722 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-03 12:35:30,722 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 12:35:30,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 12:35:30,723 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 12:35:30,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 12:35:30,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 12:35:30,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 12:35:30,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 12:35:30,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 12:35:30,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 12:35:30,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 12:35:30,725 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-03 12:35:30,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-03 12:35:30,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 12:35:30,726 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 12:35:30,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-03 12:35:30,726 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_3887298e-d5f7-40c8-b1e9-0854ce43cb86/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_3887298e-d5f7-40c8-b1e9-0854ce43cb86/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 -> faf61a04ec090f6b1743a12583eb9c9759e6ed3e [2020-12-03 12:35:31,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 12:35:31,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 12:35:31,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 12:35:31,062 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 12:35:31,062 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 12:35:31,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/../../sv-benchmarks/c/pthread/triangular-longest-2.i [2020-12-03 12:35:31,156 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/data/c7b60a839/223e52e8be3c46d385477af64db26361/FLAG4e531bc10 [2020-12-03 12:35:31,803 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 12:35:31,805 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/sv-benchmarks/c/pthread/triangular-longest-2.i [2020-12-03 12:35:31,825 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/data/c7b60a839/223e52e8be3c46d385477af64db26361/FLAG4e531bc10 [2020-12-03 12:35:32,044 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/data/c7b60a839/223e52e8be3c46d385477af64db26361 [2020-12-03 12:35:32,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 12:35:32,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 12:35:32,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 12:35:32,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 12:35:32,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 12:35:32,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:35:32" (1/1) ... [2020-12-03 12:35:32,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40bd9cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:32, skipping insertion in model container [2020-12-03 12:35:32,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:35:32" (1/1) ... [2020-12-03 12:35:32,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 12:35:32,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 12:35:32,564 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2020-12-03 12:35:32,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 12:35:32,585 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 12:35:32,642 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2020-12-03 12:35:32,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 12:35:32,735 INFO L208 MainTranslator]: Completed translation [2020-12-03 12:35:32,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:32 WrapperNode [2020-12-03 12:35:32,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 12:35:32,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 12:35:32,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 12:35:32,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 12:35:32,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:32" (1/1) ... [2020-12-03 12:35:32,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:32" (1/1) ... [2020-12-03 12:35:32,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 12:35:32,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 12:35:32,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 12:35:32,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 12:35:32,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:32" (1/1) ... [2020-12-03 12:35:32,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:32" (1/1) ... [2020-12-03 12:35:32,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:32" (1/1) ... [2020-12-03 12:35:32,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:32" (1/1) ... [2020-12-03 12:35:32,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:32" (1/1) ... [2020-12-03 12:35:32,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:32" (1/1) ... [2020-12-03 12:35:32,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:32" (1/1) ... [2020-12-03 12:35:32,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 12:35:32,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 12:35:32,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 12:35:32,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 12:35:32,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/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-12-03 12:35:32,960 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-12-03 12:35:32,960 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-12-03 12:35:32,961 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-12-03 12:35:32,961 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-12-03 12:35:32,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-03 12:35:32,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-03 12:35:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 12:35:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-03 12:35:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-03 12:35:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-03 12:35:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 12:35:32,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 12:35:32,965 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-03 12:35:33,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 12:35:33,484 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2020-12-03 12:35:33,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:35:33 BoogieIcfgContainer [2020-12-03 12:35:33,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 12:35:33,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 12:35:33,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 12:35:33,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 12:35:33,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 12:35:32" (1/3) ... [2020-12-03 12:35:33,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@918bbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:35:33, skipping insertion in model container [2020-12-03 12:35:33,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:35:32" (2/3) ... [2020-12-03 12:35:33,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@918bbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:35:33, skipping insertion in model container [2020-12-03 12:35:33,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:35:33" (3/3) ... [2020-12-03 12:35:33,506 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2020-12-03 12:35:33,521 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-03 12:35:33,521 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 12:35:33,525 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-03 12:35:33,525 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-03 12:35:33,583 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,583 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,584 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,584 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,584 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,584 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,584 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,585 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,588 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,588 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,589 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,589 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,590 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,590 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,591 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,591 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,592 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,592 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,594 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,594 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,595 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,595 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,596 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,596 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,597 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,598 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,598 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,598 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,599 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,599 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,599 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,600 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,600 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,600 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,600 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,601 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,601 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,601 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,602 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,602 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,602 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,602 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,603 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,603 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,603 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,603 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,604 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,604 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,605 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,605 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,605 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,605 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,605 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,606 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,606 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,606 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,609 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,612 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,613 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,613 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,613 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,613 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,620 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,620 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,620 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,621 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,621 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,621 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 12:35:33,623 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-03 12:35:33,634 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-12-03 12:35:33,654 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 12:35:33,654 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 12:35:33,654 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 12:35:33,655 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 12:35:33,655 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 12:35:33,655 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 12:35:33,655 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 12:35:33,655 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 12:35:33,666 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-03 12:35:33,668 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 60 transitions, 130 flow [2020-12-03 12:35:33,671 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 60 transitions, 130 flow [2020-12-03 12:35:33,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 130 flow [2020-12-03 12:35:33,709 INFO L129 PetriNetUnfolder]: 5/58 cut-off events. [2020-12-03 12:35:33,710 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-03 12:35:33,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 58 events. 5/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2020-12-03 12:35:33,716 INFO L116 LiptonReduction]: Number of co-enabled transitions 968 [2020-12-03 12:35:35,812 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-12-03 12:35:36,339 WARN L197 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-12-03 12:35:36,468 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-12-03 12:35:36,693 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-12-03 12:35:36,810 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-12-03 12:35:36,841 INFO L131 LiptonReduction]: Checked pairs total: 998 [2020-12-03 12:35:36,841 INFO L133 LiptonReduction]: Total number of compositions: 52 [2020-12-03 12:35:36,847 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2020-12-03 12:35:36,857 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-12-03 12:35:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-12-03 12:35:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-03 12:35:36,864 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:36,865 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-03 12:35:36,865 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:36,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:36,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1332860337, now seen corresponding path program 1 times [2020-12-03 12:35:36,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:36,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740585295] [2020-12-03 12:35:36,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:37,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740585295] [2020-12-03 12:35:37,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:35:37,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-03 12:35:37,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642278405] [2020-12-03 12:35:37,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 12:35:37,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:37,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 12:35:37,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 12:35:37,177 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-12-03 12:35:37,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:37,234 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2020-12-03 12:35:37,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 12:35:37,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-03 12:35:37,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:37,246 INFO L225 Difference]: With dead ends: 59 [2020-12-03 12:35:37,247 INFO L226 Difference]: Without dead ends: 38 [2020-12-03 12:35:37,248 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-12-03 12:35:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-03 12:35:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-12-03 12:35:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-03 12:35:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 92 transitions. [2020-12-03 12:35:37,283 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 92 transitions. Word has length 6 [2020-12-03 12:35:37,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:37,283 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 92 transitions. [2020-12-03 12:35:37,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 12:35:37,283 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 92 transitions. [2020-12-03 12:35:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-03 12:35:37,284 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:37,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:37,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-03 12:35:37,285 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash -978539367, now seen corresponding path program 1 times [2020-12-03 12:35:37,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:37,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555913705] [2020-12-03 12:35:37,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:37,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555913705] [2020-12-03 12:35:37,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:35:37,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:35:37,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713618045] [2020-12-03 12:35:37,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-03 12:35:37,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:37,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-03 12:35:37,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-03 12:35:37,397 INFO L87 Difference]: Start difference. First operand 38 states and 92 transitions. Second operand 5 states. [2020-12-03 12:35:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:37,432 INFO L93 Difference]: Finished difference Result 82 states and 192 transitions. [2020-12-03 12:35:37,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-03 12:35:37,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-12-03 12:35:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:37,435 INFO L225 Difference]: With dead ends: 82 [2020-12-03 12:35:37,435 INFO L226 Difference]: Without dead ends: 74 [2020-12-03 12:35:37,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:35:37,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-12-03 12:35:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2020-12-03 12:35:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-03 12:35:37,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 129 transitions. [2020-12-03 12:35:37,448 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 129 transitions. Word has length 8 [2020-12-03 12:35:37,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:37,448 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 129 transitions. [2020-12-03 12:35:37,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-03 12:35:37,449 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 129 transitions. [2020-12-03 12:35:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-03 12:35:37,449 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:37,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:37,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-03 12:35:37,450 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:37,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:37,451 INFO L82 PathProgramCache]: Analyzing trace with hash -978459387, now seen corresponding path program 2 times [2020-12-03 12:35:37,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:37,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417405530] [2020-12-03 12:35:37,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:37,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417405530] [2020-12-03 12:35:37,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:35:37,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:35:37,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314975046] [2020-12-03 12:35:37,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-03 12:35:37,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:37,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-03 12:35:37,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-03 12:35:37,566 INFO L87 Difference]: Start difference. First operand 52 states and 129 transitions. Second operand 5 states. [2020-12-03 12:35:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:37,627 INFO L93 Difference]: Finished difference Result 62 states and 143 transitions. [2020-12-03 12:35:37,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 12:35:37,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-12-03 12:35:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:37,630 INFO L225 Difference]: With dead ends: 62 [2020-12-03 12:35:37,630 INFO L226 Difference]: Without dead ends: 50 [2020-12-03 12:35:37,630 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-03 12:35:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-12-03 12:35:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2020-12-03 12:35:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-12-03 12:35:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2020-12-03 12:35:37,647 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 100 transitions. Word has length 8 [2020-12-03 12:35:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:37,648 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 100 transitions. [2020-12-03 12:35:37,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-03 12:35:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 100 transitions. [2020-12-03 12:35:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-03 12:35:37,650 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:37,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:37,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-03 12:35:37,653 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:37,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:37,654 INFO L82 PathProgramCache]: Analyzing trace with hash 220478720, now seen corresponding path program 1 times [2020-12-03 12:35:37,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:37,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594724298] [2020-12-03 12:35:37,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:37,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594724298] [2020-12-03 12:35:37,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:35:37,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 12:35:37,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677541202] [2020-12-03 12:35:37,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 12:35:37,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:37,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 12:35:37,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:35:37,798 INFO L87 Difference]: Start difference. First operand 42 states and 100 transitions. Second operand 6 states. [2020-12-03 12:35:37,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:37,882 INFO L93 Difference]: Finished difference Result 58 states and 132 transitions. [2020-12-03 12:35:37,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 12:35:37,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-03 12:35:37,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:37,888 INFO L225 Difference]: With dead ends: 58 [2020-12-03 12:35:37,889 INFO L226 Difference]: Without dead ends: 51 [2020-12-03 12:35:37,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-03 12:35:37,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-03 12:35:37,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-12-03 12:35:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-03 12:35:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 107 transitions. [2020-12-03 12:35:37,904 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 107 transitions. Word has length 10 [2020-12-03 12:35:37,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:37,904 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 107 transitions. [2020-12-03 12:35:37,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 12:35:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 107 transitions. [2020-12-03 12:35:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-03 12:35:37,906 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:37,906 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:37,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-03 12:35:37,907 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:37,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:37,910 INFO L82 PathProgramCache]: Analyzing trace with hash 266866190, now seen corresponding path program 2 times [2020-12-03 12:35:37,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:37,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009673199] [2020-12-03 12:35:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:38,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009673199] [2020-12-03 12:35:38,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:35:38,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 12:35:38,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389529129] [2020-12-03 12:35:38,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 12:35:38,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:38,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 12:35:38,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:35:38,010 INFO L87 Difference]: Start difference. First operand 45 states and 107 transitions. Second operand 6 states. [2020-12-03 12:35:38,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:38,076 INFO L93 Difference]: Finished difference Result 78 states and 180 transitions. [2020-12-03 12:35:38,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 12:35:38,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-03 12:35:38,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:38,078 INFO L225 Difference]: With dead ends: 78 [2020-12-03 12:35:38,078 INFO L226 Difference]: Without dead ends: 71 [2020-12-03 12:35:38,079 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-12-03 12:35:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-03 12:35:38,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2020-12-03 12:35:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-12-03 12:35:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 113 transitions. [2020-12-03 12:35:38,097 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 113 transitions. Word has length 10 [2020-12-03 12:35:38,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:38,097 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 113 transitions. [2020-12-03 12:35:38,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 12:35:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 113 transitions. [2020-12-03 12:35:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-03 12:35:38,098 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:38,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:38,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-03 12:35:38,099 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:38,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:38,099 INFO L82 PathProgramCache]: Analyzing trace with hash 266888510, now seen corresponding path program 3 times [2020-12-03 12:35:38,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:38,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968120068] [2020-12-03 12:35:38,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:38,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968120068] [2020-12-03 12:35:38,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:35:38,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 12:35:38,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620644418] [2020-12-03 12:35:38,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 12:35:38,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:38,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 12:35:38,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:35:38,184 INFO L87 Difference]: Start difference. First operand 46 states and 113 transitions. Second operand 6 states. [2020-12-03 12:35:38,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:38,277 INFO L93 Difference]: Finished difference Result 58 states and 137 transitions. [2020-12-03 12:35:38,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 12:35:38,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-03 12:35:38,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:38,279 INFO L225 Difference]: With dead ends: 58 [2020-12-03 12:35:38,279 INFO L226 Difference]: Without dead ends: 42 [2020-12-03 12:35:38,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-03 12:35:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-12-03 12:35:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2020-12-03 12:35:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-03 12:35:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 82 transitions. [2020-12-03 12:35:38,283 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 82 transitions. Word has length 10 [2020-12-03 12:35:38,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:38,283 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 82 transitions. [2020-12-03 12:35:38,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 12:35:38,284 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 82 transitions. [2020-12-03 12:35:38,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-03 12:35:38,284 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:38,284 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:38,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-03 12:35:38,285 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:38,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:38,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1755209235, now seen corresponding path program 4 times [2020-12-03 12:35:38,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:38,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071780374] [2020-12-03 12:35:38,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:38,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071780374] [2020-12-03 12:35:38,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150545479] [2020-12-03 12:35:38,350 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/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-12-03 12:35:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:38,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-03 12:35:38,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:35:38,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:38,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:35:38,554 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-03 12:35:38,554 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:38,597 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:38,630 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:38,666 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:38,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [838536356] [2020-12-03 12:35:38,704 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:35:38,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:35:38,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2020-12-03 12:35:38,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317683015] [2020-12-03 12:35:38,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 12:35:38,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:38,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 12:35:38,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-03 12:35:38,709 INFO L87 Difference]: Start difference. First operand 34 states and 82 transitions. Second operand 12 states. [2020-12-03 12:35:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:38,873 INFO L93 Difference]: Finished difference Result 70 states and 157 transitions. [2020-12-03 12:35:38,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-03 12:35:38,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2020-12-03 12:35:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:38,874 INFO L225 Difference]: With dead ends: 70 [2020-12-03 12:35:38,874 INFO L226 Difference]: Without dead ends: 52 [2020-12-03 12:35:38,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2020-12-03 12:35:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-12-03 12:35:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2020-12-03 12:35:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-03 12:35:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 113 transitions. [2020-12-03 12:35:38,882 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 113 transitions. Word has length 11 [2020-12-03 12:35:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:38,896 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 113 transitions. [2020-12-03 12:35:38,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 12:35:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 113 transitions. [2020-12-03 12:35:38,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-03 12:35:38,897 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:38,898 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:39,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-03 12:35:39,117 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:39,117 INFO L82 PathProgramCache]: Analyzing trace with hash -319965345, now seen corresponding path program 5 times [2020-12-03 12:35:39,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:39,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612107025] [2020-12-03 12:35:39,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:39,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612107025] [2020-12-03 12:35:39,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538407173] [2020-12-03 12:35:39,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/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-12-03 12:35:39,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-03 12:35:39,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 12:35:39,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-03 12:35:39,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:35:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:39,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:35:39,308 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-03 12:35:39,309 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:39,326 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:39,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [496855495] [2020-12-03 12:35:39,393 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:35:39,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:35:39,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2020-12-03 12:35:39,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583594580] [2020-12-03 12:35:39,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 12:35:39,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:39,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 12:35:39,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-12-03 12:35:39,398 INFO L87 Difference]: Start difference. First operand 48 states and 113 transitions. Second operand 12 states. [2020-12-03 12:35:39,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:39,714 INFO L93 Difference]: Finished difference Result 111 states and 257 transitions. [2020-12-03 12:35:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-03 12:35:39,715 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2020-12-03 12:35:39,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:39,716 INFO L225 Difference]: With dead ends: 111 [2020-12-03 12:35:39,716 INFO L226 Difference]: Without dead ends: 84 [2020-12-03 12:35:39,717 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2020-12-03 12:35:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-12-03 12:35:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 55. [2020-12-03 12:35:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-03 12:35:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 137 transitions. [2020-12-03 12:35:39,734 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 137 transitions. Word has length 11 [2020-12-03 12:35:39,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:39,735 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 137 transitions. [2020-12-03 12:35:39,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 12:35:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 137 transitions. [2020-12-03 12:35:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-03 12:35:39,736 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:39,736 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:39,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:35:39,953 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:39,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1426667684, now seen corresponding path program 6 times [2020-12-03 12:35:39,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:39,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165994633] [2020-12-03 12:35:39,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:40,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165994633] [2020-12-03 12:35:40,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958716121] [2020-12-03 12:35:40,044 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/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-12-03 12:35:40,114 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-03 12:35:40,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 12:35:40,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-03 12:35:40,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:35:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:40,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:35:40,178 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-03 12:35:40,178 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:40,195 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:40,210 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:40,234 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:40,260 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:40,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1957391543] [2020-12-03 12:35:40,292 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:35:40,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:35:40,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2020-12-03 12:35:40,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853575376] [2020-12-03 12:35:40,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-03 12:35:40,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:40,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-03 12:35:40,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-12-03 12:35:40,295 INFO L87 Difference]: Start difference. First operand 55 states and 137 transitions. Second operand 15 states. [2020-12-03 12:35:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:40,548 INFO L93 Difference]: Finished difference Result 93 states and 213 transitions. [2020-12-03 12:35:40,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-03 12:35:40,548 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-12-03 12:35:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:40,549 INFO L225 Difference]: With dead ends: 93 [2020-12-03 12:35:40,549 INFO L226 Difference]: Without dead ends: 74 [2020-12-03 12:35:40,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2020-12-03 12:35:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-12-03 12:35:40,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2020-12-03 12:35:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-03 12:35:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 143 transitions. [2020-12-03 12:35:40,562 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 143 transitions. Word has length 12 [2020-12-03 12:35:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:40,563 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 143 transitions. [2020-12-03 12:35:40,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-03 12:35:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 143 transitions. [2020-12-03 12:35:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-03 12:35:40,564 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:40,564 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:40,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:35:40,781 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:40,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:40,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1239613902, now seen corresponding path program 7 times [2020-12-03 12:35:40,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:40,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566699181] [2020-12-03 12:35:40,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:40,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566699181] [2020-12-03 12:35:40,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440111579] [2020-12-03 12:35:40,847 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/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-12-03 12:35:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:40,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-03 12:35:40,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:35:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:40,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:35:40,922 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-03 12:35:40,923 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:40,936 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:40,950 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:40,964 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:41,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1842684348] [2020-12-03 12:35:41,002 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:35:41,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:35:41,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2020-12-03 12:35:41,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378964601] [2020-12-03 12:35:41,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-03 12:35:41,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:41,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-03 12:35:41,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-12-03 12:35:41,004 INFO L87 Difference]: Start difference. First operand 58 states and 143 transitions. Second operand 14 states. [2020-12-03 12:35:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:41,316 INFO L93 Difference]: Finished difference Result 137 states and 309 transitions. [2020-12-03 12:35:41,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-03 12:35:41,317 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 12 [2020-12-03 12:35:41,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:41,319 INFO L225 Difference]: With dead ends: 137 [2020-12-03 12:35:41,319 INFO L226 Difference]: Without dead ends: 118 [2020-12-03 12:35:41,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2020-12-03 12:35:41,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-12-03 12:35:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 58. [2020-12-03 12:35:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-03 12:35:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 149 transitions. [2020-12-03 12:35:41,333 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 149 transitions. Word has length 12 [2020-12-03 12:35:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:41,333 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 149 transitions. [2020-12-03 12:35:41,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-03 12:35:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 149 transitions. [2020-12-03 12:35:41,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-03 12:35:41,338 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:41,338 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:41,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:35:41,557 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:41,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:41,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1217334822, now seen corresponding path program 8 times [2020-12-03 12:35:41,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:41,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717539822] [2020-12-03 12:35:41,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:41,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717539822] [2020-12-03 12:35:41,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156377096] [2020-12-03 12:35:41,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/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-12-03 12:35:41,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-03 12:35:41,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 12:35:41,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-03 12:35:41,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:35:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:41,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:35:41,704 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-03 12:35:41,704 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:41,728 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:41,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1247585878] [2020-12-03 12:35:41,778 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:35:41,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:35:41,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2020-12-03 12:35:41,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105407241] [2020-12-03 12:35:41,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-03 12:35:41,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:41,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-03 12:35:41,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-12-03 12:35:41,780 INFO L87 Difference]: Start difference. First operand 58 states and 149 transitions. Second operand 15 states. [2020-12-03 12:35:42,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:42,191 INFO L93 Difference]: Finished difference Result 119 states and 281 transitions. [2020-12-03 12:35:42,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-03 12:35:42,192 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-12-03 12:35:42,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:42,193 INFO L225 Difference]: With dead ends: 119 [2020-12-03 12:35:42,193 INFO L226 Difference]: Without dead ends: 83 [2020-12-03 12:35:42,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2020-12-03 12:35:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-12-03 12:35:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 53. [2020-12-03 12:35:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-03 12:35:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 128 transitions. [2020-12-03 12:35:42,197 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 128 transitions. Word has length 12 [2020-12-03 12:35:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:42,197 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 128 transitions. [2020-12-03 12:35:42,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-03 12:35:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 128 transitions. [2020-12-03 12:35:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-03 12:35:42,198 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:42,198 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:42,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-03 12:35:42,398 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:42,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:42,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1385885646, now seen corresponding path program 9 times [2020-12-03 12:35:42,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:42,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546141392] [2020-12-03 12:35:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:42,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546141392] [2020-12-03 12:35:42,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430928119] [2020-12-03 12:35:42,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/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-12-03 12:35:42,566 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-03 12:35:42,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 12:35:42,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-03 12:35:42,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:35:42,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-03 12:35:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:42,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:35:42,605 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-03 12:35:42,605 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:42,630 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:42,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1227401082] [2020-12-03 12:35:42,746 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:35:42,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:35:42,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2020-12-03 12:35:42,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467816660] [2020-12-03 12:35:42,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-03 12:35:42,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:42,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-03 12:35:42,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2020-12-03 12:35:42,750 INFO L87 Difference]: Start difference. First operand 53 states and 128 transitions. Second operand 23 states. [2020-12-03 12:35:43,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:43,652 INFO L93 Difference]: Finished difference Result 150 states and 363 transitions. [2020-12-03 12:35:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-12-03 12:35:43,652 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2020-12-03 12:35:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:43,653 INFO L225 Difference]: With dead ends: 150 [2020-12-03 12:35:43,654 INFO L226 Difference]: Without dead ends: 93 [2020-12-03 12:35:43,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=980, Invalid=2100, Unknown=0, NotChecked=0, Total=3080 [2020-12-03 12:35:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-12-03 12:35:43,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 66. [2020-12-03 12:35:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-12-03 12:35:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 161 transitions. [2020-12-03 12:35:43,659 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 161 transitions. Word has length 16 [2020-12-03 12:35:43,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:43,659 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 161 transitions. [2020-12-03 12:35:43,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-03 12:35:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 161 transitions. [2020-12-03 12:35:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 12:35:43,660 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:43,660 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:43,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:35:43,877 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:43,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:43,877 INFO L82 PathProgramCache]: Analyzing trace with hash -985011240, now seen corresponding path program 10 times [2020-12-03 12:35:43,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:43,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311459551] [2020-12-03 12:35:43,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:44,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311459551] [2020-12-03 12:35:44,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371569304] [2020-12-03 12:35:44,114 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:35:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:44,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-03 12:35:44,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:35:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:44,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:35:44,259 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-03 12:35:44,259 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:44,282 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:44,304 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:44,326 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:44,347 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:44,374 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:44,448 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:44,480 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:44,509 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:44,541 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:44,573 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:44,607 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:44,638 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:44,674 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:44,707 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:44,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1466514386] [2020-12-03 12:35:44,765 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:35:44,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:35:44,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 33 [2020-12-03 12:35:44,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218906368] [2020-12-03 12:35:44,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-12-03 12:35:44,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:44,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-12-03 12:35:44,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2020-12-03 12:35:44,770 INFO L87 Difference]: Start difference. First operand 66 states and 161 transitions. Second operand 35 states. [2020-12-03 12:35:45,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:45,731 INFO L93 Difference]: Finished difference Result 163 states and 356 transitions. [2020-12-03 12:35:45,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-12-03 12:35:45,732 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 22 [2020-12-03 12:35:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:45,733 INFO L225 Difference]: With dead ends: 163 [2020-12-03 12:35:45,734 INFO L226 Difference]: Without dead ends: 114 [2020-12-03 12:35:45,735 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1265, Invalid=2895, Unknown=0, NotChecked=0, Total=4160 [2020-12-03 12:35:45,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-12-03 12:35:45,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 82. [2020-12-03 12:35:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-12-03 12:35:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 194 transitions. [2020-12-03 12:35:45,739 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 194 transitions. Word has length 22 [2020-12-03 12:35:45,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:45,739 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 194 transitions. [2020-12-03 12:35:45,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-12-03 12:35:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 194 transitions. [2020-12-03 12:35:45,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 12:35:45,740 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:45,740 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:45,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:35:45,941 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:45,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:45,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1090086938, now seen corresponding path program 11 times [2020-12-03 12:35:45,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:45,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445042473] [2020-12-03 12:35:45,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:46,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445042473] [2020-12-03 12:35:46,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909620013] [2020-12-03 12:35:46,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:35:46,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-12-03 12:35:46,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 12:35:46,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-03 12:35:46,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:35:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:46,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:35:46,306 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-03 12:35:46,307 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:46,334 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:46,356 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:46,378 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:46,405 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:46,425 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:46,446 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:46,470 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:46,493 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:46,518 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:46,541 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:46,565 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:46,594 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:46,618 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:46,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1854786261] [2020-12-03 12:35:46,685 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:35:46,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:35:46,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2020-12-03 12:35:46,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128174134] [2020-12-03 12:35:46,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-12-03 12:35:46,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:46,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-12-03 12:35:46,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2020-12-03 12:35:46,688 INFO L87 Difference]: Start difference. First operand 82 states and 194 transitions. Second operand 34 states. [2020-12-03 12:35:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:47,456 INFO L93 Difference]: Finished difference Result 238 states and 509 transitions. [2020-12-03 12:35:47,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-12-03 12:35:47,456 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2020-12-03 12:35:47,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:47,458 INFO L225 Difference]: With dead ends: 238 [2020-12-03 12:35:47,458 INFO L226 Difference]: Without dead ends: 189 [2020-12-03 12:35:47,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1293, Invalid=3129, Unknown=0, NotChecked=0, Total=4422 [2020-12-03 12:35:47,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-12-03 12:35:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 85. [2020-12-03 12:35:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-12-03 12:35:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 203 transitions. [2020-12-03 12:35:47,465 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 203 transitions. Word has length 22 [2020-12-03 12:35:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:47,465 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 203 transitions. [2020-12-03 12:35:47,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-12-03 12:35:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 203 transitions. [2020-12-03 12:35:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 12:35:47,466 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:47,466 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:47,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-03 12:35:47,681 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:47,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:47,681 INFO L82 PathProgramCache]: Analyzing trace with hash -825842986, now seen corresponding path program 12 times [2020-12-03 12:35:47,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:47,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914827243] [2020-12-03 12:35:47,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:47,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914827243] [2020-12-03 12:35:47,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120824803] [2020-12-03 12:35:47,868 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:35:47,948 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-03 12:35:47,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 12:35:47,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-03 12:35:47,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:35:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:47,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:35:47,986 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-03 12:35:47,986 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:48,003 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:48,020 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:48,038 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:48,057 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:48,078 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:48,099 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:48,120 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:48,143 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:48,170 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:48,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [148328392] [2020-12-03 12:35:48,324 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:35:48,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:35:48,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2020-12-03 12:35:48,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526446410] [2020-12-03 12:35:48,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-12-03 12:35:48,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:48,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-12-03 12:35:48,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2020-12-03 12:35:48,327 INFO L87 Difference]: Start difference. First operand 85 states and 203 transitions. Second operand 34 states. [2020-12-03 12:35:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:49,347 INFO L93 Difference]: Finished difference Result 242 states and 525 transitions. [2020-12-03 12:35:49,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-12-03 12:35:49,348 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2020-12-03 12:35:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:49,349 INFO L225 Difference]: With dead ends: 242 [2020-12-03 12:35:49,349 INFO L226 Difference]: Without dead ends: 191 [2020-12-03 12:35:49,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1487, Invalid=4063, Unknown=0, NotChecked=0, Total=5550 [2020-12-03 12:35:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-03 12:35:49,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 94. [2020-12-03 12:35:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-12-03 12:35:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 229 transitions. [2020-12-03 12:35:49,361 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 229 transitions. Word has length 22 [2020-12-03 12:35:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:49,361 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 229 transitions. [2020-12-03 12:35:49,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-12-03 12:35:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 229 transitions. [2020-12-03 12:35:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 12:35:49,362 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:49,362 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:49,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-03 12:35:49,590 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:49,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:49,591 INFO L82 PathProgramCache]: Analyzing trace with hash 382967990, now seen corresponding path program 13 times [2020-12-03 12:35:49,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:49,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366898423] [2020-12-03 12:35:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:49,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366898423] [2020-12-03 12:35:49,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528431840] [2020-12-03 12:35:49,754 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:35:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:49,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-03 12:35:49,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:35:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:49,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:35:49,855 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-03 12:35:49,856 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:49,871 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:50,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2146694970] [2020-12-03 12:35:50,156 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:35:50,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:35:50,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2020-12-03 12:35:50,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079186407] [2020-12-03 12:35:50,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-12-03 12:35:50,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:50,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-12-03 12:35:50,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2020-12-03 12:35:50,162 INFO L87 Difference]: Start difference. First operand 94 states and 229 transitions. Second operand 34 states. [2020-12-03 12:35:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:51,771 INFO L93 Difference]: Finished difference Result 302 states and 711 transitions. [2020-12-03 12:35:51,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2020-12-03 12:35:51,771 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2020-12-03 12:35:51,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:51,773 INFO L225 Difference]: With dead ends: 302 [2020-12-03 12:35:51,773 INFO L226 Difference]: Without dead ends: 203 [2020-12-03 12:35:51,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2389 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2499, Invalid=5691, Unknown=0, NotChecked=0, Total=8190 [2020-12-03 12:35:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-12-03 12:35:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 96. [2020-12-03 12:35:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-12-03 12:35:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 240 transitions. [2020-12-03 12:35:51,788 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 240 transitions. Word has length 22 [2020-12-03 12:35:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:51,788 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 240 transitions. [2020-12-03 12:35:51,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-12-03 12:35:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 240 transitions. [2020-12-03 12:35:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-03 12:35:51,789 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:51,789 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:51,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-03 12:35:51,997 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:51,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:51,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1762907359, now seen corresponding path program 14 times [2020-12-03 12:35:51,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:51,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870571476] [2020-12-03 12:35:51,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:52,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870571476] [2020-12-03 12:35:52,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769491423] [2020-12-03 12:35:52,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:35:52,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2020-12-03 12:35:52,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 12:35:52,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 35 conjunts are in the unsatisfiable core [2020-12-03 12:35:52,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:35:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:52,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:35:52,531 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-03 12:35:52,531 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:52,576 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:53,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1088896244] [2020-12-03 12:35:53,314 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:35:53,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:35:53,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 59 [2020-12-03 12:35:53,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115355504] [2020-12-03 12:35:53,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 61 states [2020-12-03 12:35:53,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:53,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2020-12-03 12:35:53,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=856, Invalid=2804, Unknown=0, NotChecked=0, Total=3660 [2020-12-03 12:35:53,329 INFO L87 Difference]: Start difference. First operand 96 states and 240 transitions. Second operand 61 states. [2020-12-03 12:35:55,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:55,987 INFO L93 Difference]: Finished difference Result 304 states and 737 transitions. [2020-12-03 12:35:55,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2020-12-03 12:35:55,988 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 35 [2020-12-03 12:35:55,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:55,990 INFO L225 Difference]: With dead ends: 304 [2020-12-03 12:35:55,990 INFO L226 Difference]: Without dead ends: 206 [2020-12-03 12:35:55,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=6138, Invalid=14454, Unknown=0, NotChecked=0, Total=20592 [2020-12-03 12:35:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-12-03 12:35:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 117. [2020-12-03 12:35:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-12-03 12:35:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 287 transitions. [2020-12-03 12:35:56,002 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 287 transitions. Word has length 35 [2020-12-03 12:35:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:56,002 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 287 transitions. [2020-12-03 12:35:56,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2020-12-03 12:35:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 287 transitions. [2020-12-03 12:35:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-03 12:35:56,003 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:56,003 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:35:56,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-03 12:35:56,229 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:35:56,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:35:56,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2024056099, now seen corresponding path program 15 times [2020-12-03 12:35:56,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:35:56,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097505493] [2020-12-03 12:35:56,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:35:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:35:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:56,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097505493] [2020-12-03 12:35:56,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265081175] [2020-12-03 12:35:56,921 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 12:35:57,004 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-03 12:35:57,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 12:35:57,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 45 conjunts are in the unsatisfiable core [2020-12-03 12:35:57,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 12:35:57,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-03 12:35:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:57,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 12:35:57,135 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-03 12:35:57,135 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:57,139 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-03 12:35:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:35:57,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [111913513] [2020-12-03 12:35:57,246 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-03 12:35:57,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-03 12:35:57,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 43 [2020-12-03 12:35:57,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235079076] [2020-12-03 12:35:57,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 45 states [2020-12-03 12:35:57,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:35:57,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2020-12-03 12:35:57,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1528, Unknown=0, NotChecked=0, Total=1980 [2020-12-03 12:35:57,249 INFO L87 Difference]: Start difference. First operand 117 states and 287 transitions. Second operand 45 states. [2020-12-03 12:35:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:35:59,913 INFO L93 Difference]: Finished difference Result 204 states and 503 transitions. [2020-12-03 12:35:59,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2020-12-03 12:35:59,917 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 47 [2020-12-03 12:35:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:35:59,918 INFO L225 Difference]: With dead ends: 204 [2020-12-03 12:35:59,919 INFO L226 Difference]: Without dead ends: 199 [2020-12-03 12:35:59,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4582, Invalid=10180, Unknown=0, NotChecked=0, Total=14762 [2020-12-03 12:35:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-12-03 12:35:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 157. [2020-12-03 12:35:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-03 12:35:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 407 transitions. [2020-12-03 12:35:59,926 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 407 transitions. Word has length 47 [2020-12-03 12:35:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:35:59,927 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 407 transitions. [2020-12-03 12:35:59,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2020-12-03 12:35:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 407 transitions. [2020-12-03 12:35:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-03 12:35:59,928 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:35:59,928 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:36:00,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-03 12:36:00,133 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:36:00,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:36:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash 988526380, now seen corresponding path program 16 times [2020-12-03 12:36:00,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:36:00,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611340928] [2020-12-03 12:36:00,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:36:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 12:36:00,190 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 12:36:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 12:36:00,220 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 12:36:00,251 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-03 12:36:00,251 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-03 12:36:00,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-03 12:36:00,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 12:36:00 BasicIcfg [2020-12-03 12:36:00,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-03 12:36:00,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-03 12:36:00,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-03 12:36:00,387 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-03 12:36:00,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:35:33" (3/4) ... [2020-12-03 12:36:00,389 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-03 12:36:00,494 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3887298e-d5f7-40c8-b1e9-0854ce43cb86/bin/utaipan/witness.graphml [2020-12-03 12:36:00,495 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-03 12:36:00,496 INFO L168 Benchmark]: Toolchain (without parser) took 28447.75 ms. Allocated memory was 83.9 MB in the beginning and 287.3 MB in the end (delta: 203.4 MB). Free memory was 50.7 MB in the beginning and 240.3 MB in the end (delta: -189.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 16.1 GB. [2020-12-03 12:36:00,496 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 83.9 MB. Free memory was 58.0 MB in the beginning and 58.0 MB in the end (delta: 30.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 12:36:00,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.90 ms. Allocated memory is still 83.9 MB. Free memory was 50.5 MB in the beginning and 42.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-03 12:36:00,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.39 ms. Allocated memory is still 83.9 MB. Free memory was 42.5 MB in the beginning and 40.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 12:36:00,497 INFO L168 Benchmark]: Boogie Preprocessor took 56.49 ms. Allocated memory is still 83.9 MB. Free memory was 40.5 MB in the beginning and 39.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 12:36:00,498 INFO L168 Benchmark]: RCFGBuilder took 635.87 ms. Allocated memory was 83.9 MB in the beginning and 109.1 MB in the end (delta: 25.2 MB). Free memory was 39.5 MB in the beginning and 74.1 MB in the end (delta: -34.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 16.1 GB. [2020-12-03 12:36:00,498 INFO L168 Benchmark]: TraceAbstraction took 26887.74 ms. Allocated memory was 109.1 MB in the beginning and 287.3 MB in the end (delta: 178.3 MB). Free memory was 73.5 MB in the beginning and 255.0 MB in the end (delta: -181.5 MB). Peak memory consumption was 161.4 MB. Max. memory is 16.1 GB. [2020-12-03 12:36:00,499 INFO L168 Benchmark]: Witness Printer took 108.31 ms. Allocated memory is still 287.3 MB. Free memory was 255.0 MB in the beginning and 240.3 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-03 12:36:00,501 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.26 ms. Allocated memory is still 83.9 MB. Free memory was 58.0 MB in the beginning and 58.0 MB in the end (delta: 30.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 687.90 ms. Allocated memory is still 83.9 MB. Free memory was 50.5 MB in the beginning and 42.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.39 ms. Allocated memory is still 83.9 MB. Free memory was 42.5 MB in the beginning and 40.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 56.49 ms. Allocated memory is still 83.9 MB. Free memory was 40.5 MB in the beginning and 39.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 635.87 ms. Allocated memory was 83.9 MB in the beginning and 109.1 MB in the end (delta: 25.2 MB). Free memory was 39.5 MB in the beginning and 74.1 MB in the end (delta: -34.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 26887.74 ms. Allocated memory was 109.1 MB in the beginning and 287.3 MB in the end (delta: 178.3 MB). Free memory was 73.5 MB in the beginning and 255.0 MB in the end (delta: -181.5 MB). Peak memory consumption was 161.4 MB. Max. memory is 16.1 GB. * Witness Printer took 108.31 ms. Allocated memory is still 287.3 MB. Free memory was 255.0 MB in the beginning and 240.3 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 645 VarBasedMoverChecksPositive, 20 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 20 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.2s, 20 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.1s, 62 PlacesBefore, 20 PlacesAfterwards, 60 TransitionsBefore, 16 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 5 FixpointIterations, 16 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 52 TotalNumberOfCompositions, 998 MoverChecksTotal - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=3, j=6] [L716] 0 int condI = i >= (2*20 +6); VAL [arg={0:0}, arg={0:0}, i=3, j=6] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=3, k=2] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=4, k=3] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=8, k=7] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=9, k=8] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=10] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=11, k=10] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=13, k=12] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=15, k=14] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=16, k=15] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=19, k=18] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=20] [L704] COND TRUE 2 k < 20 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] [L719] 0 int condJ = j >= (2*20 +6); [L721] COND TRUE 0 condI || condJ [L722] 0 reach_error() VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=20, k=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 26.6s, OverallIterations: 19, TraceHistogramMax: 20, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 256 SDtfs, 2786 SDslu, 1347 SDs, 0 SdLazy, 1713 SolverSat, 2371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1086 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 760 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17977 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 706 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 588 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 742 ConstructedInterpolants, 0 QuantifiedInterpolants, 71762 SizeOfPredicates, 155 NumberOfNonLiveVariables, 1700 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 42 InterpolantComputations, 6 PerfectInterpolantSequences, 0/2154 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...