./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longer-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e24917ef8695200a643e71e238ee3c2cc9fb2120 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:15:19,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:15:19,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:15:19,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:15:19,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:15:19,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:15:19,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:15:19,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:15:19,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:15:19,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:15:19,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:15:19,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:15:19,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:15:19,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:15:19,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:15:19,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:15:19,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:15:19,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:15:19,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:15:19,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:15:19,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:15:19,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:15:19,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:15:19,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:15:19,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:15:19,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:15:19,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:15:19,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:15:19,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:15:19,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:15:19,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:15:19,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:15:19,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:15:19,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:15:19,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:15:19,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:15:19,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:15:19,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:15:19,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:15:19,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:15:19,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:15:19,550 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:15:19,559 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:15:19,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:15:19,559 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:15:19,560 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:15:19,560 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:15:19,560 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:15:19,560 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:15:19,560 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:15:19,560 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:15:19,560 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:15:19,560 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:15:19,560 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:15:19,561 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:15:19,561 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:15:19,561 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:15:19,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:15:19,561 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:15:19,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:15:19,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:15:19,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:15:19,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:15:19,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:15:19,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:15:19,562 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:15:19,562 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:15:19,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:15:19,562 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:15:19,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:15:19,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:15:19,563 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:15:19,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:15:19,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:15:19,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:15:19,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:15:19,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:15:19,563 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:15:19,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:15:19,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:15:19,564 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:15:19,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:15:19,564 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/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(__VERIFIER_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 -> e24917ef8695200a643e71e238ee3c2cc9fb2120 [2019-12-07 11:15:19,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:15:19,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:15:19,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:15:19,685 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:15:19,685 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:15:19,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/bin/utaipan/../../sv-benchmarks/c/pthread/triangular-longer-1.i [2019-12-07 11:15:19,726 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/bin/utaipan/data/eb39bc571/2863319730484c69a4f5a925ea903342/FLAG50ead5a60 [2019-12-07 11:15:20,141 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:15:20,141 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/sv-benchmarks/c/pthread/triangular-longer-1.i [2019-12-07 11:15:20,150 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/bin/utaipan/data/eb39bc571/2863319730484c69a4f5a925ea903342/FLAG50ead5a60 [2019-12-07 11:15:20,504 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/bin/utaipan/data/eb39bc571/2863319730484c69a4f5a925ea903342 [2019-12-07 11:15:20,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:15:20,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:15:20,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:15:20,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:15:20,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:15:20,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:15:20" (1/1) ... [2019-12-07 11:15:20,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4853e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:20, skipping insertion in model container [2019-12-07 11:15:20,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:15:20" (1/1) ... [2019-12-07 11:15:20,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:15:20,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:15:20,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:15:20,786 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:15:20,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:15:20,858 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:15:20,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:20 WrapperNode [2019-12-07 11:15:20,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:15:20,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:15:20,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:15:20,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:15:20,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:20" (1/1) ... [2019-12-07 11:15:20,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:20" (1/1) ... [2019-12-07 11:15:20,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:15:20,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:15:20,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:15:20,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:15:20,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:20" (1/1) ... [2019-12-07 11:15:20,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:20" (1/1) ... [2019-12-07 11:15:20,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:20" (1/1) ... [2019-12-07 11:15:20,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:20" (1/1) ... [2019-12-07 11:15:20,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:20" (1/1) ... [2019-12-07 11:15:20,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:20" (1/1) ... [2019-12-07 11:15:20,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:20" (1/1) ... [2019-12-07 11:15:20,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:15:20,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:15:20,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:15:20,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:15:20,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/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 [2019-12-07 11:15:20,947 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-07 11:15:20,948 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-07 11:15:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-07 11:15:20,948 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-07 11:15:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:15:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:15:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:15:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:15:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:15:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:15:20,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:15:20,950 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 11:15:21,120 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:15:21,121 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 11:15:21,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:15:21 BoogieIcfgContainer [2019-12-07 11:15:21,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:15:21,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:15:21,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:15:21,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:15:21,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:15:20" (1/3) ... [2019-12-07 11:15:21,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5ae993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:15:21, skipping insertion in model container [2019-12-07 11:15:21,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:20" (2/3) ... [2019-12-07 11:15:21,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5ae993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:15:21, skipping insertion in model container [2019-12-07 11:15:21,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:15:21" (3/3) ... [2019-12-07 11:15:21,126 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-longer-1.i [2019-12-07 11:15:21,132 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:15:21,132 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:15:21,136 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:15:21,137 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:15:21,153 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,153 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,153 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,153 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,154 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,154 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,154 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,154 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,154 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,154 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,154 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,155 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,155 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,155 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,155 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,155 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,155 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,156 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,156 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,156 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,156 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,156 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,156 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,157 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,157 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,157 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,157 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,157 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:15:21,170 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-07 11:15:21,182 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:15:21,182 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:15:21,183 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:15:21,183 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:15:21,183 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:15:21,183 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:15:21,183 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:15:21,183 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:15:21,191 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions [2019-12-07 11:15:21,192 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-07 11:15:21,216 INFO L134 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-07 11:15:21,216 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:15:21,221 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 92 event pairs. 6/49 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-07 11:15:21,224 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-07 11:15:21,233 INFO L134 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-07 11:15:21,233 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:15:21,234 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 92 event pairs. 6/49 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-07 11:15:21,235 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 740 [2019-12-07 11:15:21,236 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:15:21,903 INFO L206 etLargeBlockEncoding]: Checked pairs total: 604 [2019-12-07 11:15:21,903 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-12-07 11:15:21,906 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 14 transitions [2019-12-07 11:15:21,912 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35 states. [2019-12-07 11:15:21,913 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-07 11:15:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:15:21,917 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:21,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:15:21,918 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:21,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:21,922 INFO L82 PathProgramCache]: Analyzing trace with hash 205828742, now seen corresponding path program 1 times [2019-12-07 11:15:21,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:21,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995349656] [2019-12-07 11:15:21,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:22,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995349656] [2019-12-07 11:15:22,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:22,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:15:22,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432712136] [2019-12-07 11:15:22,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:15:22,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:22,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:15:22,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:22,084 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-07 11:15:22,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:22,106 INFO L93 Difference]: Finished difference Result 44 states and 107 transitions. [2019-12-07 11:15:22,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:15:22,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 11:15:22,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:22,116 INFO L225 Difference]: With dead ends: 44 [2019-12-07 11:15:22,117 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 11:15:22,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:22,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 11:15:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 11:15:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 11:15:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 56 transitions. [2019-12-07 11:15:22,145 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 56 transitions. Word has length 5 [2019-12-07 11:15:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:22,145 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 56 transitions. [2019-12-07 11:15:22,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:15:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 56 transitions. [2019-12-07 11:15:22,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:15:22,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:22,146 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:22,146 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:22,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:22,147 INFO L82 PathProgramCache]: Analyzing trace with hash 232910220, now seen corresponding path program 1 times [2019-12-07 11:15:22,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:22,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920276592] [2019-12-07 11:15:22,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:22,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920276592] [2019-12-07 11:15:22,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:22,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:15:22,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330741449] [2019-12-07 11:15:22,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:15:22,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:22,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:15:22,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:15:22,213 INFO L87 Difference]: Start difference. First operand 26 states and 56 transitions. Second operand 4 states. [2019-12-07 11:15:22,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:22,240 INFO L93 Difference]: Finished difference Result 40 states and 82 transitions. [2019-12-07 11:15:22,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:15:22,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 11:15:22,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:22,241 INFO L225 Difference]: With dead ends: 40 [2019-12-07 11:15:22,241 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 11:15:22,241 INFO L630 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 [2019-12-07 11:15:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 11:15:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-12-07 11:15:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 11:15:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. [2019-12-07 11:15:22,245 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 7 [2019-12-07 11:15:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:22,246 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 54 transitions. [2019-12-07 11:15:22,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:15:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 54 transitions. [2019-12-07 11:15:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:15:22,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:22,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:22,247 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:22,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:22,247 INFO L82 PathProgramCache]: Analyzing trace with hash 484474390, now seen corresponding path program 1 times [2019-12-07 11:15:22,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:22,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159159898] [2019-12-07 11:15:22,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:22,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159159898] [2019-12-07 11:15:22,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:22,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:15:22,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187521172] [2019-12-07 11:15:22,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:15:22,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:22,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:15:22,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:15:22,301 INFO L87 Difference]: Start difference. First operand 26 states and 54 transitions. Second operand 5 states. [2019-12-07 11:15:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:22,332 INFO L93 Difference]: Finished difference Result 38 states and 78 transitions. [2019-12-07 11:15:22,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:15:22,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 11:15:22,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:22,333 INFO L225 Difference]: With dead ends: 38 [2019-12-07 11:15:22,333 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 11:15:22,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:15:22,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 11:15:22,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-12-07 11:15:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 11:15:22,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-07 11:15:22,337 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 9 [2019-12-07 11:15:22,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:22,338 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-07 11:15:22,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:15:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-07 11:15:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:15:22,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:22,339 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:22,339 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:22,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:22,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2117948007, now seen corresponding path program 2 times [2019-12-07 11:15:22,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:22,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544929511] [2019-12-07 11:15:22,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:22,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544929511] [2019-12-07 11:15:22,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376571295] [2019-12-07 11:15:22,406 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/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 [2019-12-07 11:15:22,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 11:15:22,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:15:22,451 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:15:22,454 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:15:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:22,475 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:15:22,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:15:22,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:15:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:22,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [892178745] [2019-12-07 11:15:22,509 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:175) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1556) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:482) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:472) at java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:485) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 11:15:22,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:15:22,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2019-12-07 11:15:22,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455398715] [2019-12-07 11:15:22,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:15:22,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:22,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:15:22,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:15:22,511 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 10 states. [2019-12-07 11:15:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:22,599 INFO L93 Difference]: Finished difference Result 45 states and 92 transitions. [2019-12-07 11:15:22,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:15:22,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-12-07 11:15:22,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:22,600 INFO L225 Difference]: With dead ends: 45 [2019-12-07 11:15:22,600 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 11:15:22,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:15:22,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 11:15:22,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-12-07 11:15:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 11:15:22,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 68 transitions. [2019-12-07 11:15:22,604 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 68 transitions. Word has length 10 [2019-12-07 11:15:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:22,604 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 68 transitions. [2019-12-07 11:15:22,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:15:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 68 transitions. [2019-12-07 11:15:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:15:22,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:22,604 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:22,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:15:22,805 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:22,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1723422894, now seen corresponding path program 3 times [2019-12-07 11:15:22,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:22,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624244606] [2019-12-07 11:15:22,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:22,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624244606] [2019-12-07 11:15:22,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839455158] [2019-12-07 11:15:22,920 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/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 [2019-12-07 11:15:22,956 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 11:15:22,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:15:22,957 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:15:22,958 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:15:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:22,969 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:15:22,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:15:22,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:15:22,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:15:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:23,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1608492115] [2019-12-07 11:15:23,012 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.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:175) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1556) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:482) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:472) at java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:485) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 11:15:23,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:15:23,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2019-12-07 11:15:23,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587061741] [2019-12-07 11:15:23,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:15:23,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:23,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:15:23,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:15:23,014 INFO L87 Difference]: Start difference. First operand 33 states and 68 transitions. Second operand 12 states. [2019-12-07 11:15:23,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:23,130 INFO L93 Difference]: Finished difference Result 57 states and 116 transitions. [2019-12-07 11:15:23,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:15:23,130 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-12-07 11:15:23,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:23,131 INFO L225 Difference]: With dead ends: 57 [2019-12-07 11:15:23,131 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 11:15:23,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:15:23,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 11:15:23,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2019-12-07 11:15:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 11:15:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2019-12-07 11:15:23,135 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 11 [2019-12-07 11:15:23,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:23,135 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 56 transitions. [2019-12-07 11:15:23,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:15:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 56 transitions. [2019-12-07 11:15:23,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:15:23,135 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:23,135 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:23,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:15:23,336 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:23,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:23,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2135428606, now seen corresponding path program 4 times [2019-12-07 11:15:23,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:23,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527800270] [2019-12-07 11:15:23,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:23,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527800270] [2019-12-07 11:15:23,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594184798] [2019-12-07 11:15:23,486 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/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 [2019-12-07 11:15:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:23,523 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:15:23,524 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:15:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:23,536 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:15:23,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:15:23,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:15:23,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:15:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:23,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [824084750] [2019-12-07 11:15:23,615 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.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:175) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1556) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:482) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:472) at java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:485) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 11:15:23,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:15:23,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2019-12-07 11:15:23,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748170690] [2019-12-07 11:15:23,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:15:23,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:23,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:15:23,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:15:23,616 INFO L87 Difference]: Start difference. First operand 27 states and 56 transitions. Second operand 20 states. [2019-12-07 11:15:23,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:23,852 INFO L93 Difference]: Finished difference Result 75 states and 152 transitions. [2019-12-07 11:15:23,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:15:23,852 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 15 [2019-12-07 11:15:23,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:23,852 INFO L225 Difference]: With dead ends: 75 [2019-12-07 11:15:23,853 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 11:15:23,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=428, Invalid=832, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 11:15:23,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 11:15:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2019-12-07 11:15:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 11:15:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 80 transitions. [2019-12-07 11:15:23,857 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 80 transitions. Word has length 15 [2019-12-07 11:15:23,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:23,857 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 80 transitions. [2019-12-07 11:15:23,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:15:23,857 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 80 transitions. [2019-12-07 11:15:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:15:23,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:23,858 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:24,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:15:24,059 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:24,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:24,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2015657050, now seen corresponding path program 5 times [2019-12-07 11:15:24,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:24,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5736573] [2019-12-07 11:15:24,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:24,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5736573] [2019-12-07 11:15:24,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704806322] [2019-12-07 11:15:24,213 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/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 [2019-12-07 11:15:24,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-12-07 11:15:24,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:15:24,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 11:15:24,255 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:15:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:24,278 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:15:24,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:15:24,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:15:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:24,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1229113204] [2019-12-07 11:15:24,419 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.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:175) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1556) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:482) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:472) at java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:485) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 11:15:24,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:15:24,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2019-12-07 11:15:24,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800218052] [2019-12-07 11:15:24,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 11:15:24,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:24,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 11:15:24,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:15:24,420 INFO L87 Difference]: Start difference. First operand 39 states and 80 transitions. Second operand 25 states. [2019-12-07 11:15:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:24,722 INFO L93 Difference]: Finished difference Result 81 states and 164 transitions. [2019-12-07 11:15:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 11:15:24,723 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-12-07 11:15:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:24,723 INFO L225 Difference]: With dead ends: 81 [2019-12-07 11:15:24,724 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 11:15:24,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=586, Invalid=1306, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 11:15:24,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 11:15:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2019-12-07 11:15:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 11:15:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 80 transitions. [2019-12-07 11:15:24,728 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 80 transitions. Word has length 21 [2019-12-07 11:15:24,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:24,728 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 80 transitions. [2019-12-07 11:15:24,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 11:15:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 80 transitions. [2019-12-07 11:15:24,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:15:24,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:24,729 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:24,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:15:24,930 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:24,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:24,931 INFO L82 PathProgramCache]: Analyzing trace with hash -698357774, now seen corresponding path program 6 times [2019-12-07 11:15:24,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:24,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665517521] [2019-12-07 11:15:24,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:25,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665517521] [2019-12-07 11:15:25,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236001976] [2019-12-07 11:15:25,135 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/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 [2019-12-07 11:15:25,178 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 11:15:25,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:15:25,179 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 11:15:25,180 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:15:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:25,199 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:15:25,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:15:25,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:15:25,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:15:25,434 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:25,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2067283699] [2019-12-07 11:15:25,434 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.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:175) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1556) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:482) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:472) at java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:485) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 11:15:25,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:15:25,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2019-12-07 11:15:25,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301589944] [2019-12-07 11:15:25,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-07 11:15:25,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:25,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-07 11:15:25,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=1422, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 11:15:25,436 INFO L87 Difference]: Start difference. First operand 39 states and 80 transitions. Second operand 44 states. [2019-12-07 11:15:25,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:25,863 INFO L93 Difference]: Finished difference Result 75 states and 152 transitions. [2019-12-07 11:15:25,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 11:15:25,863 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 27 [2019-12-07 11:15:25,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:25,864 INFO L225 Difference]: With dead ends: 75 [2019-12-07 11:15:25,864 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 11:15:25,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1283, Invalid=3007, Unknown=0, NotChecked=0, Total=4290 [2019-12-07 11:15:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 11:15:25,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-07 11:15:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 11:15:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 134 transitions. [2019-12-07 11:15:25,872 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 134 transitions. Word has length 27 [2019-12-07 11:15:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:25,872 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 134 transitions. [2019-12-07 11:15:25,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-07 11:15:25,872 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 134 transitions. [2019-12-07 11:15:25,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:15:25,873 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:25,873 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:26,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:15:26,075 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:26,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:26,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1697011851, now seen corresponding path program 7 times [2019-12-07 11:15:26,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:26,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870621398] [2019-12-07 11:15:26,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 90 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:26,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870621398] [2019-12-07 11:15:26,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940027284] [2019-12-07 11:15:26,183 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/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 [2019-12-07 11:15:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:26,223 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:15:26,224 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:15:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:26,233 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:15:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:26,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:15:26,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [13] total 14 [2019-12-07 11:15:26,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010617982] [2019-12-07 11:15:26,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:15:26,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:26,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:15:26,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:15:26,286 INFO L87 Difference]: Start difference. First operand 66 states and 134 transitions. Second operand 13 states. [2019-12-07 11:15:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:26,305 INFO L93 Difference]: Finished difference Result 263 states and 480 transitions. [2019-12-07 11:15:26,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:15:26,305 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-12-07 11:15:26,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:26,305 INFO L225 Difference]: With dead ends: 263 [2019-12-07 11:15:26,305 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:15:26,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 10 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:15:26,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:15:26,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:15:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:15:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:15:26,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-12-07 11:15:26,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:26,306 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:15:26,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:15:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:15:26,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:15:26,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:15:26,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:15:26 BasicIcfg [2019-12-07 11:15:26,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:15:26,512 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:15:26,512 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:15:26,512 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:15:26,513 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:15:21" (3/4) ... [2019-12-07 11:15:26,517 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:15:26,526 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2019-12-07 11:15:26,526 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2019-12-07 11:15:26,531 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-12-07 11:15:26,531 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 11:15:26,531 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 11:15:26,582 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e95f2e30-d8c5-4a1f-804f-9d740e6ac350/bin/utaipan/witness.graphml [2019-12-07 11:15:26,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:15:26,585 INFO L168 Benchmark]: Toolchain (without parser) took 6074.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 936.0 MB in the beginning and 1.0 GB in the end (delta: -94.5 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:26,586 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:15:26,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -132.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:26,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:26,588 INFO L168 Benchmark]: Boogie Preprocessor took 17.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:15:26,588 INFO L168 Benchmark]: RCFGBuilder took 215.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:26,589 INFO L168 Benchmark]: TraceAbstraction took 5389.37 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.8 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:26,590 INFO L168 Benchmark]: Witness Printer took 70.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:26,593 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 347.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -132.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 215.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5389.37 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.8 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. * Witness Printer took 70.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 53 ProgramPointsBefore, 16 ProgramPointsAfterwards, 51 TransitionsBefore, 14 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 380 VarBasedMoverChecksPositive, 7 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 9 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 604 CheckedPairsTotal, 41 TotalNumberOfCompositions - PositiveResult [Line: 703]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: SAFE, OverallTime: 5.3s, OverallIterations: 9, TraceHistogramMax: 11, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 137 SDtfs, 483 SDslu, 291 SDs, 0 SdLazy, 305 SolverSat, 459 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 144 SyntacticMatches, 22 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2224 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 53 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 20402 SizeOfPredicates, 44 NumberOfNonLiveVariables, 758 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 290/741 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...