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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:28:47,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:28:47,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:28:47,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:28:47,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:28:47,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:28:47,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:28:47,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:28:47,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:28:47,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:28:47,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:28:47,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:28:47,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:28:47,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:28:47,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:28:47,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:28:47,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:28:47,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:28:47,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:28:47,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:28:47,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:28:47,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:28:47,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:28:47,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:28:47,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:28:47,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:28:47,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:28:47,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:28:47,947 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:28:47,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:28:47,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:28:47,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:28:47,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:28:47,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:28:47,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:28:47,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:28:47,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:28:47,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:28:47,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:28:47,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:28:47,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:28:47,957 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:47,971 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:28:47,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:28:47,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:28:47,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:28:47,973 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:28:47,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:28:47,974 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:28:47,974 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:28:47,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:28:47,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:28:47,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:28:47,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:28:47,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:28:47,975 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:28:47,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:28:47,975 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:28:47,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:28:47,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:28:47,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:28:47,976 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:28:47,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:28:47,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:28:47,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:28:47,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:28:47,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:28:47,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:28:47,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:28:47,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:28:47,978 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,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:28:48,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:28:48,282 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:28:48,284 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:28:48,284 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:28:48,285 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2019-10-07 13:28:48,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f218d294/0f6a45f118fa4ed4a1008d85eaa0c8d4/FLAGdcb299bcd [2019-10-07 13:28:48,772 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:28:48,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2019-10-07 13:28:48,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f218d294/0f6a45f118fa4ed4a1008d85eaa0c8d4/FLAGdcb299bcd [2019-10-07 13:28:49,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f218d294/0f6a45f118fa4ed4a1008d85eaa0c8d4 [2019-10-07 13:28:49,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:28:49,180 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:28:49,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:49,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:28:49,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:28:49,186 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,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f51de0 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,189 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,196 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:28:49,219 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:28:49,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:49,426 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:28:49,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:49,560 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:28:49,561 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,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:49,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:28:49,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:28:49,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:28:49,573 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,573 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,578 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,578 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,582 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,591 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,593 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,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:28:49,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:28:49,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:28:49,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:28:49,597 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,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:28:49,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:28:49,648 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:28:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:28:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:28:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:28:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:28:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:28:50,110 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:28:50,110 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:28:50,112 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,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:28:50,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:28:50,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:28:50,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:28:50,116 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,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49adde0e 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,117 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,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49adde0e 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,118 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,119 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-10-07 13:28:50,128 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:28:50,135 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:28:50,146 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:28:50,171 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:28:50,171 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:28:50,171 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:28:50,171 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:28:50,171 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:28:50,172 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:28:50,172 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:28:50,172 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:28:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-07 13:28:50,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:28:50,193 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:50,194 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:50,195 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:50,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:50,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1728904094, now seen corresponding path program 1 times [2019-10-07 13:28:50,207 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:50,207 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,208 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,208 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:50,386 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,387 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,388 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:50,389 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:50,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:50,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:50,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:50,410 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 4 states. [2019-10-07 13:28:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:50,465 INFO L93 Difference]: Finished difference Result 54 states and 82 transitions. [2019-10-07 13:28:50,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:50,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 13:28:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:50,480 INFO L225 Difference]: With dead ends: 54 [2019-10-07 13:28:50,481 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 13:28:50,484 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,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 13:28:50,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 23. [2019-10-07 13:28:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-07 13:28:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2019-10-07 13:28:50,531 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 35 transitions. Word has length 10 [2019-10-07 13:28:50,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:50,532 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-10-07 13:28:50,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:50,532 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 35 transitions. [2019-10-07 13:28:50,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:28:50,534 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:50,534 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:50,537 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:50,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:50,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2056205010, now seen corresponding path program 1 times [2019-10-07 13:28:50,540 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:50,540 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,540 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,540 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:50,641 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,641 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,642 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:50,643 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:50,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:50,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:50,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:50,645 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. Second operand 4 states. [2019-10-07 13:28:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:50,672 INFO L93 Difference]: Finished difference Result 39 states and 59 transitions. [2019-10-07 13:28:50,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:50,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 13:28:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:50,674 INFO L225 Difference]: With dead ends: 39 [2019-10-07 13:28:50,674 INFO L226 Difference]: Without dead ends: 37 [2019-10-07 13:28:50,675 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,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-07 13:28:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 23. [2019-10-07 13:28:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-07 13:28:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2019-10-07 13:28:50,681 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 11 [2019-10-07 13:28:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:50,682 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2019-10-07 13:28:50,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2019-10-07 13:28:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:28:50,683 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:50,683 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:50,683 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:50,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:50,684 INFO L82 PathProgramCache]: Analyzing trace with hash 682368823, now seen corresponding path program 1 times [2019-10-07 13:28:50,684 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:50,684 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,685 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,685 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:50,753 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,753 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,754 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:50,754 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:50,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:50,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:50,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:50,755 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand 4 states. [2019-10-07 13:28:50,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:50,781 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2019-10-07 13:28:50,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:50,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-07 13:28:50,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:50,783 INFO L225 Difference]: With dead ends: 37 [2019-10-07 13:28:50,783 INFO L226 Difference]: Without dead ends: 35 [2019-10-07 13:28:50,784 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,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-07 13:28:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2019-10-07 13:28:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-07 13:28:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2019-10-07 13:28:50,789 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 12 [2019-10-07 13:28:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:50,789 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-10-07 13:28:50,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2019-10-07 13:28:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:28:50,790 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:50,790 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:50,791 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:50,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:50,791 INFO L82 PathProgramCache]: Analyzing trace with hash -321187933, now seen corresponding path program 1 times [2019-10-07 13:28:50,791 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:50,791 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,792 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,792 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:50,834 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,834 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,835 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:50,835 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:50,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:50,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:50,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:50,836 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand 4 states. [2019-10-07 13:28:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:50,874 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2019-10-07 13:28:50,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:50,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-07 13:28:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:50,875 INFO L225 Difference]: With dead ends: 35 [2019-10-07 13:28:50,876 INFO L226 Difference]: Without dead ends: 33 [2019-10-07 13:28:50,876 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,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-07 13:28:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2019-10-07 13:28:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-07 13:28:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2019-10-07 13:28:50,884 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 32 transitions. Word has length 13 [2019-10-07 13:28:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:50,884 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-10-07 13:28:50,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2019-10-07 13:28:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:28:50,885 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:50,886 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:50,886 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:50,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:50,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1366675956, now seen corresponding path program 1 times [2019-10-07 13:28:50,887 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:50,887 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,887 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,887 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:50,941 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,941 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,942 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:50,942 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:50,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:50,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:50,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:50,944 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. Second operand 4 states. [2019-10-07 13:28:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:50,968 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-10-07 13:28:50,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:50,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-07 13:28:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:50,970 INFO L225 Difference]: With dead ends: 33 [2019-10-07 13:28:50,971 INFO L226 Difference]: Without dead ends: 31 [2019-10-07 13:28:50,971 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,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-07 13:28:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-10-07 13:28:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-07 13:28:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-10-07 13:28:50,979 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2019-10-07 13:28:50,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:50,979 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-10-07 13:28:50,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:50,980 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-10-07 13:28:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:28:50,982 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:50,983 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:50,983 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:50,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:50,984 INFO L82 PathProgramCache]: Analyzing trace with hash 582934040, now seen corresponding path program 1 times [2019-10-07 13:28:50,984 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:50,984 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:50,984 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,984 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:50,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:51,047 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,048 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:51,048 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:51,049 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:51,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:51,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:51,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:51,050 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 4 states. [2019-10-07 13:28:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:51,077 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-10-07 13:28:51,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:51,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-07 13:28:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:51,078 INFO L225 Difference]: With dead ends: 31 [2019-10-07 13:28:51,079 INFO L226 Difference]: Without dead ends: 29 [2019-10-07 13:28:51,079 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,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-07 13:28:51,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-10-07 13:28:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-07 13:28:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-10-07 13:28:51,095 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 15 [2019-10-07 13:28:51,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:51,096 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-10-07 13:28:51,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:51,096 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2019-10-07 13:28:51,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:28:51,097 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:51,097 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:51,097 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:51,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:51,098 INFO L82 PathProgramCache]: Analyzing trace with hash 891302113, now seen corresponding path program 1 times [2019-10-07 13:28:51,098 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:51,098 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:51,098 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:51,099 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:51,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:51,137 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,137 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:51,137 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:51,137 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:51,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:51,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:51,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:51,139 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand 4 states. [2019-10-07 13:28:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:51,154 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-10-07 13:28:51,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:51,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-07 13:28:51,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:51,155 INFO L225 Difference]: With dead ends: 25 [2019-10-07 13:28:51,156 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:28:51,156 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,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:28:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:28:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:28:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:28:51,157 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-10-07 13:28:51,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:51,157 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:28:51,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:28:51,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:28:51,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:28:51,182 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:28:51,182 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:51,182 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:51,183 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:28:51,183 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:28:51,183 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:28:51,183 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2019-10-07 13:28:51,183 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-10-07 13:28:51,183 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2019-10-07 13:28:51,183 INFO L446 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2019-10-07 13:28:51,184 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-10-07 13:28:51,184 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-07 13:28:51,184 INFO L439 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2019-10-07 13:28:51,184 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2019-10-07 13:28:51,184 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2019-10-07 13:28:51,184 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2019-10-07 13:28:51,184 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-07 13:28:51,184 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2019-10-07 13:28:51,185 INFO L443 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2019-10-07 13:28:51,185 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2019-10-07 13:28:51,185 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-07 13:28:51,185 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-10-07 13:28:51,185 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2019-10-07 13:28:51,185 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2019-10-07 13:28:51,185 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-10-07 13:28:51,186 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-10-07 13:28:51,186 INFO L446 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2019-10-07 13:28:51,186 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2019-10-07 13:28:51,195 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,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:28:51,201 INFO L168 Benchmark]: Toolchain (without parser) took 2016.64 ms. Allocated memory was 139.5 MB in the beginning and 233.3 MB in the end (delta: 93.8 MB). Free memory was 102.6 MB in the beginning and 193.0 MB in the end (delta: -90.4 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:51,202 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 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,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.81 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 102.3 MB in the beginning and 181.5 MB in the end (delta: -79.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:51,205 INFO L168 Benchmark]: Boogie Preprocessor took 33.59 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 179.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:51,206 INFO L168 Benchmark]: RCFGBuilder took 516.66 ms. Allocated memory is still 202.4 MB. Free memory was 179.6 MB in the beginning and 154.1 MB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:51,213 INFO L168 Benchmark]: TraceAbstraction took 1082.17 ms. Allocated memory was 202.4 MB in the beginning and 233.3 MB in the end (delta: 30.9 MB). Free memory was 154.1 MB in the beginning and 193.0 MB in the end (delta: -38.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-07 13:28:51,220 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 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 379.81 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 102.3 MB in the beginning and 181.5 MB in the end (delta: -79.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.59 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 179.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 516.66 ms. Allocated memory is still 202.4 MB. Free memory was 179.6 MB in the beginning and 154.1 MB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1082.17 ms. Allocated memory was 202.4 MB in the beginning and 233.3 MB in the end (delta: 30.9 MB). Free memory was 154.1 MB in the beginning and 193.0 MB in the end (delta: -38.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: SAFE, OverallTime: 1.0s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 218 SDtfs, 156 SDslu, 294 SDs, 0 SdLazy, 63 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred 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, 7 MinimizatonAttempts, 66 StatesRemovedByMinimization, 6 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.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 3388 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...