./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/triangular-longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/triangular-longer-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff437623f349039c7c835e26d53647ec95811c37 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 07:32:14,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 07:32:14,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 07:32:14,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 07:32:14,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 07:32:14,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 07:32:14,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 07:32:14,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 07:32:14,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 07:32:14,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 07:32:14,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 07:32:14,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 07:32:14,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 07:32:14,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 07:32:14,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 07:32:14,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 07:32:14,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 07:32:14,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 07:32:14,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 07:32:14,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 07:32:14,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 07:32:14,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 07:32:14,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 07:32:14,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 07:32:14,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 07:32:14,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 07:32:14,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 07:32:14,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 07:32:14,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 07:32:14,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 07:32:14,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 07:32:14,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 07:32:14,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 07:32:14,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 07:32:14,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 07:32:14,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 07:32:14,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 07:32:14,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 07:32:14,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 07:32:14,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 07:32:14,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 07:32:14,863 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-28 07:32:14,888 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 07:32:14,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 07:32:14,890 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-28 07:32:14,890 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-28 07:32:14,890 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-28 07:32:14,891 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-28 07:32:14,891 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-28 07:32:14,891 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-28 07:32:14,891 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-28 07:32:14,891 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-28 07:32:14,892 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-28 07:32:14,892 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-28 07:32:14,892 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-28 07:32:14,892 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-28 07:32:14,893 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-28 07:32:14,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 07:32:14,894 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 07:32:14,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 07:32:14,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 07:32:14,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 07:32:14,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 07:32:14,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 07:32:14,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 07:32:14,895 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-28 07:32:14,895 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 07:32:14,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 07:32:14,896 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 07:32:14,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 07:32:14,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 07:32:14,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 07:32:14,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 07:32:14,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 07:32:14,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 07:32:14,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 07:32:14,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 07:32:14,898 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-28 07:32:14,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 07:32:14,898 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 07:32:14,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 07:32:14,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-28 07:32:14,899 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff437623f349039c7c835e26d53647ec95811c37 [2020-11-28 07:32:15,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 07:32:15,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 07:32:15,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 07:32:15,224 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 07:32:15,225 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 07:32:15,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/../../sv-benchmarks/c/pthread/triangular-longer-2.i [2020-11-28 07:32:15,313 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/data/1d4b8568d/e5cc8310038a47219a6fa0aa8bf519ac/FLAGd9069c232 [2020-11-28 07:32:15,911 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 07:32:15,911 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/sv-benchmarks/c/pthread/triangular-longer-2.i [2020-11-28 07:32:15,938 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/data/1d4b8568d/e5cc8310038a47219a6fa0aa8bf519ac/FLAGd9069c232 [2020-11-28 07:32:16,173 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/data/1d4b8568d/e5cc8310038a47219a6fa0aa8bf519ac [2020-11-28 07:32:16,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 07:32:16,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 07:32:16,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 07:32:16,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 07:32:16,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 07:32:16,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:32:16" (1/1) ... [2020-11-28 07:32:16,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35eb7c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:32:16, skipping insertion in model container [2020-11-28 07:32:16,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:32:16" (1/1) ... [2020-11-28 07:32:16,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 07:32:16,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 07:32:16,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:32:16,636 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 07:32:16,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:32:16,770 INFO L208 MainTranslator]: Completed translation [2020-11-28 07:32:16,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:32:16 WrapperNode [2020-11-28 07:32:16,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 07:32:16,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 07:32:16,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 07:32:16,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 07:32:16,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:32:16" (1/1) ... [2020-11-28 07:32:16,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:32:16" (1/1) ... [2020-11-28 07:32:16,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 07:32:16,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 07:32:16,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 07:32:16,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 07:32:16,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:32:16" (1/1) ... [2020-11-28 07:32:16,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:32:16" (1/1) ... [2020-11-28 07:32:16,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:32:16" (1/1) ... [2020-11-28 07:32:16,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:32:16" (1/1) ... [2020-11-28 07:32:16,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:32:16" (1/1) ... [2020-11-28 07:32:16,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:32:16" (1/1) ... [2020-11-28 07:32:16,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:32:16" (1/1) ... [2020-11-28 07:32:16,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 07:32:16,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 07:32:16,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 07:32:16,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 07:32:16,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:32:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 07:32:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-11-28 07:32:16,977 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-11-28 07:32:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-11-28 07:32:16,977 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-11-28 07:32:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 07:32:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 07:32:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 07:32:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 07:32:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 07:32:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 07:32:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 07:32:16,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 07:32:16,981 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 07:32:17,485 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 07:32:17,486 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-11-28 07:32:17,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:32:17 BoogieIcfgContainer [2020-11-28 07:32:17,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 07:32:17,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 07:32:17,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 07:32:17,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 07:32:17,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:32:16" (1/3) ... [2020-11-28 07:32:17,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc75bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:32:17, skipping insertion in model container [2020-11-28 07:32:17,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:32:16" (2/3) ... [2020-11-28 07:32:17,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc75bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:32:17, skipping insertion in model container [2020-11-28 07:32:17,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:32:17" (3/3) ... [2020-11-28 07:32:17,496 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2020-11-28 07:32:17,507 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 07:32:17,507 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 07:32:17,512 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-28 07:32:17,513 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 07:32:17,540 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,540 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,540 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,540 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,541 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,541 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,541 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,542 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,542 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,542 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,542 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,542 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,543 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,543 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,543 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,543 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,544 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,544 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,544 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,544 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,544 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,545 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,545 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,545 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,545 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,545 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,546 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,546 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,548 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,548 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,548 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,548 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,548 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,549 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,555 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,556 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,556 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,556 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,556 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,556 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:32:17,574 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 07:32:17,585 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-11-28 07:32:17,621 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 07:32:17,621 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 07:32:17,621 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 07:32:17,622 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 07:32:17,622 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 07:32:17,622 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 07:32:17,622 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 07:32:17,622 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 07:32:17,637 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 07:32:17,639 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 64 transitions, 138 flow [2020-11-28 07:32:17,643 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 64 transitions, 138 flow [2020-11-28 07:32:17,645 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 65 places, 64 transitions, 138 flow [2020-11-28 07:32:17,713 INFO L129 PetriNetUnfolder]: 6/62 cut-off events. [2020-11-28 07:32:17,714 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 07:32:17,720 INFO L80 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 62 events. 6/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-11-28 07:32:17,725 INFO L116 LiptonReduction]: Number of co-enabled transitions 1144 [2020-11-28 07:32:19,578 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-11-28 07:32:19,998 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2020-11-28 07:32:20,206 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-28 07:32:20,221 INFO L131 LiptonReduction]: Checked pairs total: 1062 [2020-11-28 07:32:20,222 INFO L133 LiptonReduction]: Total number of compositions: 60 [2020-11-28 07:32:20,227 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2020-11-28 07:32:20,235 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-11-28 07:32:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-11-28 07:32:20,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-28 07:32:20,242 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:32:20,243 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-28 07:32:20,243 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:32:20,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:32:20,249 INFO L82 PathProgramCache]: Analyzing trace with hash -720017533, now seen corresponding path program 1 times [2020-11-28 07:32:20,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:32:20,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497746013] [2020-11-28 07:32:20,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:32:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:32:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:32:20,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497746013] [2020-11-28 07:32:20,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:32:20,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 07:32:20,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599470109] [2020-11-28 07:32:20,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:32:20,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:32:20,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:32:20,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:32:20,618 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-11-28 07:32:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:32:20,716 INFO L93 Difference]: Finished difference Result 75 states and 190 transitions. [2020-11-28 07:32:20,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:32:20,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-11-28 07:32:20,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:32:20,732 INFO L225 Difference]: With dead ends: 75 [2020-11-28 07:32:20,733 INFO L226 Difference]: Without dead ends: 42 [2020-11-28 07:32:20,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:32:20,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-28 07:32:20,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-28 07:32:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-28 07:32:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 98 transitions. [2020-11-28 07:32:20,791 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 98 transitions. Word has length 6 [2020-11-28 07:32:20,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:32:20,792 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 98 transitions. [2020-11-28 07:32:20,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:32:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 98 transitions. [2020-11-28 07:32:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-28 07:32:20,794 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:32:20,794 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:32:20,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 07:32:20,794 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:32:20,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:32:20,799 INFO L82 PathProgramCache]: Analyzing trace with hash -447013893, now seen corresponding path program 1 times [2020-11-28 07:32:20,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:32:20,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032184544] [2020-11-28 07:32:20,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:32:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:32:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:32:20,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032184544] [2020-11-28 07:32:20,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:32:20,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:32:20,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635768449] [2020-11-28 07:32:20,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:32:20,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:32:20,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:32:20,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:32:20,944 INFO L87 Difference]: Start difference. First operand 42 states and 98 transitions. Second operand 5 states. [2020-11-28 07:32:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:32:20,993 INFO L93 Difference]: Finished difference Result 56 states and 130 transitions. [2020-11-28 07:32:20,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:32:20,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-11-28 07:32:20,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:32:20,996 INFO L225 Difference]: With dead ends: 56 [2020-11-28 07:32:20,996 INFO L226 Difference]: Without dead ends: 50 [2020-11-28 07:32:20,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:32:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-28 07:32:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2020-11-28 07:32:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-28 07:32:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2020-11-28 07:32:21,004 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 100 transitions. Word has length 8 [2020-11-28 07:32:21,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:32:21,005 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 100 transitions. [2020-11-28 07:32:21,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:32:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 100 transitions. [2020-11-28 07:32:21,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 07:32:21,006 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:32:21,006 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:32:21,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 07:32:21,006 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:32:21,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:32:21,007 INFO L82 PathProgramCache]: Analyzing trace with hash -190894617, now seen corresponding path program 1 times [2020-11-28 07:32:21,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:32:21,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239407609] [2020-11-28 07:32:21,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:32:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:32:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:32:21,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239407609] [2020-11-28 07:32:21,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:32:21,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:32:21,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816983341] [2020-11-28 07:32:21,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:32:21,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:32:21,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:32:21,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:32:21,134 INFO L87 Difference]: Start difference. First operand 42 states and 100 transitions. Second operand 6 states. [2020-11-28 07:32:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:32:21,235 INFO L93 Difference]: Finished difference Result 54 states and 124 transitions. [2020-11-28 07:32:21,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 07:32:21,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-28 07:32:21,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:32:21,239 INFO L225 Difference]: With dead ends: 54 [2020-11-28 07:32:21,239 INFO L226 Difference]: Without dead ends: 47 [2020-11-28 07:32:21,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:32:21,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-28 07:32:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-11-28 07:32:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-28 07:32:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 106 transitions. [2020-11-28 07:32:21,247 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 106 transitions. Word has length 10 [2020-11-28 07:32:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:32:21,247 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 106 transitions. [2020-11-28 07:32:21,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:32:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 106 transitions. [2020-11-28 07:32:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 07:32:21,248 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:32:21,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:32:21,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 07:32:21,248 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:32:21,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:32:21,249 INFO L82 PathProgramCache]: Analyzing trace with hash -83647017, now seen corresponding path program 2 times [2020-11-28 07:32:21,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:32:21,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652950710] [2020-11-28 07:32:21,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:32:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:32:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:32:21,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652950710] [2020-11-28 07:32:21,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:32:21,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:32:21,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794483272] [2020-11-28 07:32:21,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:32:21,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:32:21,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:32:21,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:32:21,395 INFO L87 Difference]: Start difference. First operand 45 states and 106 transitions. Second operand 6 states. [2020-11-28 07:32:21,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:32:21,492 INFO L93 Difference]: Finished difference Result 84 states and 192 transitions. [2020-11-28 07:32:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 07:32:21,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-28 07:32:21,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:32:21,494 INFO L225 Difference]: With dead ends: 84 [2020-11-28 07:32:21,494 INFO L226 Difference]: Without dead ends: 77 [2020-11-28 07:32:21,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:32:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-28 07:32:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2020-11-28 07:32:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-28 07:32:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 115 transitions. [2020-11-28 07:32:21,504 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 115 transitions. Word has length 10 [2020-11-28 07:32:21,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:32:21,504 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 115 transitions. [2020-11-28 07:32:21,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:32:21,504 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 115 transitions. [2020-11-28 07:32:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 07:32:21,505 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:32:21,505 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:32:21,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 07:32:21,506 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:32:21,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:32:21,507 INFO L82 PathProgramCache]: Analyzing trace with hash -83970657, now seen corresponding path program 3 times [2020-11-28 07:32:21,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:32:21,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577177022] [2020-11-28 07:32:21,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:32:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:32:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:32:21,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577177022] [2020-11-28 07:32:21,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:32:21,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:32:21,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140614472] [2020-11-28 07:32:21,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:32:21,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:32:21,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:32:21,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:32:21,568 INFO L87 Difference]: Start difference. First operand 47 states and 115 transitions. Second operand 6 states. [2020-11-28 07:32:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:32:21,660 INFO L93 Difference]: Finished difference Result 61 states and 139 transitions. [2020-11-28 07:32:21,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 07:32:21,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-28 07:32:21,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:32:21,661 INFO L225 Difference]: With dead ends: 61 [2020-11-28 07:32:21,662 INFO L226 Difference]: Without dead ends: 50 [2020-11-28 07:32:21,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:32:21,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-28 07:32:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2020-11-28 07:32:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-28 07:32:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 96 transitions. [2020-11-28 07:32:21,670 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 96 transitions. Word has length 10 [2020-11-28 07:32:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:32:21,670 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 96 transitions. [2020-11-28 07:32:21,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:32:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 96 transitions. [2020-11-28 07:32:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 07:32:21,671 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:32:21,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:32:21,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 07:32:21,672 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:32:21,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:32:21,673 INFO L82 PathProgramCache]: Analyzing trace with hash -118912617, now seen corresponding path program 4 times [2020-11-28 07:32:21,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:32:21,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410283350] [2020-11-28 07:32:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:32:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:32:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:32:21,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410283350] [2020-11-28 07:32:21,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:32:21,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:32:21,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004349911] [2020-11-28 07:32:21,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:32:21,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:32:21,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:32:21,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:32:21,783 INFO L87 Difference]: Start difference. First operand 40 states and 96 transitions. Second operand 6 states. [2020-11-28 07:32:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:32:21,884 INFO L93 Difference]: Finished difference Result 55 states and 129 transitions. [2020-11-28 07:32:21,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 07:32:21,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-28 07:32:21,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:32:21,889 INFO L225 Difference]: With dead ends: 55 [2020-11-28 07:32:21,889 INFO L226 Difference]: Without dead ends: 49 [2020-11-28 07:32:21,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:32:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-28 07:32:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2020-11-28 07:32:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-28 07:32:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 99 transitions. [2020-11-28 07:32:21,898 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 99 transitions. Word has length 10 [2020-11-28 07:32:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:32:21,899 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 99 transitions. [2020-11-28 07:32:21,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:32:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 99 transitions. [2020-11-28 07:32:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 07:32:21,901 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:32:21,901 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:32:21,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 07:32:21,901 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:32:21,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:32:21,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1691902418, now seen corresponding path program 5 times [2020-11-28 07:32:21,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:32:21,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184375052] [2020-11-28 07:32:21,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:32:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:32:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:32:22,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184375052] [2020-11-28 07:32:22,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359826831] [2020-11-28 07:32:22,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:32:22,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-11-28 07:32:22,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 07:32:22,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-28 07:32:22,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:32:22,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:32:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:32:22,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:32:22,300 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:32:22,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:22,346 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:32:22,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:22,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:32:22,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [873513083] [2020-11-28 07:32:22,493 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 07:32:22,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-28 07:32:22,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2020-11-28 07:32:22,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984490506] [2020-11-28 07:32:22,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-28 07:32:22,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:32:22,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-28 07:32:22,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-11-28 07:32:22,501 INFO L87 Difference]: Start difference. First operand 41 states and 99 transitions. Second operand 13 states. [2020-11-28 07:32:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:32:22,827 INFO L93 Difference]: Finished difference Result 82 states and 197 transitions. [2020-11-28 07:32:22,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-28 07:32:22,828 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2020-11-28 07:32:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:32:22,829 INFO L225 Difference]: With dead ends: 82 [2020-11-28 07:32:22,829 INFO L226 Difference]: Without dead ends: 56 [2020-11-28 07:32:22,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2020-11-28 07:32:22,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-28 07:32:22,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2020-11-28 07:32:22,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-28 07:32:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2020-11-28 07:32:22,835 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 11 [2020-11-28 07:32:22,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:32:22,835 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2020-11-28 07:32:22,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-28 07:32:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2020-11-28 07:32:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 07:32:22,846 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:32:22,846 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:32:23,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-28 07:32:23,047 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:32:23,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:32:23,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1230025166, now seen corresponding path program 6 times [2020-11-28 07:32:23,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:32:23,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009725328] [2020-11-28 07:32:23,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:32:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:32:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:32:23,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009725328] [2020-11-28 07:32:23,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201121251] [2020-11-28 07:32:23,179 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:32:23,263 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-28 07:32:23,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 07:32:23,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-28 07:32:23,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:32:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:32:23,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:32:23,291 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:32:23,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:23,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:23,336 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:23,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:23,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:23,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:23,414 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:32:23,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:32:23,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1768472051] [2020-11-28 07:32:23,454 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 07:32:23,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-28 07:32:23,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2020-11-28 07:32:23,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201899309] [2020-11-28 07:32:23,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-28 07:32:23,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:32:23,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-28 07:32:23,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-11-28 07:32:23,456 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand 16 states. [2020-11-28 07:32:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:32:23,824 INFO L93 Difference]: Finished difference Result 91 states and 202 transitions. [2020-11-28 07:32:23,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-28 07:32:23,825 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-11-28 07:32:23,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:32:23,826 INFO L225 Difference]: With dead ends: 91 [2020-11-28 07:32:23,826 INFO L226 Difference]: Without dead ends: 66 [2020-11-28 07:32:23,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2020-11-28 07:32:23,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-28 07:32:23,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2020-11-28 07:32:23,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-11-28 07:32:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 136 transitions. [2020-11-28 07:32:23,840 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 136 transitions. Word has length 14 [2020-11-28 07:32:23,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:32:23,841 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 136 transitions. [2020-11-28 07:32:23,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-28 07:32:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 136 transitions. [2020-11-28 07:32:23,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 07:32:23,842 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:32:23,842 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:32:24,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:32:24,043 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:32:24,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:32:24,043 INFO L82 PathProgramCache]: Analyzing trace with hash 415819444, now seen corresponding path program 7 times [2020-11-28 07:32:24,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:32:24,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435215441] [2020-11-28 07:32:24,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:32:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:32:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:32:24,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435215441] [2020-11-28 07:32:24,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848457974] [2020-11-28 07:32:24,135 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:32:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:32:24,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-28 07:32:24,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:32:24,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:32:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:32:24,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:32:24,249 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:32:24,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:24,279 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:32:24,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:24,308 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:24,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:32:24,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [570670870] [2020-11-28 07:32:24,418 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 07:32:24,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-28 07:32:24,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2020-11-28 07:32:24,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050623661] [2020-11-28 07:32:24,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-28 07:32:24,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:32:24,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-28 07:32:24,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2020-11-28 07:32:24,420 INFO L87 Difference]: Start difference. First operand 58 states and 136 transitions. Second operand 17 states. [2020-11-28 07:32:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:32:25,104 INFO L93 Difference]: Finished difference Result 157 states and 377 transitions. [2020-11-28 07:32:25,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-28 07:32:25,105 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2020-11-28 07:32:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:32:25,106 INFO L225 Difference]: With dead ends: 157 [2020-11-28 07:32:25,106 INFO L226 Difference]: Without dead ends: 108 [2020-11-28 07:32:25,107 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=478, Invalid=1004, Unknown=0, NotChecked=0, Total=1482 [2020-11-28 07:32:25,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-11-28 07:32:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 65. [2020-11-28 07:32:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-28 07:32:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 161 transitions. [2020-11-28 07:32:25,113 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 161 transitions. Word has length 14 [2020-11-28 07:32:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:32:25,114 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 161 transitions. [2020-11-28 07:32:25,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-28 07:32:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 161 transitions. [2020-11-28 07:32:25,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 07:32:25,115 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:32:25,115 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:32:25,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:32:25,316 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:32:25,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:32:25,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1483738395, now seen corresponding path program 8 times [2020-11-28 07:32:25,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:32:25,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327645489] [2020-11-28 07:32:25,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:32:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:32:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:32:25,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327645489] [2020-11-28 07:32:25,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473320777] [2020-11-28 07:32:25,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:32:25,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-28 07:32:25,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 07:32:25,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-28 07:32:25,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:32:25,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:32:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:32:25,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:32:25,681 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:32:25,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:25,710 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:32:25,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:25,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:32:26,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1985970373] [2020-11-28 07:32:26,019 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 07:32:26,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-28 07:32:26,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2020-11-28 07:32:26,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946555691] [2020-11-28 07:32:26,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-28 07:32:26,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:32:26,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-28 07:32:26,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2020-11-28 07:32:26,021 INFO L87 Difference]: Start difference. First operand 65 states and 161 transitions. Second operand 25 states. [2020-11-28 07:32:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:32:27,189 INFO L93 Difference]: Finished difference Result 210 states and 515 transitions. [2020-11-28 07:32:27,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-28 07:32:27,189 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 17 [2020-11-28 07:32:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:32:27,190 INFO L225 Difference]: With dead ends: 210 [2020-11-28 07:32:27,191 INFO L226 Difference]: Without dead ends: 129 [2020-11-28 07:32:27,192 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1117, Invalid=2423, Unknown=0, NotChecked=0, Total=3540 [2020-11-28 07:32:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-28 07:32:27,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 64. [2020-11-28 07:32:27,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-28 07:32:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 157 transitions. [2020-11-28 07:32:27,198 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 157 transitions. Word has length 17 [2020-11-28 07:32:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:32:27,199 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 157 transitions. [2020-11-28 07:32:27,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-28 07:32:27,199 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 157 transitions. [2020-11-28 07:32:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-28 07:32:27,200 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:32:27,200 INFO L422 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:32:27,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:32:27,414 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:32:27,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:32:27,415 INFO L82 PathProgramCache]: Analyzing trace with hash -154578414, now seen corresponding path program 9 times [2020-11-28 07:32:27,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:32:27,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404359316] [2020-11-28 07:32:27,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:32:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:32:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:32:27,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404359316] [2020-11-28 07:32:27,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594702355] [2020-11-28 07:32:27,791 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:32:27,860 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-28 07:32:27,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 07:32:27,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-28 07:32:27,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:32:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:32:27,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:32:27,895 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:32:27,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:27,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:27,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:27,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,265 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,329 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,350 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:32:28,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:32:28,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1102582274] [2020-11-28 07:32:28,384 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 07:32:28,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-28 07:32:28,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2020-11-28 07:32:28,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601328783] [2020-11-28 07:32:28,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-11-28 07:32:28,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:32:28,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-11-28 07:32:28,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=1171, Unknown=0, NotChecked=0, Total=1560 [2020-11-28 07:32:28,387 INFO L87 Difference]: Start difference. First operand 64 states and 157 transitions. Second operand 40 states. [2020-11-28 07:32:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:32:29,093 INFO L93 Difference]: Finished difference Result 125 states and 282 transitions. [2020-11-28 07:32:29,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-28 07:32:29,093 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2020-11-28 07:32:29,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:32:29,094 INFO L225 Difference]: With dead ends: 125 [2020-11-28 07:32:29,094 INFO L226 Difference]: Without dead ends: 106 [2020-11-28 07:32:29,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1060, Invalid=2600, Unknown=0, NotChecked=0, Total=3660 [2020-11-28 07:32:29,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-28 07:32:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 86. [2020-11-28 07:32:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-28 07:32:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 204 transitions. [2020-11-28 07:32:29,106 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 204 transitions. Word has length 26 [2020-11-28 07:32:29,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:32:29,106 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 204 transitions. [2020-11-28 07:32:29,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-11-28 07:32:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 204 transitions. [2020-11-28 07:32:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-28 07:32:29,108 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:32:29,108 INFO L422 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:32:29,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-11-28 07:32:29,334 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:32:29,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:32:29,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1558563116, now seen corresponding path program 10 times [2020-11-28 07:32:29,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:32:29,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600592684] [2020-11-28 07:32:29,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:32:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:32:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:32:29,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600592684] [2020-11-28 07:32:29,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627603039] [2020-11-28 07:32:29,604 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:32:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:32:29,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-28 07:32:29,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 07:32:29,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:32:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:32:29,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-28 07:32:29,773 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:32:29,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:29,795 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-28 07:32:29,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:29,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-28 07:32:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 07:32:30,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1912530601] [2020-11-28 07:32:30,322 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:269) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:111) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 07:32:30,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-28 07:32:30,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 39 [2020-11-28 07:32:30,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681478141] [2020-11-28 07:32:30,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-11-28 07:32:30,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:32:30,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-11-28 07:32:30,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1270, Unknown=0, NotChecked=0, Total=1640 [2020-11-28 07:32:30,325 INFO L87 Difference]: Start difference. First operand 86 states and 204 transitions. Second operand 41 states. [2020-11-28 07:32:31,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:32:31,877 INFO L93 Difference]: Finished difference Result 214 states and 517 transitions. [2020-11-28 07:32:31,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-11-28 07:32:31,877 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 26 [2020-11-28 07:32:31,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:32:31,879 INFO L225 Difference]: With dead ends: 214 [2020-11-28 07:32:31,879 INFO L226 Difference]: Without dead ends: 173 [2020-11-28 07:32:31,881 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2088, Invalid=5052, Unknown=0, NotChecked=0, Total=7140 [2020-11-28 07:32:31,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-11-28 07:32:31,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 97. [2020-11-28 07:32:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-28 07:32:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 247 transitions. [2020-11-28 07:32:31,888 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 247 transitions. Word has length 26 [2020-11-28 07:32:31,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:32:31,888 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 247 transitions. [2020-11-28 07:32:31,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-11-28 07:32:31,888 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 247 transitions. [2020-11-28 07:32:31,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-28 07:32:31,891 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:32:31,891 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:32:32,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 07:32:32,106 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:32:32,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:32:32,107 INFO L82 PathProgramCache]: Analyzing trace with hash 130555458, now seen corresponding path program 11 times [2020-11-28 07:32:32,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:32:32,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790539784] [2020-11-28 07:32:32,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:32:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:32:32,140 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:32:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:32:32,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:32:32,217 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-28 07:32:32,217 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 07:32:32,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 07:32:32,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:32:32 BasicIcfg [2020-11-28 07:32:32,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 07:32:32,314 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 07:32:32,315 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 07:32:32,315 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 07:32:32,315 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:32:17" (3/4) ... [2020-11-28 07:32:32,318 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 07:32:32,426 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4ab54406-8070-4510-9b0f-14248a2e6e95/bin/utaipan/witness.graphml [2020-11-28 07:32:32,426 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 07:32:32,428 INFO L168 Benchmark]: Toolchain (without parser) took 16249.57 ms. Allocated memory was 96.5 MB in the beginning and 243.3 MB in the end (delta: 146.8 MB). Free memory was 58.3 MB in the beginning and 100.5 MB in the end (delta: -42.2 MB). Peak memory consumption was 104.6 MB. Max. memory is 16.1 GB. [2020-11-28 07:32:32,428 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 96.5 MB. Free memory is still 76.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 07:32:32,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 588.53 ms. Allocated memory is still 96.5 MB. Free memory was 58.1 MB in the beginning and 54.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-28 07:32:32,429 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.36 ms. Allocated memory is still 96.5 MB. Free memory was 54.0 MB in the beginning and 52.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 07:32:32,430 INFO L168 Benchmark]: Boogie Preprocessor took 59.73 ms. Allocated memory is still 96.5 MB. Free memory was 52.1 MB in the beginning and 51.0 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 07:32:32,431 INFO L168 Benchmark]: RCFGBuilder took 586.92 ms. Allocated memory was 96.5 MB in the beginning and 138.4 MB in the end (delta: 41.9 MB). Free memory was 50.7 MB in the beginning and 110.5 MB in the end (delta: -59.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 16.1 GB. [2020-11-28 07:32:32,432 INFO L168 Benchmark]: TraceAbstraction took 14825.03 ms. Allocated memory was 138.4 MB in the beginning and 243.3 MB in the end (delta: 104.9 MB). Free memory was 110.5 MB in the beginning and 108.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 107.0 MB. Max. memory is 16.1 GB. [2020-11-28 07:32:32,432 INFO L168 Benchmark]: Witness Printer took 112.13 ms. Allocated memory is still 243.3 MB. Free memory was 108.9 MB in the beginning and 100.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 07:32:32,436 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 96.5 MB. Free memory is still 76.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 588.53 ms. Allocated memory is still 96.5 MB. Free memory was 58.1 MB in the beginning and 54.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.36 ms. Allocated memory is still 96.5 MB. Free memory was 54.0 MB in the beginning and 52.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 59.73 ms. Allocated memory is still 96.5 MB. Free memory was 52.1 MB in the beginning and 51.0 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 586.92 ms. Allocated memory was 96.5 MB in the beginning and 138.4 MB in the end (delta: 41.9 MB). Free memory was 50.7 MB in the beginning and 110.5 MB in the end (delta: -59.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14825.03 ms. Allocated memory was 138.4 MB in the beginning and 243.3 MB in the end (delta: 104.9 MB). Free memory was 110.5 MB in the beginning and 108.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 107.0 MB. Max. memory is 16.1 GB. * Witness Printer took 112.13 ms. Allocated memory is still 243.3 MB. Free memory was 108.9 MB in the beginning and 100.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 751 VarBasedMoverChecksPositive, 13 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 13 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 10 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.5s, 65 PlacesBefore, 20 PlacesAfterwards, 64 TransitionsBefore, 16 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 5 FixpointIterations, 16 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 60 TotalNumberOfCompositions, 1062 MoverChecksTotal - CounterExampleResult [Line: 693]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=3, j=6] [L716] 0 int condI = i >= (2*10 +6); VAL [arg={0:0}, arg={0:0}, i=3, j=6] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=1] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=2, k=1] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=3, k=2] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=4, k=3] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=9, k=8] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 10 [L698] 1 i = j + 1 [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L704] COND TRUE 2 k < 10 [L706] 2 j = i + 1 [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L719] 0 int condJ = j >= (2*10 +6); [L721] COND TRUE 0 condI || condJ [L693] COND FALSE 0 !(0) [L693] 0 __assert_fail ("0", "triangular-longer-2.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.6s, OverallIterations: 13, TraceHistogramMax: 10, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 176 SDtfs, 918 SDslu, 656 SDs, 0 SdLazy, 764 SolverSat, 644 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 126 SyntacticMatches, 6 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4824 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 286 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 28790 SizeOfPredicates, 56 NumberOfNonLiveVariables, 768 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 12/531 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...