./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_9.c --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_6799d476-8caa-4b21-bbf3-5820ab7cb5cd/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6799d476-8caa-4b21-bbf3-5820ab7cb5cd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6799d476-8caa-4b21-bbf3-5820ab7cb5cd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6799d476-8caa-4b21-bbf3-5820ab7cb5cd/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6799d476-8caa-4b21-bbf3-5820ab7cb5cd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6799d476-8caa-4b21-bbf3-5820ab7cb5cd/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 5107685577f81a5867811396b2c0a05eb5630c95 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:50:43,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:50:43,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:50:43,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:50:43,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:50:43,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:50:43,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:50:43,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:50:43,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:50:43,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:50:43,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:50:43,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:50:43,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:50:43,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:50:43,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:50:43,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:50:43,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:50:43,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:50:43,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:50:43,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:50:43,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:50:43,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:50:43,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:50:43,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:50:43,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:50:43,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:50:43,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:50:43,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:50:43,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:50:43,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:50:43,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:50:43,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:50:43,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:50:43,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:50:43,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:50:43,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:50:43,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:50:43,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:50:43,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:50:43,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:50:43,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:50:43,428 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6799d476-8caa-4b21-bbf3-5820ab7cb5cd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:50:43,438 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:50:43,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:50:43,439 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:50:43,439 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:50:43,439 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:50:43,439 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:50:43,439 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:50:43,439 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:50:43,439 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:50:43,439 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:50:43,440 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:50:43,440 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:50:43,440 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:50:43,440 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:50:43,440 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:50:43,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:50:43,441 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:50:43,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:50:43,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:50:43,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:50:43,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:50:43,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:50:43,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:50:43,441 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:50:43,442 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:50:43,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:50:43,442 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:50:43,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:50:43,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:50:43,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:50:43,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:50:43,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:50:43,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:50:43,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:50:43,443 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:50:43,443 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:50:43,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:50:43,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:50:43,443 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:50:43,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:50:43,443 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_6799d476-8caa-4b21-bbf3-5820ab7cb5cd/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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2019-12-07 11:50:43,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:50:43,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:50:43,552 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:50:43,553 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:50:43,553 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:50:43,553 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6799d476-8caa-4b21-bbf3-5820ab7cb5cd/bin/utaipan/../../sv-benchmarks/c/locks/test_locks_9.c [2019-12-07 11:50:43,592 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6799d476-8caa-4b21-bbf3-5820ab7cb5cd/bin/utaipan/data/ae3a47faa/1e62c43be6124359952ba3a795d0b720/FLAG4691ee573 [2019-12-07 11:50:43,918 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:50:43,919 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6799d476-8caa-4b21-bbf3-5820ab7cb5cd/sv-benchmarks/c/locks/test_locks_9.c [2019-12-07 11:50:43,924 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6799d476-8caa-4b21-bbf3-5820ab7cb5cd/bin/utaipan/data/ae3a47faa/1e62c43be6124359952ba3a795d0b720/FLAG4691ee573 [2019-12-07 11:50:43,932 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6799d476-8caa-4b21-bbf3-5820ab7cb5cd/bin/utaipan/data/ae3a47faa/1e62c43be6124359952ba3a795d0b720 [2019-12-07 11:50:43,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:50:43,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:50:43,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:50:43,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:50:43,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:50:43,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:50:43" (1/1) ... [2019-12-07 11:50:43,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6947e074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:50:43, skipping insertion in model container [2019-12-07 11:50:43,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:50:43" (1/1) ... [2019-12-07 11:50:43,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:50:43,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:50:44,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:50:44,115 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:50:44,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:50:44,141 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:50:44,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:50:44 WrapperNode [2019-12-07 11:50:44,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:50:44,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:50:44,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:50:44,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:50:44,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:50:44" (1/1) ... [2019-12-07 11:50:44,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:50:44" (1/1) ... [2019-12-07 11:50:44,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:50:44,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:50:44,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:50:44,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:50:44,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:50:44" (1/1) ... [2019-12-07 11:50:44,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:50:44" (1/1) ... [2019-12-07 11:50:44,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:50:44" (1/1) ... [2019-12-07 11:50:44,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:50:44" (1/1) ... [2019-12-07 11:50:44,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:50:44" (1/1) ... [2019-12-07 11:50:44,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:50:44" (1/1) ... [2019-12-07 11:50:44,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:50:44" (1/1) ... [2019-12-07 11:50:44,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:50:44,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:50:44,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:50:44,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:50:44,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:50:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6799d476-8caa-4b21-bbf3-5820ab7cb5cd/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:50:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:50:44,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:50:44,505 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:50:44,505 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 11:50:44,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:50:44 BoogieIcfgContainer [2019-12-07 11:50:44,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:50:44,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:50:44,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:50:44,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:50:44,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:50:43" (1/3) ... [2019-12-07 11:50:44,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bba98d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:50:44, skipping insertion in model container [2019-12-07 11:50:44,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:50:44" (2/3) ... [2019-12-07 11:50:44,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bba98d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:50:44, skipping insertion in model container [2019-12-07 11:50:44,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:50:44" (3/3) ... [2019-12-07 11:50:44,512 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-12-07 11:50:44,518 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:50:44,523 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:50:44,531 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:50:44,545 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:50:44,545 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:50:44,546 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:50:44,546 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:50:44,546 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:50:44,546 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:50:44,546 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:50:44,546 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:50:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-12-07 11:50:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 11:50:44,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:50:44,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 11:50:44,559 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:50:44,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:50:44,563 INFO L82 PathProgramCache]: Analyzing trace with hash 931338351, now seen corresponding path program 1 times [2019-12-07 11:50:44,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:50:44,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809911856] [2019-12-07 11:50:44,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:50:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:50:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:50:44,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809911856] [2019-12-07 11:50:44,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:50:44,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:50:44,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141887933] [2019-12-07 11:50:44,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:50:44,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:50:44,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:50:44,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:44,706 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 4 states. [2019-12-07 11:50:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:50:44,742 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2019-12-07 11:50:44,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:50:44,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 11:50:44,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:50:44,750 INFO L225 Difference]: With dead ends: 54 [2019-12-07 11:50:44,750 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 11:50:44,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 11:50:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 23. [2019-12-07 11:50:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 11:50:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 39 transitions. [2019-12-07 11:50:44,776 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 39 transitions. Word has length 6 [2019-12-07 11:50:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:50:44,776 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 39 transitions. [2019-12-07 11:50:44,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:50:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 39 transitions. [2019-12-07 11:50:44,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:50:44,777 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:50:44,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:50:44,777 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:50:44,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:50:44,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1193068520, now seen corresponding path program 1 times [2019-12-07 11:50:44,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:50:44,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757043173] [2019-12-07 11:50:44,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:50:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:50:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:50:44,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757043173] [2019-12-07 11:50:44,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:50:44,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:50:44,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692472564] [2019-12-07 11:50:44,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:50:44,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:50:44,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:50:44,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:44,814 INFO L87 Difference]: Start difference. First operand 23 states and 39 transitions. Second operand 4 states. [2019-12-07 11:50:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:50:44,828 INFO L93 Difference]: Finished difference Result 43 states and 71 transitions. [2019-12-07 11:50:44,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:50:44,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 11:50:44,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:50:44,829 INFO L225 Difference]: With dead ends: 43 [2019-12-07 11:50:44,830 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 11:50:44,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 11:50:44,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 23. [2019-12-07 11:50:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 11:50:44,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2019-12-07 11:50:44,834 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 7 [2019-12-07 11:50:44,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:50:44,834 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. [2019-12-07 11:50:44,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:50:44,834 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2019-12-07 11:50:44,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 11:50:44,834 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:50:44,834 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:50:44,835 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:50:44,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:50:44,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1669795556, now seen corresponding path program 1 times [2019-12-07 11:50:44,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:50:44,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859304061] [2019-12-07 11:50:44,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:50:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:50:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:50:44,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859304061] [2019-12-07 11:50:44,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:50:44,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:50:44,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994875394] [2019-12-07 11:50:44,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:50:44,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:50:44,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:50:44,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:44,867 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 4 states. [2019-12-07 11:50:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:50:44,883 INFO L93 Difference]: Finished difference Result 41 states and 66 transitions. [2019-12-07 11:50:44,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:50:44,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 11:50:44,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:50:44,884 INFO L225 Difference]: With dead ends: 41 [2019-12-07 11:50:44,884 INFO L226 Difference]: Without dead ends: 39 [2019-12-07 11:50:44,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-07 11:50:44,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 23. [2019-12-07 11:50:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 11:50:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2019-12-07 11:50:44,888 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 37 transitions. Word has length 8 [2019-12-07 11:50:44,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:50:44,889 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 37 transitions. [2019-12-07 11:50:44,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:50:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 37 transitions. [2019-12-07 11:50:44,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:50:44,889 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:50:44,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:50:44,890 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:50:44,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:50:44,890 INFO L82 PathProgramCache]: Analyzing trace with hash 224269037, now seen corresponding path program 1 times [2019-12-07 11:50:44,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:50:44,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585534947] [2019-12-07 11:50:44,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:50:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:50:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:50:44,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585534947] [2019-12-07 11:50:44,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:50:44,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:50:44,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951626097] [2019-12-07 11:50:44,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:50:44,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:50:44,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:50:44,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:44,923 INFO L87 Difference]: Start difference. First operand 23 states and 37 transitions. Second operand 4 states. [2019-12-07 11:50:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:50:44,937 INFO L93 Difference]: Finished difference Result 39 states and 61 transitions. [2019-12-07 11:50:44,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:50:44,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 11:50:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:50:44,938 INFO L225 Difference]: With dead ends: 39 [2019-12-07 11:50:44,938 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 11:50:44,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 11:50:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 23. [2019-12-07 11:50:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 11:50:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2019-12-07 11:50:44,942 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 36 transitions. Word has length 9 [2019-12-07 11:50:44,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:50:44,942 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 36 transitions. [2019-12-07 11:50:44,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:50:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 36 transitions. [2019-12-07 11:50:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:50:44,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:50:44,943 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:50:44,943 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:50:44,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:50:44,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1637379751, now seen corresponding path program 1 times [2019-12-07 11:50:44,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:50:44,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640732521] [2019-12-07 11:50:44,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:50:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:50:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:50:44,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640732521] [2019-12-07 11:50:44,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:50:44,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:50:44,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775968136] [2019-12-07 11:50:44,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:50:44,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:50:44,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:50:44,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:44,976 INFO L87 Difference]: Start difference. First operand 23 states and 36 transitions. Second operand 4 states. [2019-12-07 11:50:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:50:44,988 INFO L93 Difference]: Finished difference Result 37 states and 56 transitions. [2019-12-07 11:50:44,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:50:44,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 11:50:44,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:50:44,989 INFO L225 Difference]: With dead ends: 37 [2019-12-07 11:50:44,989 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 11:50:44,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:44,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 11:50:44,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2019-12-07 11:50:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 11:50:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2019-12-07 11:50:44,992 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 35 transitions. Word has length 10 [2019-12-07 11:50:44,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:50:44,992 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-12-07 11:50:44,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:50:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 35 transitions. [2019-12-07 11:50:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:50:44,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:50:44,993 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:50:44,993 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:50:44,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:50:44,993 INFO L82 PathProgramCache]: Analyzing trace with hash 781050306, now seen corresponding path program 1 times [2019-12-07 11:50:44,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:50:44,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685408559] [2019-12-07 11:50:44,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:50:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:50:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:50:45,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685408559] [2019-12-07 11:50:45,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:50:45,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:50:45,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18598490] [2019-12-07 11:50:45,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:50:45,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:50:45,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:50:45,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:45,021 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. Second operand 4 states. [2019-12-07 11:50:45,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:50:45,033 INFO L93 Difference]: Finished difference Result 35 states and 51 transitions. [2019-12-07 11:50:45,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:50:45,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 11:50:45,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:50:45,033 INFO L225 Difference]: With dead ends: 35 [2019-12-07 11:50:45,033 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 11:50:45,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 11:50:45,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2019-12-07 11:50:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 11:50:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2019-12-07 11:50:45,036 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 11 [2019-12-07 11:50:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:50:45,036 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2019-12-07 11:50:45,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:50:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2019-12-07 11:50:45,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:50:45,037 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:50:45,037 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:50:45,037 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:50:45,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:50:45,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1557028914, now seen corresponding path program 1 times [2019-12-07 11:50:45,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:50:45,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689156589] [2019-12-07 11:50:45,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:50:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:50:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:50:45,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689156589] [2019-12-07 11:50:45,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:50:45,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:50:45,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399225122] [2019-12-07 11:50:45,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:50:45,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:50:45,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:50:45,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:45,062 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand 4 states. [2019-12-07 11:50:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:50:45,073 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2019-12-07 11:50:45,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:50:45,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 11:50:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:50:45,074 INFO L225 Difference]: With dead ends: 33 [2019-12-07 11:50:45,074 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 11:50:45,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 11:50:45,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-12-07 11:50:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 11:50:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2019-12-07 11:50:45,078 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 12 [2019-12-07 11:50:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:50:45,078 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-12-07 11:50:45,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:50:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2019-12-07 11:50:45,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:50:45,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:50:45,079 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:50:45,079 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:50:45,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:50:45,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1023040361, now seen corresponding path program 1 times [2019-12-07 11:50:45,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:50:45,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365272868] [2019-12-07 11:50:45,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:50:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:50:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:50:45,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365272868] [2019-12-07 11:50:45,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:50:45,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:50:45,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486517653] [2019-12-07 11:50:45,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:50:45,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:50:45,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:50:45,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:45,108 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand 4 states. [2019-12-07 11:50:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:50:45,120 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2019-12-07 11:50:45,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:50:45,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:50:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:50:45,121 INFO L225 Difference]: With dead ends: 31 [2019-12-07 11:50:45,121 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 11:50:45,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 11:50:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-12-07 11:50:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 11:50:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2019-12-07 11:50:45,123 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 32 transitions. Word has length 13 [2019-12-07 11:50:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:50:45,123 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-12-07 11:50:45,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:50:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2019-12-07 11:50:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:50:45,124 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:50:45,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:50:45,124 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:50:45,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:50:45,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1649264061, now seen corresponding path program 1 times [2019-12-07 11:50:45,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:50:45,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085545034] [2019-12-07 11:50:45,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:50:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:50:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:50:45,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085545034] [2019-12-07 11:50:45,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:50:45,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:50:45,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660664121] [2019-12-07 11:50:45,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:50:45,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:50:45,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:50:45,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:45,145 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. Second operand 4 states. [2019-12-07 11:50:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:50:45,154 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2019-12-07 11:50:45,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:50:45,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 11:50:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:50:45,155 INFO L225 Difference]: With dead ends: 25 [2019-12-07 11:50:45,155 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:50:45,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:50:45,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:50:45,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:50:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:50:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:50:45,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2019-12-07 11:50:45,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:50:45,156 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:50:45,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:50:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:50:45,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:50:45,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:50:45,166 INFO L246 CegarLoopResult]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 11:50:45,166 INFO L246 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2019-12-07 11:50:45,166 INFO L246 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2019-12-07 11:50:45,166 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:50:45,166 INFO L246 CegarLoopResult]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 11:50:45,166 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-12-07 11:50:45,166 INFO L249 CegarLoopResult]: At program point L145(lines 5 149) the Hoare annotation is: true [2019-12-07 11:50:45,166 INFO L246 CegarLoopResult]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 11:50:45,166 INFO L246 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-12-07 11:50:45,166 INFO L246 CegarLoopResult]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 11:50:45,166 INFO L246 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2019-12-07 11:50:45,166 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 11:50:45,167 INFO L246 CegarLoopResult]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 11:50:45,167 INFO L249 CegarLoopResult]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2019-12-07 11:50:45,167 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-12-07 11:50:45,167 INFO L249 CegarLoopResult]: At program point L148(lines 4 149) the Hoare annotation is: true [2019-12-07 11:50:45,167 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 11:50:45,167 INFO L246 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2019-12-07 11:50:45,167 INFO L242 CegarLoopResult]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2019-12-07 11:50:45,167 INFO L246 CegarLoopResult]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 11:50:45,167 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:50:45,167 INFO L246 CegarLoopResult]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 11:50:45,167 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 11:50:45,167 INFO L246 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2019-12-07 11:50:45,167 INFO L246 CegarLoopResult]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 11:50:45,167 INFO L246 CegarLoopResult]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2019-12-07 11:50:45,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:50:45 BoogieIcfgContainer [2019-12-07 11:50:45,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:50:45,174 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:50:45,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:50:45,174 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:50:45,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:50:44" (3/4) ... [2019-12-07 11:50:45,177 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:50:45,184 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-12-07 11:50:45,184 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 11:50:45,184 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 11:50:45,229 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6799d476-8caa-4b21-bbf3-5820ab7cb5cd/bin/utaipan/witness.graphml [2019-12-07 11:50:45,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:50:45,231 INFO L168 Benchmark]: Toolchain (without parser) took 1295.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 942.6 MB in the beginning and 963.5 MB in the end (delta: -20.9 MB). Peak memory consumption was 80.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:50:45,231 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:50:45,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:50:45,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:50:45,232 INFO L168 Benchmark]: Boogie Preprocessor took 16.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:50:45,232 INFO L168 Benchmark]: RCFGBuilder took 318.67 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: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:50:45,233 INFO L168 Benchmark]: TraceAbstraction took 667.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 963.5 MB in the end (delta: 93.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:50:45,233 INFO L168 Benchmark]: Witness Printer took 54.94 ms. Allocated memory is still 1.1 GB. Free memory is still 963.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:50:45,235 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 206.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.58 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 16.67 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 318.67 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: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 667.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 963.5 MB in the end (delta: 93.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 11.5 GB. * Witness Printer took 54.94 ms. Allocated memory is still 1.1 GB. Free memory is still 963.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. Result: SAFE, OverallTime: 0.6s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 302 SDtfs, 254 SDslu, 440 SDs, 0 SdLazy, 83 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred 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, 104 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 9 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 3741 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...