java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:28:47,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:28:47,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:28:47,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:28:47,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:28:47,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:28:47,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:28:47,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:28:47,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:28:47,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:28:47,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:28:47,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:28:47,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:28:47,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:28:47,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:28:47,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:28:48,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:28:48,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:28:48,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:28:48,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:28:48,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:28:48,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:28:48,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:28:48,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:28:48,019 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:28:48,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:28:48,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:28:48,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:28:48,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:28:48,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:28:48,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:28:48,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:28:48,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:28:48,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:28:48,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:28:48,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:28:48,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:28:48,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:28:48,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:28:48,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:28:48,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:28:48,039 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:28:48,060 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:28:48,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:28:48,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:28:48,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:28:48,063 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:28:48,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:28:48,064 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:28:48,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:28:48,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:28:48,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:28:48,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:28:48,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:28:48,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:28:48,066 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:28:48,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:28:48,067 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:28:48,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:28:48,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:28:48,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:28:48,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:28:48,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:28:48,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:28:48,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:28:48,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:28:48,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:28:48,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:28:48,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:28:48,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:28:48,070 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:28:48,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:28:48,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:28:48,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:28:48,382 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:28:48,382 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:28:48,383 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2019-10-07 13:28:48,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5699f99c/9e3267740f194e2c8cfb009a9a8628ad/FLAG3e7b1c9d8 [2019-10-07 13:28:48,911 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:28:48,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2019-10-07 13:28:48,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5699f99c/9e3267740f194e2c8cfb009a9a8628ad/FLAG3e7b1c9d8 [2019-10-07 13:28:49,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5699f99c/9e3267740f194e2c8cfb009a9a8628ad [2019-10-07 13:28:49,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:28:49,333 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:28:49,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:49,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:28:49,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:28:49,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:49" (1/1) ... [2019-10-07 13:28:49,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a1e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:49, skipping insertion in model container [2019-10-07 13:28:49,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:49" (1/1) ... [2019-10-07 13:28:49,353 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:28:49,379 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:28:49,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:49,630 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:28:49,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:49,671 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:28:49,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:49 WrapperNode [2019-10-07 13:28:49,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:49,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:28:49,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:28:49,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:28:49,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:49" (1/1) ... [2019-10-07 13:28:49,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:49" (1/1) ... [2019-10-07 13:28:49,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:49" (1/1) ... [2019-10-07 13:28:49,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:49" (1/1) ... [2019-10-07 13:28:49,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:49" (1/1) ... [2019-10-07 13:28:49,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:49" (1/1) ... [2019-10-07 13:28:49,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:49" (1/1) ... [2019-10-07 13:28:49,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:28:49,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:28:49,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:28:49,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:28:49,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-07 13:28:49,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:28:49,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:28:49,850 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:28:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:28:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:28:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:28:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:28:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:28:50,290 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:28:50,291 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:28:50,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:50 BoogieIcfgContainer [2019-10-07 13:28:50,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:28:50,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:28:50,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:28:50,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:28:50,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:28:49" (1/3) ... [2019-10-07 13:28:50,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13aacb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:50, skipping insertion in model container [2019-10-07 13:28:50,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:49" (2/3) ... [2019-10-07 13:28:50,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13aacb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:50, skipping insertion in model container [2019-10-07 13:28:50,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:50" (3/3) ... [2019-10-07 13:28:50,303 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-10-07 13:28:50,313 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:28:50,321 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:28:50,333 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:28:50,358 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:28:50,358 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:28:50,358 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:28:50,359 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:28:50,359 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:28:50,359 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:28:50,359 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:28:50,360 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:28:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-10-07 13:28:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:28:50,381 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:50,382 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:50,384 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:50,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:50,389 INFO L82 PathProgramCache]: Analyzing trace with hash -154441610, now seen corresponding path program 1 times [2019-10-07 13:28:50,396 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:50,397 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,397 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,397 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:50,567 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,568 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:50,569 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:50,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:50,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:50,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:50,587 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 4 states. [2019-10-07 13:28:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:50,665 INFO L93 Difference]: Finished difference Result 50 states and 74 transitions. [2019-10-07 13:28:50,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:50,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 13:28:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:50,679 INFO L225 Difference]: With dead ends: 50 [2019-10-07 13:28:50,679 INFO L226 Difference]: Without dead ends: 35 [2019-10-07 13:28:50,683 INFO L606 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-10-07 13:28:50,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-07 13:28:50,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2019-10-07 13:28:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 13:28:50,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-10-07 13:28:50,721 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2019-10-07 13:28:50,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:50,722 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-10-07 13:28:50,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-10-07 13:28:50,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:28:50,723 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:50,723 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:50,723 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:50,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:50,724 INFO L82 PathProgramCache]: Analyzing trace with hash -492507938, now seen corresponding path program 1 times [2019-10-07 13:28:50,724 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:50,724 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,724 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,725 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:50,786 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,786 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:50,787 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:50,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:50,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:50,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:50,790 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 4 states. [2019-10-07 13:28:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:50,815 INFO L93 Difference]: Finished difference Result 35 states and 51 transitions. [2019-10-07 13:28:50,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:50,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 13:28:50,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:50,817 INFO L225 Difference]: With dead ends: 35 [2019-10-07 13:28:50,817 INFO L226 Difference]: Without dead ends: 33 [2019-10-07 13:28:50,818 INFO L606 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-10-07 13:28:50,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-07 13:28:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2019-10-07 13:28:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 13:28:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-10-07 13:28:50,824 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 30 transitions. Word has length 11 [2019-10-07 13:28:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:50,825 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-10-07 13:28:50,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2019-10-07 13:28:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:28:50,826 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:50,826 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:50,827 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:50,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:50,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1912338123, now seen corresponding path program 1 times [2019-10-07 13:28:50,827 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:50,828 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,828 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,828 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:50,906 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,907 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:50,907 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:50,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:50,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:50,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:50,909 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. Second operand 4 states. [2019-10-07 13:28:50,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:50,943 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2019-10-07 13:28:50,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:50,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-07 13:28:50,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:50,945 INFO L225 Difference]: With dead ends: 33 [2019-10-07 13:28:50,946 INFO L226 Difference]: Without dead ends: 31 [2019-10-07 13:28:50,947 INFO L606 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-10-07 13:28:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-07 13:28:50,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2019-10-07 13:28:50,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 13:28:50,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2019-10-07 13:28:50,957 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 12 [2019-10-07 13:28:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:50,957 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-10-07 13:28:50,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2019-10-07 13:28:50,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:28:50,959 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:50,959 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:50,960 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:50,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:50,960 INFO L82 PathProgramCache]: Analyzing trace with hash -846844973, now seen corresponding path program 1 times [2019-10-07 13:28:50,961 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:50,961 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,961 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,961 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:51,035 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:51,035 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:51,035 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:51,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:51,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:51,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:51,037 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand 4 states. [2019-10-07 13:28:51,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:51,063 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2019-10-07 13:28:51,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:51,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-07 13:28:51,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:51,064 INFO L225 Difference]: With dead ends: 31 [2019-10-07 13:28:51,065 INFO L226 Difference]: Without dead ends: 29 [2019-10-07 13:28:51,065 INFO L606 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-10-07 13:28:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-07 13:28:51,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2019-10-07 13:28:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 13:28:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-10-07 13:28:51,070 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 13 [2019-10-07 13:28:51,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:51,071 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-10-07 13:28:51,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2019-10-07 13:28:51,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:28:51,072 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:51,072 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:51,072 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:51,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:51,073 INFO L82 PathProgramCache]: Analyzing trace with hash -482174688, now seen corresponding path program 1 times [2019-10-07 13:28:51,073 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:51,073 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:51,073 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:51,073 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:51,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:51,123 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:51,124 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:51,124 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:51,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:51,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:51,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:51,125 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 4 states. [2019-10-07 13:28:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:51,159 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2019-10-07 13:28:51,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:51,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-07 13:28:51,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:51,161 INFO L225 Difference]: With dead ends: 29 [2019-10-07 13:28:51,161 INFO L226 Difference]: Without dead ends: 27 [2019-10-07 13:28:51,162 INFO L606 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-10-07 13:28:51,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-07 13:28:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-10-07 13:28:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 13:28:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-10-07 13:28:51,170 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 14 [2019-10-07 13:28:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:51,171 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-10-07 13:28:51,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-10-07 13:28:51,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:28:51,175 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:51,175 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:51,176 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2062297400, now seen corresponding path program 1 times [2019-10-07 13:28:51,178 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:51,178 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:51,178 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:51,178 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:51,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:51,225 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:51,225 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:51,226 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:51,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:51,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:51,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:51,227 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 4 states. [2019-10-07 13:28:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:51,250 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-10-07 13:28:51,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:51,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-07 13:28:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:51,251 INFO L225 Difference]: With dead ends: 23 [2019-10-07 13:28:51,251 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:28:51,252 INFO L606 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-10-07 13:28:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:28:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:28:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:28:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:28:51,253 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-10-07 13:28:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:51,254 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:28:51,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:28:51,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:28:51,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:28:51,281 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:28:51,281 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:51,281 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:51,282 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:28:51,282 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:28:51,282 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:28:51,282 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-10-07 13:28:51,282 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2019-10-07 13:28:51,283 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-10-07 13:28:51,283 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-10-07 13:28:51,283 INFO L446 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-10-07 13:28:51,283 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-10-07 13:28:51,284 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-10-07 13:28:51,284 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2019-10-07 13:28:51,284 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-10-07 13:28:51,284 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2019-10-07 13:28:51,284 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-07 13:28:51,285 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-10-07 13:28:51,285 INFO L446 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-10-07 13:28:51,285 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-07 13:28:51,285 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-10-07 13:28:51,285 INFO L439 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-10-07 13:28:51,286 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-10-07 13:28:51,286 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-10-07 13:28:51,286 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-10-07 13:28:51,286 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-10-07 13:28:51,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:28:51 BoogieIcfgContainer [2019-10-07 13:28:51,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:28:51,298 INFO L168 Benchmark]: Toolchain (without parser) took 1965.81 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 102.5 MB in the beginning and 91.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:51,299 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:28:51,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.65 ms. Allocated memory is still 137.9 MB. Free memory was 102.3 MB in the beginning and 92.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:51,301 INFO L168 Benchmark]: Boogie Preprocessor took 117.88 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 92.2 MB in the beginning and 178.7 MB in the end (delta: -86.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:51,302 INFO L168 Benchmark]: RCFGBuilder took 503.85 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 156.5 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:51,303 INFO L168 Benchmark]: TraceAbstraction took 999.48 ms. Allocated memory is still 201.3 MB. Free memory was 155.8 MB in the beginning and 91.9 MB in the end (delta: 63.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:51,307 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 338.65 ms. Allocated memory is still 137.9 MB. Free memory was 102.3 MB in the beginning and 92.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.88 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 92.2 MB in the beginning and 178.7 MB in the end (delta: -86.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 503.85 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 156.5 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 999.48 ms. Allocated memory is still 201.3 MB. Free memory was 155.8 MB in the beginning and 91.9 MB in the end (delta: 63.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Result: SAFE, OverallTime: 0.9s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 167 SDtfs, 116 SDslu, 231 SDs, 0 SdLazy, 56 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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, 6 MinimizatonAttempts, 50 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 2503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...