./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe027_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1ce96c8e-4e37-4d2e-8630-a1469b65d620/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1ce96c8e-4e37-4d2e-8630-a1469b65d620/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1ce96c8e-4e37-4d2e-8630-a1469b65d620/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1ce96c8e-4e37-4d2e-8630-a1469b65d620/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1ce96c8e-4e37-4d2e-8630-a1469b65d620/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1ce96c8e-4e37-4d2e-8630-a1469b65d620/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e526d74601a089e7b16096a17c73a44c48d37c41 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:57:49,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:57:49,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:57:49,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:57:49,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:57:49,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:57:49,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:57:49,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:57:49,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:57:49,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:57:49,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:57:49,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:57:49,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:57:49,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:57:49,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:57:49,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:57:49,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:57:49,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:57:49,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:57:49,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:57:49,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:57:50,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:57:50,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:57:50,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:57:50,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:57:50,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:57:50,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:57:50,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:57:50,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:57:50,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:57:50,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:57:50,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:57:50,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:57:50,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:57:50,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:57:50,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:57:50,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:57:50,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:57:50,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:57:50,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:57:50,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:57:50,009 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1ce96c8e-4e37-4d2e-8630-a1469b65d620/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:57:50,018 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:57:50,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:57:50,019 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:57:50,019 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:57:50,019 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:57:50,020 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:57:50,020 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:57:50,020 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:57:50,020 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:57:50,020 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:57:50,020 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:57:50,020 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:57:50,020 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:57:50,020 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:57:50,020 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:57:50,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:57:50,021 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:57:50,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:57:50,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:57:50,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:57:50,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:57:50,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:57:50,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:57:50,022 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:57:50,022 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:57:50,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:57:50,022 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:57:50,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:57:50,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:57:50,023 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:57:50,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:57:50,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:57:50,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:57:50,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:57:50,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:57:50,023 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:57:50,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:57:50,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:57:50,024 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:57:50,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:57:50,024 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_1ce96c8e-4e37-4d2e-8630-a1469b65d620/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e526d74601a089e7b16096a17c73a44c48d37c41 [2019-12-07 14:57:50,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:57:50,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:57:50,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:57:50,135 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:57:50,135 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:57:50,136 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1ce96c8e-4e37-4d2e-8630-a1469b65d620/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe027_tso.oepc.i [2019-12-07 14:57:50,175 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ce96c8e-4e37-4d2e-8630-a1469b65d620/bin/utaipan/data/1ffba4957/1aafffc0745d40b5b22b8103f38bb78e/FLAGe889da562 [2019-12-07 14:57:50,646 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:57:50,647 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1ce96c8e-4e37-4d2e-8630-a1469b65d620/sv-benchmarks/c/pthread-wmm/safe027_tso.oepc.i [2019-12-07 14:57:50,659 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ce96c8e-4e37-4d2e-8630-a1469b65d620/bin/utaipan/data/1ffba4957/1aafffc0745d40b5b22b8103f38bb78e/FLAGe889da562 [2019-12-07 14:57:50,971 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1ce96c8e-4e37-4d2e-8630-a1469b65d620/bin/utaipan/data/1ffba4957/1aafffc0745d40b5b22b8103f38bb78e [2019-12-07 14:57:50,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:57:50,980 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:57:50,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:57:50,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:57:50,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:57:50,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:57:50" (1/1) ... [2019-12-07 14:57:50,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8b58c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:50, skipping insertion in model container [2019-12-07 14:57:50,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:57:50" (1/1) ... [2019-12-07 14:57:50,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:57:51,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:57:51,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:57:51,269 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:57:51,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:57:51,347 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:57:51,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:51 WrapperNode [2019-12-07 14:57:51,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:57:51,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:57:51,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:57:51,348 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:57:51,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:51" (1/1) ... [2019-12-07 14:57:51,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:51" (1/1) ... [2019-12-07 14:57:51,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:57:51,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:57:51,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:57:51,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:57:51,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:51" (1/1) ... [2019-12-07 14:57:51,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:51" (1/1) ... [2019-12-07 14:57:51,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:51" (1/1) ... [2019-12-07 14:57:51,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:51" (1/1) ... [2019-12-07 14:57:51,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:51" (1/1) ... [2019-12-07 14:57:51,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:51" (1/1) ... [2019-12-07 14:57:51,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:51" (1/1) ... [2019-12-07 14:57:51,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:57:51,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:57:51,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:57:51,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:57:51,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ce96c8e-4e37-4d2e-8630-a1469b65d620/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:57:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:57:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:57:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:57:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:57:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:57:51,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:57:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:57:51,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:57:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:57:51,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:57:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 14:57:51,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 14:57:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:57:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:57:51,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:57:51,451 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 14:57:51,642 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:57:51,642 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 14:57:51,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:57:51 BoogieIcfgContainer [2019-12-07 14:57:51,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:57:51,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:57:51,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:57:51,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:57:51,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:57:50" (1/3) ... [2019-12-07 14:57:51,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0b6ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:57:51, skipping insertion in model container [2019-12-07 14:57:51,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:57:51" (2/3) ... [2019-12-07 14:57:51,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0b6ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:57:51, skipping insertion in model container [2019-12-07 14:57:51,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:57:51" (3/3) ... [2019-12-07 14:57:51,648 INFO L109 eAbstractionObserver]: Analyzing ICFG safe027_tso.oepc.i [2019-12-07 14:57:51,654 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:57:51,654 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:57:51,659 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:57:51,659 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:57:51,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,679 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,679 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,680 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,680 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,681 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,681 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,681 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,681 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,682 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,682 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,682 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,682 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:57:51,697 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 14:57:51,709 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:57:51,709 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:57:51,709 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:57:51,709 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:57:51,710 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:57:51,710 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:57:51,710 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:57:51,710 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:57:51,718 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 65 transitions [2019-12-07 14:57:51,719 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 77 places, 65 transitions [2019-12-07 14:57:51,746 INFO L134 PetriNetUnfolder]: 1/61 cut-off events. [2019-12-07 14:57:51,746 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:57:51,750 INFO L76 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 61 events. 1/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs. 12/71 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2019-12-07 14:57:51,752 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 77 places, 65 transitions [2019-12-07 14:57:51,764 INFO L134 PetriNetUnfolder]: 1/61 cut-off events. [2019-12-07 14:57:51,764 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:57:51,765 INFO L76 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 61 events. 1/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs. 12/71 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2019-12-07 14:57:51,766 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 732 [2019-12-07 14:57:51,766 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:57:52,644 INFO L206 etLargeBlockEncoding]: Checked pairs total: 687 [2019-12-07 14:57:52,644 INFO L214 etLargeBlockEncoding]: Total number of compositions: 54 [2019-12-07 14:57:52,647 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 21 transitions [2019-12-07 14:57:52,660 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110 states. [2019-12-07 14:57:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-12-07 14:57:52,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 14:57:52,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:52,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:57:52,669 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:52,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:52,673 INFO L82 PathProgramCache]: Analyzing trace with hash -162708018, now seen corresponding path program 1 times [2019-12-07 14:57:52,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:52,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877869626] [2019-12-07 14:57:52,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:52,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877869626] [2019-12-07 14:57:52,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:52,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:57:52,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999923699] [2019-12-07 14:57:52,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:57:52,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:52,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:57:52,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:57:52,908 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 4 states. [2019-12-07 14:57:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:52,957 INFO L93 Difference]: Finished difference Result 122 states and 301 transitions. [2019-12-07 14:57:52,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:57:52,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 14:57:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:52,966 INFO L225 Difference]: With dead ends: 122 [2019-12-07 14:57:52,966 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 14:57:52,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:57:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 14:57:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-12-07 14:57:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 14:57:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 182 transitions. [2019-12-07 14:57:52,995 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 182 transitions. Word has length 10 [2019-12-07 14:57:52,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:52,996 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 182 transitions. [2019-12-07 14:57:52,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:57:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 182 transitions. [2019-12-07 14:57:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:57:52,997 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:52,997 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:57:52,998 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:52,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1102272548, now seen corresponding path program 1 times [2019-12-07 14:57:52,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:52,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252052628] [2019-12-07 14:57:52,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:53,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252052628] [2019-12-07 14:57:53,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:53,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:57:53,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459013224] [2019-12-07 14:57:53,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:57:53,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:53,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:57:53,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:57:53,064 INFO L87 Difference]: Start difference. First operand 76 states and 182 transitions. Second operand 5 states. [2019-12-07 14:57:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:53,102 INFO L93 Difference]: Finished difference Result 83 states and 182 transitions. [2019-12-07 14:57:53,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:57:53,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 14:57:53,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:53,104 INFO L225 Difference]: With dead ends: 83 [2019-12-07 14:57:53,104 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 14:57:53,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:57:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 14:57:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-12-07 14:57:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 14:57:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 150 transitions. [2019-12-07 14:57:53,112 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 150 transitions. Word has length 11 [2019-12-07 14:57:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:53,113 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 150 transitions. [2019-12-07 14:57:53,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:57:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 150 transitions. [2019-12-07 14:57:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 14:57:53,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:53,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:57:53,114 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:53,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash -11530752, now seen corresponding path program 1 times [2019-12-07 14:57:53,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:53,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249868414] [2019-12-07 14:57:53,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:53,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249868414] [2019-12-07 14:57:53,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:53,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:57:53,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512204505] [2019-12-07 14:57:53,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:57:53,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:53,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:57:53,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:57:53,191 INFO L87 Difference]: Start difference. First operand 68 states and 150 transitions. Second operand 6 states. [2019-12-07 14:57:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:53,245 INFO L93 Difference]: Finished difference Result 67 states and 136 transitions. [2019-12-07 14:57:53,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:57:53,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-12-07 14:57:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:53,246 INFO L225 Difference]: With dead ends: 67 [2019-12-07 14:57:53,246 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 14:57:53,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:57:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 14:57:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-07 14:57:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 14:57:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 114 transitions. [2019-12-07 14:57:53,250 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 114 transitions. Word has length 12 [2019-12-07 14:57:53,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:53,251 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 114 transitions. [2019-12-07 14:57:53,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:57:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2019-12-07 14:57:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:57:53,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:53,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:57:53,252 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:53,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:53,252 INFO L82 PathProgramCache]: Analyzing trace with hash -349293673, now seen corresponding path program 1 times [2019-12-07 14:57:53,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:53,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786946620] [2019-12-07 14:57:53,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:53,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786946620] [2019-12-07 14:57:53,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:53,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:57:53,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690861514] [2019-12-07 14:57:53,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:57:53,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:53,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:57:53,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:57:53,308 INFO L87 Difference]: Start difference. First operand 56 states and 114 transitions. Second operand 7 states. [2019-12-07 14:57:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:53,372 INFO L93 Difference]: Finished difference Result 53 states and 106 transitions. [2019-12-07 14:57:53,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:57:53,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-12-07 14:57:53,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:53,373 INFO L225 Difference]: With dead ends: 53 [2019-12-07 14:57:53,373 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 14:57:53,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:57:53,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 14:57:53,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-07 14:57:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 14:57:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2019-12-07 14:57:53,377 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 13 [2019-12-07 14:57:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:53,377 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2019-12-07 14:57:53,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:57:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2019-12-07 14:57:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:57:53,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:53,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:57:53,378 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:53,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:53,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2056881420, now seen corresponding path program 1 times [2019-12-07 14:57:53,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:53,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014891771] [2019-12-07 14:57:53,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:53,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014891771] [2019-12-07 14:57:53,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:53,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:57:53,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793543557] [2019-12-07 14:57:53,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:57:53,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:53,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:57:53,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:57:53,432 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 5 states. [2019-12-07 14:57:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:53,446 INFO L93 Difference]: Finished difference Result 53 states and 103 transitions. [2019-12-07 14:57:53,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:57:53,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 14:57:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:53,446 INFO L225 Difference]: With dead ends: 53 [2019-12-07 14:57:53,446 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 14:57:53,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:57:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 14:57:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-07 14:57:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 14:57:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 48 transitions. [2019-12-07 14:57:53,449 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 48 transitions. Word has length 14 [2019-12-07 14:57:53,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:53,449 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 48 transitions. [2019-12-07 14:57:53,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:57:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 48 transitions. [2019-12-07 14:57:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:57:53,449 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:53,449 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:57:53,450 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:53,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:53,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1378905044, now seen corresponding path program 2 times [2019-12-07 14:57:53,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:53,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867240818] [2019-12-07 14:57:53,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:53,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867240818] [2019-12-07 14:57:53,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:53,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:57:53,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401144463] [2019-12-07 14:57:53,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:57:53,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:53,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:57:53,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:57:53,503 INFO L87 Difference]: Start difference. First operand 30 states and 48 transitions. Second operand 4 states. [2019-12-07 14:57:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:53,521 INFO L93 Difference]: Finished difference Result 33 states and 50 transitions. [2019-12-07 14:57:53,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:57:53,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:57:53,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:53,522 INFO L225 Difference]: With dead ends: 33 [2019-12-07 14:57:53,522 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 14:57:53,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:57:53,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 14:57:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-12-07 14:57:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 14:57:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-12-07 14:57:53,524 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 14 [2019-12-07 14:57:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:53,525 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-12-07 14:57:53,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:57:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2019-12-07 14:57:53,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:57:53,525 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:53,525 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:57:53,525 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:53,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:53,526 INFO L82 PathProgramCache]: Analyzing trace with hash -549919962, now seen corresponding path program 3 times [2019-12-07 14:57:53,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:53,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954577569] [2019-12-07 14:57:53,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:53,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954577569] [2019-12-07 14:57:53,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:53,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:57:53,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156719437] [2019-12-07 14:57:53,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:57:53,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:53,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:57:53,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:57:53,569 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 5 states. [2019-12-07 14:57:53,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:53,596 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-12-07 14:57:53,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:57:53,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 14:57:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:53,597 INFO L225 Difference]: With dead ends: 29 [2019-12-07 14:57:53,597 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 14:57:53,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:57:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 14:57:53,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 14:57:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 14:57:53,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-12-07 14:57:53,599 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2019-12-07 14:57:53,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:53,599 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-12-07 14:57:53,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:57:53,599 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-12-07 14:57:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:57:53,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:53,599 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:57:53,599 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:53,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:53,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2103109014, now seen corresponding path program 4 times [2019-12-07 14:57:53,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:53,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146278352] [2019-12-07 14:57:53,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:53,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146278352] [2019-12-07 14:57:53,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:53,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:57:53,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038694815] [2019-12-07 14:57:53,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:57:53,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:53,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:57:53,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:57:53,642 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 5 states. [2019-12-07 14:57:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:53,656 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-12-07 14:57:53,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:57:53,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 14:57:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:53,657 INFO L225 Difference]: With dead ends: 22 [2019-12-07 14:57:53,657 INFO L226 Difference]: Without dead ends: 15 [2019-12-07 14:57:53,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:57:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-12-07 14:57:53,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-12-07 14:57:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 14:57:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2019-12-07 14:57:53,659 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 14 [2019-12-07 14:57:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:53,659 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2019-12-07 14:57:53,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:57:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2019-12-07 14:57:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:57:53,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:53,660 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:57:53,660 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:53,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:53,661 INFO L82 PathProgramCache]: Analyzing trace with hash 2031929270, now seen corresponding path program 5 times [2019-12-07 14:57:53,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:57:53,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884912906] [2019-12-07 14:57:53,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:57:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:53,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:53,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884912906] [2019-12-07 14:57:53,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:53,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:57:53,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919625830] [2019-12-07 14:57:53,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:57:53,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:57:53,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:57:53,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:57:53,704 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand 4 states. [2019-12-07 14:57:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:53,718 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2019-12-07 14:57:53,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:57:53,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:57:53,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:53,719 INFO L225 Difference]: With dead ends: 14 [2019-12-07 14:57:53,719 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 14:57:53,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:57:53,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 14:57:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 14:57:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 14:57:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 14:57:53,720 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2019-12-07 14:57:53,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:53,720 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:57:53,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:57:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:57:53,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 14:57:53,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:57:53 BasicIcfg [2019-12-07 14:57:53,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:57:53,724 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:57:53,724 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:57:53,724 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:57:53,725 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:57:51" (3/4) ... [2019-12-07 14:57:53,728 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 14:57:53,734 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-12-07 14:57:53,734 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-12-07 14:57:53,734 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-12-07 14:57:53,735 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P3 [2019-12-07 14:57:53,739 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-12-07 14:57:53,739 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 14:57:53,739 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 14:57:53,775 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1ce96c8e-4e37-4d2e-8630-a1469b65d620/bin/utaipan/witness.graphml [2019-12-07 14:57:53,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:57:53,778 INFO L168 Benchmark]: Toolchain (without parser) took 2798.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 934.0 MB in the beginning and 922.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 105.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:57:53,778 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:57:53,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -131.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:57:53,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.10 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:57:53,779 INFO L168 Benchmark]: Boogie Preprocessor took 18.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:57:53,780 INFO L168 Benchmark]: RCFGBuilder took 245.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:57:53,780 INFO L168 Benchmark]: TraceAbstraction took 2080.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 929.0 MB in the end (delta: 109.4 MB). Peak memory consumption was 109.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:57:53,780 INFO L168 Benchmark]: Witness Printer took 51.56 ms. Allocated memory is still 1.1 GB. Free memory was 929.0 MB in the beginning and 922.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:57:53,782 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 366.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -131.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.10 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 245.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2080.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 929.0 MB in the end (delta: 109.4 MB). Peak memory consumption was 109.4 MB. Max. memory is 11.5 GB. * Witness Printer took 51.56 ms. Allocated memory is still 1.1 GB. Free memory was 929.0 MB in the beginning and 922.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.9s, 77 ProgramPointsBefore, 28 ProgramPointsAfterwards, 65 TransitionsBefore, 21 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 6 FixpointIterations, 15 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 362 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 14 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 687 CheckedPairsTotal, 54 TotalNumberOfCompositions - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 65 locations, 1 error locations. Result: SAFE, OverallTime: 2.0s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 111 SDtfs, 197 SDslu, 129 SDs, 0 SdLazy, 121 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 6341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...