./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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_7_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 ccd6d122756047ddb1225c106ac06a6748e14c22 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 16:10:30,963 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:10:30,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:10:30,986 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:10:30,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:10:30,991 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:10:30,993 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:10:30,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:10:30,999 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:10:31,000 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:10:31,001 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:10:31,002 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:10:31,003 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:10:31,004 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:10:31,005 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:10:31,006 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:10:31,007 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:10:31,009 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:10:31,011 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:10:31,013 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:10:31,014 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:10:31,016 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:10:31,019 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:10:31,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:10:31,019 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:10:31,020 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:10:31,021 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:10:31,022 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:10:31,023 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:10:31,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:10:31,025 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:10:31,025 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:10:31,026 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:10:31,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:10:31,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:10:31,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:10:31,028 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 16:10:31,052 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:10:31,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:10:31,055 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:10:31,056 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:10:31,056 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:10:31,056 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:10:31,057 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:10:31,057 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:10:31,057 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:10:31,057 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:10:31,057 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:10:31,058 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:10:31,058 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:10:31,058 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:10:31,058 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:10:31,058 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:10:31,058 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:10:31,061 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:10:31,061 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:10:31,061 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:10:31,061 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:10:31,061 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:10:31,062 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:10:31,062 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:10:31,062 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:10:31,062 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:10:31,062 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:10:31,063 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:10:31,063 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:10:31,063 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:10:31,063 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 -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2018-11-28 16:10:31,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:10:31,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:10:31,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:10:31,129 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:10:31,130 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:10:31,131 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:31,205 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6d9c38f/e21d9a89f96d4aadb05e275bfb57b905/FLAG77c6a2ced [2018-11-28 16:10:31,655 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:10:31,656 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:31,664 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6d9c38f/e21d9a89f96d4aadb05e275bfb57b905/FLAG77c6a2ced [2018-11-28 16:10:32,030 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6d9c38f/e21d9a89f96d4aadb05e275bfb57b905 [2018-11-28 16:10:32,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:10:32,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:10:32,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:10:32,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:10:32,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:10:32,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:10:32" (1/1) ... [2018-11-28 16:10:32,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c06540b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:32, skipping insertion in model container [2018-11-28 16:10:32,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:10:32" (1/1) ... [2018-11-28 16:10:32,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:10:32,087 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:10:32,351 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:10:32,360 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:10:32,402 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:10:32,421 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:10:32,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:32 WrapperNode [2018-11-28 16:10:32,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:10:32,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:10:32,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:10:32,423 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:10:32,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:32" (1/1) ... [2018-11-28 16:10:32,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:32" (1/1) ... [2018-11-28 16:10:32,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:10:32,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:10:32,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:10:32,452 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:10:32,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:32" (1/1) ... [2018-11-28 16:10:32,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:32" (1/1) ... [2018-11-28 16:10:32,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:32" (1/1) ... [2018-11-28 16:10:32,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:32" (1/1) ... [2018-11-28 16:10:32,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:32" (1/1) ... [2018-11-28 16:10:32,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:32" (1/1) ... [2018-11-28 16:10:32,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:32" (1/1) ... [2018-11-28 16:10:32,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:10:32,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:10:32,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:10:32,490 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:10:32,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:32" (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-11-28 16:10:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:10:32,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:10:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:10:32,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:10:32,630 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:10:32,630 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:10:33,134 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:10:33,134 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 16:10:33,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:33 BoogieIcfgContainer [2018-11-28 16:10:33,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:10:33,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:10:33,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:10:33,142 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:10:33,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:10:32" (1/3) ... [2018-11-28 16:10:33,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76dbe8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:10:33, skipping insertion in model container [2018-11-28 16:10:33,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:32" (2/3) ... [2018-11-28 16:10:33,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76dbe8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:10:33, skipping insertion in model container [2018-11-28 16:10:33,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:33" (3/3) ... [2018-11-28 16:10:33,147 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:33,160 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:10:33,175 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:10:33,200 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:10:33,244 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:10:33,245 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:10:33,245 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:10:33,245 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:10:33,246 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:10:33,246 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:10:33,246 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:10:33,246 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:10:33,247 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:10:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-28 16:10:33,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 16:10:33,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:33,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:33,280 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:33,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:33,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2018-11-28 16:10:33,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:33,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:33,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:33,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:33,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:33,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:33,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:33,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:33,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,511 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2018-11-28 16:10:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:33,576 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2018-11-28 16:10:33,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:33,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-28 16:10:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:33,589 INFO L225 Difference]: With dead ends: 69 [2018-11-28 16:10:33,589 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 16:10:33,593 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-11-28 16:10:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 16:10:33,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-11-28 16:10:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 16:10:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2018-11-28 16:10:33,634 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2018-11-28 16:10:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:33,635 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2018-11-28 16:10:33,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2018-11-28 16:10:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 16:10:33,636 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:33,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:33,636 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:33,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:33,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2018-11-28 16:10:33,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:33,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:33,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:33,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:33,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:33,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:33,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:33,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:33,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,739 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2018-11-28 16:10:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:33,812 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2018-11-28 16:10:33,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:33,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-28 16:10:33,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:33,815 INFO L225 Difference]: With dead ends: 87 [2018-11-28 16:10:33,815 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 16:10:33,817 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-11-28 16:10:33,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 16:10:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-28 16:10:33,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 16:10:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2018-11-28 16:10:33,830 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2018-11-28 16:10:33,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:33,831 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2018-11-28 16:10:33,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2018-11-28 16:10:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 16:10:33,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:33,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:33,832 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:33,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:33,833 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2018-11-28 16:10:33,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:33,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:33,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:33,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:33,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:33,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:33,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:33,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:33,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:33,898 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2018-11-28 16:10:33,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:33,964 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2018-11-28 16:10:33,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:33,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 16:10:33,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:33,966 INFO L225 Difference]: With dead ends: 81 [2018-11-28 16:10:33,966 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 16:10:33,969 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-11-28 16:10:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 16:10:33,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-28 16:10:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-28 16:10:33,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2018-11-28 16:10:33,978 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2018-11-28 16:10:33,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:33,978 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2018-11-28 16:10:33,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:33,979 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2018-11-28 16:10:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 16:10:33,980 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:33,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:33,980 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:33,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:33,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2018-11-28 16:10:33,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:33,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:33,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:33,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:34,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:34,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:34,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:34,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:34,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,035 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2018-11-28 16:10:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:34,069 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2018-11-28 16:10:34,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:34,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 16:10:34,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:34,071 INFO L225 Difference]: With dead ends: 100 [2018-11-28 16:10:34,071 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 16:10:34,073 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-11-28 16:10:34,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 16:10:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2018-11-28 16:10:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 16:10:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2018-11-28 16:10:34,084 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2018-11-28 16:10:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:34,085 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2018-11-28 16:10:34,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2018-11-28 16:10:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 16:10:34,086 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:34,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:34,086 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:34,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:34,087 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2018-11-28 16:10:34,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:34,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:34,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:34,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:34,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:34,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:34,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:34,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:34,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,150 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2018-11-28 16:10:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:34,224 INFO L93 Difference]: Finished difference Result 164 states and 278 transitions. [2018-11-28 16:10:34,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:34,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 16:10:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:34,227 INFO L225 Difference]: With dead ends: 164 [2018-11-28 16:10:34,227 INFO L226 Difference]: Without dead ends: 100 [2018-11-28 16:10:34,228 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-11-28 16:10:34,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-28 16:10:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-11-28 16:10:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 16:10:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2018-11-28 16:10:34,241 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2018-11-28 16:10:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:34,241 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2018-11-28 16:10:34,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2018-11-28 16:10:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 16:10:34,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:34,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:34,244 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:34,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:34,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2018-11-28 16:10:34,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:34,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:34,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:34,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:34,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:34,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:34,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:34,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:34,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,333 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2018-11-28 16:10:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:34,419 INFO L93 Difference]: Finished difference Result 147 states and 241 transitions. [2018-11-28 16:10:34,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:34,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 16:10:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:34,421 INFO L225 Difference]: With dead ends: 147 [2018-11-28 16:10:34,421 INFO L226 Difference]: Without dead ends: 102 [2018-11-28 16:10:34,424 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-11-28 16:10:34,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-28 16:10:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-28 16:10:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 16:10:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2018-11-28 16:10:34,435 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2018-11-28 16:10:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:34,435 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2018-11-28 16:10:34,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2018-11-28 16:10:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 16:10:34,436 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:34,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:34,437 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:34,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:34,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2018-11-28 16:10:34,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:34,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:34,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:34,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:34,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:34,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:34,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:34,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:34,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,517 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2018-11-28 16:10:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:34,567 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2018-11-28 16:10:34,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:34,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 16:10:34,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:34,570 INFO L225 Difference]: With dead ends: 180 [2018-11-28 16:10:34,571 INFO L226 Difference]: Without dead ends: 178 [2018-11-28 16:10:34,572 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-11-28 16:10:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-28 16:10:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2018-11-28 16:10:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-28 16:10:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2018-11-28 16:10:34,596 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2018-11-28 16:10:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:34,597 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2018-11-28 16:10:34,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2018-11-28 16:10:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 16:10:34,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:34,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:34,599 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:34,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:34,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2018-11-28 16:10:34,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:34,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:34,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:34,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:34,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:34,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:34,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:34,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:34,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,673 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2018-11-28 16:10:34,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:34,706 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2018-11-28 16:10:34,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:34,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 16:10:34,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:34,709 INFO L225 Difference]: With dead ends: 312 [2018-11-28 16:10:34,710 INFO L226 Difference]: Without dead ends: 186 [2018-11-28 16:10:34,711 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-11-28 16:10:34,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-28 16:10:34,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-11-28 16:10:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-28 16:10:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2018-11-28 16:10:34,732 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2018-11-28 16:10:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:34,732 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2018-11-28 16:10:34,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:34,733 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2018-11-28 16:10:34,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 16:10:34,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:34,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:34,735 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:34,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:34,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2018-11-28 16:10:34,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:34,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:34,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:34,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:34,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:34,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:34,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:34,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:34,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,797 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2018-11-28 16:10:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:34,829 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2018-11-28 16:10:34,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:34,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 16:10:34,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:34,832 INFO L225 Difference]: With dead ends: 276 [2018-11-28 16:10:34,832 INFO L226 Difference]: Without dead ends: 190 [2018-11-28 16:10:34,833 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-11-28 16:10:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-28 16:10:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2018-11-28 16:10:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-28 16:10:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2018-11-28 16:10:34,847 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2018-11-28 16:10:34,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:34,847 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2018-11-28 16:10:34,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2018-11-28 16:10:34,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 16:10:34,849 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:34,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:34,851 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:34,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:34,852 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2018-11-28 16:10:34,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:34,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:34,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:34,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:34,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:34,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:34,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:34,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:34,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,930 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2018-11-28 16:10:35,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:35,026 INFO L93 Difference]: Finished difference Result 332 states and 520 transitions. [2018-11-28 16:10:35,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:35,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 16:10:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:35,033 INFO L225 Difference]: With dead ends: 332 [2018-11-28 16:10:35,033 INFO L226 Difference]: Without dead ends: 330 [2018-11-28 16:10:35,034 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-11-28 16:10:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-28 16:10:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2018-11-28 16:10:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-28 16:10:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2018-11-28 16:10:35,050 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2018-11-28 16:10:35,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:35,052 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2018-11-28 16:10:35,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:35,052 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2018-11-28 16:10:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 16:10:35,055 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:35,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:35,055 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:35,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:35,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2018-11-28 16:10:35,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:35,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:35,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:35,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:35,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:35,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:35,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:35,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:35,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:35,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:35,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:35,117 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2018-11-28 16:10:35,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:35,185 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2018-11-28 16:10:35,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:35,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 16:10:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:35,191 INFO L225 Difference]: With dead ends: 604 [2018-11-28 16:10:35,192 INFO L226 Difference]: Without dead ends: 354 [2018-11-28 16:10:35,193 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-11-28 16:10:35,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-28 16:10:35,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-11-28 16:10:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-11-28 16:10:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2018-11-28 16:10:35,211 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2018-11-28 16:10:35,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:35,211 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2018-11-28 16:10:35,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2018-11-28 16:10:35,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:10:35,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:35,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:35,214 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:35,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:35,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2018-11-28 16:10:35,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:35,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:35,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:35,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:35,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:35,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:35,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:35,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:35,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:35,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:35,296 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2018-11-28 16:10:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:35,363 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2018-11-28 16:10:35,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:35,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:10:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:35,365 INFO L225 Difference]: With dead ends: 528 [2018-11-28 16:10:35,366 INFO L226 Difference]: Without dead ends: 362 [2018-11-28 16:10:35,367 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-11-28 16:10:35,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-11-28 16:10:35,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2018-11-28 16:10:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-11-28 16:10:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2018-11-28 16:10:35,383 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2018-11-28 16:10:35,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:35,383 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2018-11-28 16:10:35,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2018-11-28 16:10:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:10:35,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:35,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:35,385 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:35,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:35,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2018-11-28 16:10:35,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:35,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:35,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:35,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:35,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:35,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:35,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:35,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:35,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:35,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:35,458 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2018-11-28 16:10:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:35,511 INFO L93 Difference]: Finished difference Result 620 states and 904 transitions. [2018-11-28 16:10:35,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:35,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:10:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:35,517 INFO L225 Difference]: With dead ends: 620 [2018-11-28 16:10:35,517 INFO L226 Difference]: Without dead ends: 618 [2018-11-28 16:10:35,518 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-11-28 16:10:35,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-11-28 16:10:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2018-11-28 16:10:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-28 16:10:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2018-11-28 16:10:35,542 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2018-11-28 16:10:35,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:35,543 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2018-11-28 16:10:35,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2018-11-28 16:10:35,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:10:35,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:35,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:35,546 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:35,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:35,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2018-11-28 16:10:35,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:35,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:35,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:35,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:35,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:35,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:35,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:35,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:35,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:35,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:35,617 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2018-11-28 16:10:35,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:35,733 INFO L93 Difference]: Finished difference Result 1180 states and 1640 transitions. [2018-11-28 16:10:35,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:35,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:10:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:35,738 INFO L225 Difference]: With dead ends: 1180 [2018-11-28 16:10:35,738 INFO L226 Difference]: Without dead ends: 682 [2018-11-28 16:10:35,739 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-11-28 16:10:35,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-11-28 16:10:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2018-11-28 16:10:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-11-28 16:10:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2018-11-28 16:10:35,772 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2018-11-28 16:10:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:35,773 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2018-11-28 16:10:35,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2018-11-28 16:10:35,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:10:35,775 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:35,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:35,775 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:35,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:35,776 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2018-11-28 16:10:35,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:35,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:35,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:35,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:35,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:35,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-11-28 16:10:35,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:35,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:35,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:35,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:35,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:35,844 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2018-11-28 16:10:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:35,948 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2018-11-28 16:10:35,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:35,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 16:10:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:35,952 INFO L225 Difference]: With dead ends: 1020 [2018-11-28 16:10:35,953 INFO L226 Difference]: Without dead ends: 698 [2018-11-28 16:10:35,954 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-11-28 16:10:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-11-28 16:10:35,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2018-11-28 16:10:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-11-28 16:10:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2018-11-28 16:10:35,989 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2018-11-28 16:10:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:35,992 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2018-11-28 16:10:35,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2018-11-28 16:10:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:10:35,994 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:35,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:35,995 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:35,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:35,995 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2018-11-28 16:10:35,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:35,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:35,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:35,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:35,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:36,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:36,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:36,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:36,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:36,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:36,076 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2018-11-28 16:10:36,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:36,201 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2018-11-28 16:10:36,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:36,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 16:10:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:36,208 INFO L225 Difference]: With dead ends: 1164 [2018-11-28 16:10:36,208 INFO L226 Difference]: Without dead ends: 1162 [2018-11-28 16:10:36,209 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-11-28 16:10:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-11-28 16:10:36,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2018-11-28 16:10:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-11-28 16:10:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2018-11-28 16:10:36,258 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2018-11-28 16:10:36,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:36,259 INFO L480 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2018-11-28 16:10:36,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:36,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2018-11-28 16:10:36,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:10:36,262 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:36,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:36,263 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:36,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:36,263 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2018-11-28 16:10:36,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:36,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:36,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:36,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:36,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:36,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:36,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:36,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:36,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:36,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:36,348 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2018-11-28 16:10:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:36,497 INFO L93 Difference]: Finished difference Result 2316 states and 2920 transitions. [2018-11-28 16:10:36,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:36,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 16:10:36,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:36,504 INFO L225 Difference]: With dead ends: 2316 [2018-11-28 16:10:36,505 INFO L226 Difference]: Without dead ends: 1322 [2018-11-28 16:10:36,508 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-11-28 16:10:36,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2018-11-28 16:10:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2018-11-28 16:10:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2018-11-28 16:10:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2018-11-28 16:10:36,574 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2018-11-28 16:10:36,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:36,574 INFO L480 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2018-11-28 16:10:36,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2018-11-28 16:10:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:10:36,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:36,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:36,577 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:36,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:36,579 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2018-11-28 16:10:36,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:36,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:36,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:36,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:36,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:36,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:36,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:36,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:36,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:36,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:36,655 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2018-11-28 16:10:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:36,781 INFO L93 Difference]: Finished difference Result 1980 states and 2392 transitions. [2018-11-28 16:10:36,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:36,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 16:10:36,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:36,789 INFO L225 Difference]: With dead ends: 1980 [2018-11-28 16:10:36,790 INFO L226 Difference]: Without dead ends: 1354 [2018-11-28 16:10:36,792 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-11-28 16:10:36,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-28 16:10:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-11-28 16:10:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-28 16:10:36,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2018-11-28 16:10:36,854 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2018-11-28 16:10:36,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:36,854 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2018-11-28 16:10:36,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:36,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2018-11-28 16:10:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:10:36,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:36,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:36,858 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:36,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:36,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2018-11-28 16:10:36,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:36,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:36,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:36,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:36,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:36,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:36,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:36,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:36,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:36,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:36,938 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2018-11-28 16:10:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:37,095 INFO L93 Difference]: Finished difference Result 2186 states and 2567 transitions. [2018-11-28 16:10:37,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:37,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 16:10:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:37,107 INFO L225 Difference]: With dead ends: 2186 [2018-11-28 16:10:37,108 INFO L226 Difference]: Without dead ends: 2184 [2018-11-28 16:10:37,109 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-11-28 16:10:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2018-11-28 16:10:37,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2018-11-28 16:10:37,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2018-11-28 16:10:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2018-11-28 16:10:37,216 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2018-11-28 16:10:37,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:37,216 INFO L480 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2018-11-28 16:10:37,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2018-11-28 16:10:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:10:37,221 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:37,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:37,222 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:37,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:37,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2018-11-28 16:10:37,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:37,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:37,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:37,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:37,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:37,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:37,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:37,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:37,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:37,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:37,295 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2018-11-28 16:10:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:37,506 INFO L93 Difference]: Finished difference Result 4552 states and 5126 transitions. [2018-11-28 16:10:37,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:37,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 16:10:37,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:37,507 INFO L225 Difference]: With dead ends: 4552 [2018-11-28 16:10:37,508 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 16:10:37,516 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-11-28 16:10:37,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 16:10:37,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 16:10:37,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 16:10:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 16:10:37,517 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-11-28 16:10:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:37,518 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 16:10:37,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 16:10:37,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 16:10:37,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 16:10:37,639 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 16:10:37,639 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:37,640 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:37,640 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 16:10:37,640 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 16:10:37,640 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 16:10:37,640 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2018-11-28 16:10:37,640 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-28 16:10:37,640 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2018-11-28 16:10:37,640 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2018-11-28 16:10:37,641 INFO L451 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2018-11-28 16:10:37,643 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-28 16:10:37,644 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-28 16:10:37,644 INFO L444 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2018-11-28 16:10:37,644 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2018-11-28 16:10:37,644 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2018-11-28 16:10:37,644 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2018-11-28 16:10:37,644 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2018-11-28 16:10:37,644 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2018-11-28 16:10:37,644 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2018-11-28 16:10:37,644 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-28 16:10:37,645 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2018-11-28 16:10:37,645 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2018-11-28 16:10:37,645 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2018-11-28 16:10:37,645 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-28 16:10:37,645 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-11-28 16:10:37,645 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2018-11-28 16:10:37,645 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2018-11-28 16:10:37,645 INFO L448 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2018-11-28 16:10:37,645 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-11-28 16:10:37,645 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2018-11-28 16:10:37,651 INFO L451 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2018-11-28 16:10:37,651 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2018-11-28 16:10:37,651 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2018-11-28 16:10:37,651 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2018-11-28 16:10:37,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:10:37 BoogieIcfgContainer [2018-11-28 16:10:37,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:10:37,661 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:10:37,661 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:10:37,662 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:10:37,662 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:33" (3/4) ... [2018-11-28 16:10:37,669 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 16:10:37,678 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 16:10:37,678 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 16:10:37,685 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 16:10:37,685 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 16:10:37,686 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 16:10:37,761 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:10:37,767 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:10:37,770 INFO L168 Benchmark]: Toolchain (without parser) took 5736.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -206.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:37,772 INFO L168 Benchmark]: CDTParser took 0.40 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-11-28 16:10:37,773 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.28 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-11-28 16:10:37,773 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.79 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-11-28 16:10:37,773 INFO L168 Benchmark]: Boogie Preprocessor took 39.24 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-11-28 16:10:37,777 INFO L168 Benchmark]: RCFGBuilder took 645.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:37,778 INFO L168 Benchmark]: TraceAbstraction took 4523.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -67.1 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:37,778 INFO L168 Benchmark]: Witness Printer took 105.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:37,787 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.40 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 386.28 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 27.79 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 39.24 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 645.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4523.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -67.1 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Witness Printer took 105.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 35 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, 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.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...