./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc492c809d432e4c3053fa8c39191c1c15ea4eea ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:10:39,892 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:10:39,897 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:10:39,911 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:10:39,912 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:10:39,914 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:10:39,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:10:39,920 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:10:39,925 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:10:39,926 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:10:39,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:10:39,927 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:10:39,930 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:10:39,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:10:39,932 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:10:39,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:10:39,942 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:10:39,947 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:10:39,949 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:10:39,954 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:10:39,955 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:10:39,957 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:10:39,960 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:10:39,960 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:10:39,960 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:10:39,961 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:10:39,962 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:10:39,962 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:10:39,963 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:10:39,964 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:10:39,964 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:10:39,965 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:10:39,965 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:10:39,965 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:10:39,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:10:39,967 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:10:39,967 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:10:39,985 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:10:39,985 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:10:39,987 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:10:39,987 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:10:39,987 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:10:39,988 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:10:39,988 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:10:39,988 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:10:39,988 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:10:39,988 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:10:39,989 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:10:39,990 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:10:39,990 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:10:39,990 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:10:39,990 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:10:39,990 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:10:39,991 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:10:39,991 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:10:39,991 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:10:39,991 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:10:39,991 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:10:39,991 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:10:39,993 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:10:39,993 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:10:39,993 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:10:39,993 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:10:39,994 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:10:39,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:10:39,994 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2018-12-30 16:10:40,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:10:40,046 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:10:40,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:10:40,051 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:10:40,051 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:10:40,052 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:40,109 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf285180/4b5082b47a144d82a2e5f4daafa5d6c7/FLAGff4405368 [2018-12-30 16:10:40,541 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:10:40,542 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:40,549 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf285180/4b5082b47a144d82a2e5f4daafa5d6c7/FLAGff4405368 [2018-12-30 16:10:40,905 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf285180/4b5082b47a144d82a2e5f4daafa5d6c7 [2018-12-30 16:10:40,908 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:10:40,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:10:40,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:10:40,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:10:40,914 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:10:40,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:10:40" (1/1) ... [2018-12-30 16:10:40,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3534d13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:40, skipping insertion in model container [2018-12-30 16:10:40,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:10:40" (1/1) ... [2018-12-30 16:10:40,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:10:40,950 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:10:41,178 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:10:41,185 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:10:41,221 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:10:41,245 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:10:41,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:41 WrapperNode [2018-12-30 16:10:41,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:10:41,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:10:41,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:10:41,249 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:10:41,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:41" (1/1) ... [2018-12-30 16:10:41,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:41" (1/1) ... [2018-12-30 16:10:41,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:10:41,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:10:41,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:10:41,300 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:10:41,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:41" (1/1) ... [2018-12-30 16:10:41,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:41" (1/1) ... [2018-12-30 16:10:41,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:41" (1/1) ... [2018-12-30 16:10:41,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:41" (1/1) ... [2018-12-30 16:10:41,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:41" (1/1) ... [2018-12-30 16:10:41,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:41" (1/1) ... [2018-12-30 16:10:41,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:41" (1/1) ... [2018-12-30 16:10:41,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:10:41,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:10:41,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:10:41,346 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:10:41,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:41" (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 [2018-12-30 16:10:41,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:10:41,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:10:41,918 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:10:41,919 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-30 16:10:41,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:41 BoogieIcfgContainer [2018-12-30 16:10:41,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:10:41,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:10:41,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:10:41,924 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:10:41,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:10:40" (1/3) ... [2018-12-30 16:10:41,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2bf11b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:10:41, skipping insertion in model container [2018-12-30 16:10:41,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:41" (2/3) ... [2018-12-30 16:10:41,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2bf11b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:10:41, skipping insertion in model container [2018-12-30 16:10:41,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:41" (3/3) ... [2018-12-30 16:10:41,929 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:41,939 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:10:41,948 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:10:41,969 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:10:42,002 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:10:42,003 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:10:42,003 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:10:42,004 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:10:42,004 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:10:42,004 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:10:42,004 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:10:42,004 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:10:42,004 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:10:42,022 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-12-30 16:10:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-30 16:10:42,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:42,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:42,033 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:42,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:42,039 INFO L82 PathProgramCache]: Analyzing trace with hash 502900931, now seen corresponding path program 1 times [2018-12-30 16:10:42,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:42,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:42,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:42,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:42,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:42,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:42,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:42,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:42,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:42,255 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2018-12-30 16:10:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:42,328 INFO L93 Difference]: Finished difference Result 58 states and 96 transitions. [2018-12-30 16:10:42,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:42,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-30 16:10:42,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:42,343 INFO L225 Difference]: With dead ends: 58 [2018-12-30 16:10:42,344 INFO L226 Difference]: Without dead ends: 44 [2018-12-30 16:10:42,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-30 16:10:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2018-12-30 16:10:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-30 16:10:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 53 transitions. [2018-12-30 16:10:42,390 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 53 transitions. Word has length 12 [2018-12-30 16:10:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:42,390 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 53 transitions. [2018-12-30 16:10:42,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 53 transitions. [2018-12-30 16:10:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-30 16:10:42,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:42,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:42,393 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:42,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:42,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1182959301, now seen corresponding path program 1 times [2018-12-30 16:10:42,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:42,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:42,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:42,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:42,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:42,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:42,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:42,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:42,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:42,478 INFO L87 Difference]: Start difference. First operand 30 states and 53 transitions. Second operand 3 states. [2018-12-30 16:10:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:42,552 INFO L93 Difference]: Finished difference Result 73 states and 128 transitions. [2018-12-30 16:10:42,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:42,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-30 16:10:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:42,556 INFO L225 Difference]: With dead ends: 73 [2018-12-30 16:10:42,556 INFO L226 Difference]: Without dead ends: 44 [2018-12-30 16:10:42,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-30 16:10:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-12-30 16:10:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-30 16:10:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2018-12-30 16:10:42,568 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 12 [2018-12-30 16:10:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:42,570 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2018-12-30 16:10:42,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2018-12-30 16:10:42,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-30 16:10:42,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:42,571 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:42,572 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:42,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:42,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1589725680, now seen corresponding path program 1 times [2018-12-30 16:10:42,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:42,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:42,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:42,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:42,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:42,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:42,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:42,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:42,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:42,635 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2018-12-30 16:10:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:42,677 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2018-12-30 16:10:42,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:42,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-30 16:10:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:42,679 INFO L225 Difference]: With dead ends: 68 [2018-12-30 16:10:42,679 INFO L226 Difference]: Without dead ends: 47 [2018-12-30 16:10:42,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-30 16:10:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-12-30 16:10:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-30 16:10:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. [2018-12-30 16:10:42,688 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 13 [2018-12-30 16:10:42,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:42,688 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. [2018-12-30 16:10:42,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2018-12-30 16:10:42,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-30 16:10:42,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:42,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:42,689 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:42,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:42,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1982752690, now seen corresponding path program 1 times [2018-12-30 16:10:42,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:42,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:42,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:42,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:42,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:42,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:42,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:42,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:42,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:42,747 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand 3 states. [2018-12-30 16:10:42,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:42,786 INFO L93 Difference]: Finished difference Result 84 states and 140 transitions. [2018-12-30 16:10:42,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:42,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-30 16:10:42,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:42,788 INFO L225 Difference]: With dead ends: 84 [2018-12-30 16:10:42,788 INFO L226 Difference]: Without dead ends: 82 [2018-12-30 16:10:42,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-30 16:10:42,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2018-12-30 16:10:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-30 16:10:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 100 transitions. [2018-12-30 16:10:42,797 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 100 transitions. Word has length 13 [2018-12-30 16:10:42,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:42,797 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 100 transitions. [2018-12-30 16:10:42,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 100 transitions. [2018-12-30 16:10:42,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-30 16:10:42,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:42,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:42,799 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:42,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:42,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1302694320, now seen corresponding path program 1 times [2018-12-30 16:10:42,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:42,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:42,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:42,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:42,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:42,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:42,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:42,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:42,843 INFO L87 Difference]: Start difference. First operand 60 states and 100 transitions. Second operand 3 states. [2018-12-30 16:10:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:42,918 INFO L93 Difference]: Finished difference Result 140 states and 234 transitions. [2018-12-30 16:10:42,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:42,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-30 16:10:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:42,920 INFO L225 Difference]: With dead ends: 140 [2018-12-30 16:10:42,920 INFO L226 Difference]: Without dead ends: 84 [2018-12-30 16:10:42,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:42,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-30 16:10:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-12-30 16:10:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-30 16:10:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 134 transitions. [2018-12-30 16:10:42,932 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 134 transitions. Word has length 13 [2018-12-30 16:10:42,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:42,933 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 134 transitions. [2018-12-30 16:10:42,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:42,933 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 134 transitions. [2018-12-30 16:10:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-30 16:10:42,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:42,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:42,936 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:42,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:42,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1335576262, now seen corresponding path program 1 times [2018-12-30 16:10:42,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:42,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:42,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:42,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:42,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:42,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:42,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:42,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:42,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:42,973 INFO L87 Difference]: Start difference. First operand 82 states and 134 transitions. Second operand 3 states. [2018-12-30 16:10:43,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:43,050 INFO L93 Difference]: Finished difference Result 125 states and 201 transitions. [2018-12-30 16:10:43,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:43,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-30 16:10:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:43,052 INFO L225 Difference]: With dead ends: 125 [2018-12-30 16:10:43,052 INFO L226 Difference]: Without dead ends: 86 [2018-12-30 16:10:43,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:43,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-30 16:10:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-12-30 16:10:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-30 16:10:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 134 transitions. [2018-12-30 16:10:43,065 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 134 transitions. Word has length 14 [2018-12-30 16:10:43,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:43,065 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 134 transitions. [2018-12-30 16:10:43,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2018-12-30 16:10:43,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-30 16:10:43,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:43,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:43,067 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:43,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:43,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1728603272, now seen corresponding path program 1 times [2018-12-30 16:10:43,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:43,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:43,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:43,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:43,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:43,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:43,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:43,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:43,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:43,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:43,122 INFO L87 Difference]: Start difference. First operand 84 states and 134 transitions. Second operand 3 states. [2018-12-30 16:10:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:43,199 INFO L93 Difference]: Finished difference Result 236 states and 376 transitions. [2018-12-30 16:10:43,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:43,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-30 16:10:43,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:43,201 INFO L225 Difference]: With dead ends: 236 [2018-12-30 16:10:43,201 INFO L226 Difference]: Without dead ends: 158 [2018-12-30 16:10:43,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:43,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-30 16:10:43,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2018-12-30 16:10:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-30 16:10:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 242 transitions. [2018-12-30 16:10:43,217 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 242 transitions. Word has length 14 [2018-12-30 16:10:43,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:43,217 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 242 transitions. [2018-12-30 16:10:43,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:43,217 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 242 transitions. [2018-12-30 16:10:43,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-30 16:10:43,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:43,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:43,219 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:43,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:43,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1886305654, now seen corresponding path program 1 times [2018-12-30 16:10:43,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:43,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:43,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:43,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:43,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:43,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:43,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:43,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:43,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:43,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:43,293 INFO L87 Difference]: Start difference. First operand 156 states and 242 transitions. Second operand 3 states. [2018-12-30 16:10:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:43,356 INFO L93 Difference]: Finished difference Result 192 states and 300 transitions. [2018-12-30 16:10:43,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:43,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-30 16:10:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:43,359 INFO L225 Difference]: With dead ends: 192 [2018-12-30 16:10:43,359 INFO L226 Difference]: Without dead ends: 190 [2018-12-30 16:10:43,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:43,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-30 16:10:43,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 156. [2018-12-30 16:10:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-30 16:10:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2018-12-30 16:10:43,389 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 14 [2018-12-30 16:10:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:43,390 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2018-12-30 16:10:43,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2018-12-30 16:10:43,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-30 16:10:43,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:43,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:43,394 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:43,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:43,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2046878555, now seen corresponding path program 1 times [2018-12-30 16:10:43,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:43,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:43,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:43,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:43,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:43,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:43,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:43,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:43,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:43,481 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand 3 states. [2018-12-30 16:10:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:43,520 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2018-12-30 16:10:43,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:43,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-30 16:10:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:43,523 INFO L225 Difference]: With dead ends: 276 [2018-12-30 16:10:43,524 INFO L226 Difference]: Without dead ends: 274 [2018-12-30 16:10:43,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:43,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-30 16:10:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 224. [2018-12-30 16:10:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-30 16:10:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 334 transitions. [2018-12-30 16:10:43,554 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 334 transitions. Word has length 15 [2018-12-30 16:10:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:43,555 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 334 transitions. [2018-12-30 16:10:43,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 334 transitions. [2018-12-30 16:10:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-30 16:10:43,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:43,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:43,560 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:43,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:43,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1366820185, now seen corresponding path program 1 times [2018-12-30 16:10:43,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:43,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:43,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:43,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:43,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:43,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:43,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:43,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:43,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:43,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:43,592 INFO L87 Difference]: Start difference. First operand 224 states and 334 transitions. Second operand 3 states. [2018-12-30 16:10:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:43,624 INFO L93 Difference]: Finished difference Result 516 states and 768 transitions. [2018-12-30 16:10:43,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:43,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-30 16:10:43,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:43,628 INFO L225 Difference]: With dead ends: 516 [2018-12-30 16:10:43,628 INFO L226 Difference]: Without dead ends: 298 [2018-12-30 16:10:43,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-12-30 16:10:43,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2018-12-30 16:10:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-30 16:10:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 426 transitions. [2018-12-30 16:10:43,654 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 426 transitions. Word has length 15 [2018-12-30 16:10:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:43,655 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 426 transitions. [2018-12-30 16:10:43,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 426 transitions. [2018-12-30 16:10:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-30 16:10:43,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:43,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:43,659 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:43,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:43,659 INFO L82 PathProgramCache]: Analyzing trace with hash 971489901, now seen corresponding path program 1 times [2018-12-30 16:10:43,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:43,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:43,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:43,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:43,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:43,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:43,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:43,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:43,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:43,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:43,745 INFO L87 Difference]: Start difference. First operand 296 states and 426 transitions. Second operand 3 states. [2018-12-30 16:10:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:43,855 INFO L93 Difference]: Finished difference Result 452 states and 648 transitions. [2018-12-30 16:10:43,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:43,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-30 16:10:43,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:43,858 INFO L225 Difference]: With dead ends: 452 [2018-12-30 16:10:43,858 INFO L226 Difference]: Without dead ends: 310 [2018-12-30 16:10:43,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-30 16:10:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-12-30 16:10:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-12-30 16:10:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 434 transitions. [2018-12-30 16:10:43,877 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 434 transitions. Word has length 16 [2018-12-30 16:10:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:43,877 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 434 transitions. [2018-12-30 16:10:43,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 434 transitions. [2018-12-30 16:10:43,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-30 16:10:43,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:43,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:43,879 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:43,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:43,879 INFO L82 PathProgramCache]: Analyzing trace with hash 578462891, now seen corresponding path program 1 times [2018-12-30 16:10:43,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:43,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:43,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:43,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:43,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:43,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:43,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:43,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:43,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:43,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:43,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:43,954 INFO L87 Difference]: Start difference. First operand 308 states and 434 transitions. Second operand 3 states. [2018-12-30 16:10:43,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:43,985 INFO L93 Difference]: Finished difference Result 520 states and 732 transitions. [2018-12-30 16:10:43,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:43,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-30 16:10:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:43,989 INFO L225 Difference]: With dead ends: 520 [2018-12-30 16:10:43,989 INFO L226 Difference]: Without dead ends: 518 [2018-12-30 16:10:43,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-12-30 16:10:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 452. [2018-12-30 16:10:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-12-30 16:10:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 618 transitions. [2018-12-30 16:10:44,008 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 618 transitions. Word has length 16 [2018-12-30 16:10:44,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:44,008 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 618 transitions. [2018-12-30 16:10:44,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 618 transitions. [2018-12-30 16:10:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-30 16:10:44,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:44,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:44,010 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:44,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:44,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1258521261, now seen corresponding path program 1 times [2018-12-30 16:10:44,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:44,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:44,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:44,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:44,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:44,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:44,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:44,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:44,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:44,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:44,085 INFO L87 Difference]: Start difference. First operand 452 states and 618 transitions. Second operand 3 states. [2018-12-30 16:10:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:44,167 INFO L93 Difference]: Finished difference Result 1016 states and 1372 transitions. [2018-12-30 16:10:44,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:44,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-30 16:10:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:44,171 INFO L225 Difference]: With dead ends: 1016 [2018-12-30 16:10:44,172 INFO L226 Difference]: Without dead ends: 582 [2018-12-30 16:10:44,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-12-30 16:10:44,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2018-12-30 16:10:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-12-30 16:10:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 754 transitions. [2018-12-30 16:10:44,198 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 754 transitions. Word has length 16 [2018-12-30 16:10:44,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:44,198 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 754 transitions. [2018-12-30 16:10:44,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:44,199 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 754 transitions. [2018-12-30 16:10:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 16:10:44,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:44,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:44,202 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:44,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:44,202 INFO L82 PathProgramCache]: Analyzing trace with hash 752696444, now seen corresponding path program 1 times [2018-12-30 16:10:44,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:44,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:44,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:44,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:44,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:44,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:44,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:44,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:44,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:44,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:44,236 INFO L87 Difference]: Start difference. First operand 580 states and 754 transitions. Second operand 3 states. [2018-12-30 16:10:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:44,299 INFO L93 Difference]: Finished difference Result 872 states and 1124 transitions. [2018-12-30 16:10:44,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:44,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-30 16:10:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:44,305 INFO L225 Difference]: With dead ends: 872 [2018-12-30 16:10:44,305 INFO L226 Difference]: Without dead ends: 598 [2018-12-30 16:10:44,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:44,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-12-30 16:10:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2018-12-30 16:10:44,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-12-30 16:10:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 754 transitions. [2018-12-30 16:10:44,338 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 754 transitions. Word has length 17 [2018-12-30 16:10:44,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:44,340 INFO L480 AbstractCegarLoop]: Abstraction has 596 states and 754 transitions. [2018-12-30 16:10:44,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 754 transitions. [2018-12-30 16:10:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 16:10:44,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:44,343 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:44,343 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:44,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:44,343 INFO L82 PathProgramCache]: Analyzing trace with hash 359669434, now seen corresponding path program 1 times [2018-12-30 16:10:44,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:44,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:44,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:44,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:44,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:44,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:44,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:44,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:44,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:44,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:44,425 INFO L87 Difference]: Start difference. First operand 596 states and 754 transitions. Second operand 3 states. [2018-12-30 16:10:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:44,549 INFO L93 Difference]: Finished difference Result 966 states and 1203 transitions. [2018-12-30 16:10:44,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:44,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-30 16:10:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:44,556 INFO L225 Difference]: With dead ends: 966 [2018-12-30 16:10:44,556 INFO L226 Difference]: Without dead ends: 964 [2018-12-30 16:10:44,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-12-30 16:10:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 900. [2018-12-30 16:10:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-12-30 16:10:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1106 transitions. [2018-12-30 16:10:44,598 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1106 transitions. Word has length 17 [2018-12-30 16:10:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:44,599 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1106 transitions. [2018-12-30 16:10:44,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1106 transitions. [2018-12-30 16:10:44,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 16:10:44,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:44,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:44,605 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:44,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:44,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1039727804, now seen corresponding path program 1 times [2018-12-30 16:10:44,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:44,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:44,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:44,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:44,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:44,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:44,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:44,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:44,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:44,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:44,685 INFO L87 Difference]: Start difference. First operand 900 states and 1106 transitions. Second operand 3 states. [2018-12-30 16:10:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:44,805 INFO L93 Difference]: Finished difference Result 1988 states and 2386 transitions. [2018-12-30 16:10:44,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:44,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-30 16:10:44,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:44,807 INFO L225 Difference]: With dead ends: 1988 [2018-12-30 16:10:44,807 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:10:44,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:10:44,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:10:44,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:10:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:10:44,810 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-12-30 16:10:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:44,811 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:10:44,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:10:44,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:10:44,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:10:44,897 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-12-30 16:10:44,898 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2018-12-30 16:10:44,898 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:10:44,898 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:10:44,898 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2018-12-30 16:10:44,898 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-12-30 16:10:44,898 INFO L451 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2018-12-30 16:10:44,899 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-12-30 16:10:44,899 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2018-12-30 16:10:44,899 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2018-12-30 16:10:44,899 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2018-12-30 16:10:44,899 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-12-30 16:10:44,899 INFO L448 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2018-12-30 16:10:44,899 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-30 16:10:44,899 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2018-12-30 16:10:44,899 INFO L451 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2018-12-30 16:10:44,900 INFO L451 ceAbstractionStarter]: At program point L106(lines 4 107) the Hoare annotation is: true [2018-12-30 16:10:44,900 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-30 16:10:44,900 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-12-30 16:10:44,901 INFO L444 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2018-12-30 16:10:44,901 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2018-12-30 16:10:44,901 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2018-12-30 16:10:44,901 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:10:44,901 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2018-12-30 16:10:44,901 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-12-30 16:10:44,901 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2018-12-30 16:10:44,901 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2018-12-30 16:10:44,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:10:44 BoogieIcfgContainer [2018-12-30 16:10:44,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:10:44,911 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:10:44,911 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:10:44,911 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:10:44,913 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:41" (3/4) ... [2018-12-30 16:10:44,920 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:10:44,936 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-30 16:10:44,937 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:10:45,034 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:10:45,034 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:10:45,035 INFO L168 Benchmark]: Toolchain (without parser) took 4126.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 952.7 MB in the beginning and 923.0 MB in the end (delta: 29.7 MB). Peak memory consumption was 169.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:45,037 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:10:45,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.45 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:45,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.71 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:10:45,039 INFO L168 Benchmark]: Boogie Preprocessor took 45.36 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:45,039 INFO L168 Benchmark]: RCFGBuilder took 574.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:45,040 INFO L168 Benchmark]: TraceAbstraction took 2989.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 929.7 MB in the end (delta: 179.8 MB). Peak memory consumption was 179.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:45,041 INFO L168 Benchmark]: Witness Printer took 123.59 ms. Allocated memory is still 1.2 GB. Free memory was 929.7 MB in the beginning and 923.0 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:45,044 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.45 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.71 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.36 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 574.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2989.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 929.7 MB in the end (delta: 179.8 MB). Peak memory consumption was 179.8 MB. Max. memory is 11.5 GB. * Witness Printer took 123.59 ms. Allocated memory is still 1.2 GB. Free memory was 929.7 MB in the beginning and 923.0 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: 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 1 procedures, 27 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 812 SDtfs, 391 SDslu, 511 SDs, 0 SdLazy, 85 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=900occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 73 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 6130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...