./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_db4c0613-1d67-4cd7-855e-d1a184d49c49/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_db4c0613-1d67-4cd7-855e-d1a184d49c49/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_db4c0613-1d67-4cd7-855e-d1a184d49c49/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_db4c0613-1d67-4cd7-855e-d1a184d49c49/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_db4c0613-1d67-4cd7-855e-d1a184d49c49/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_db4c0613-1d67-4cd7-855e-d1a184d49c49/bin-2019/uautomizer --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 5107685577f81a5867811396b2c0a05eb5630c95 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 22:20:35,996 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 22:20:35,998 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 22:20:36,006 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 22:20:36,006 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 22:20:36,007 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 22:20:36,008 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 22:20:36,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 22:20:36,010 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 22:20:36,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 22:20:36,011 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 22:20:36,011 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 22:20:36,012 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 22:20:36,013 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 22:20:36,014 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 22:20:36,014 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 22:20:36,015 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 22:20:36,016 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 22:20:36,018 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 22:20:36,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 22:20:36,019 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 22:20:36,020 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 22:20:36,022 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 22:20:36,022 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 22:20:36,022 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 22:20:36,023 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 22:20:36,024 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 22:20:36,024 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 22:20:36,025 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 22:20:36,026 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 22:20:36,026 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 22:20:36,027 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 22:20:36,027 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 22:20:36,027 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 22:20:36,028 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 22:20:36,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 22:20:36,029 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_db4c0613-1d67-4cd7-855e-d1a184d49c49/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-09 22:20:36,038 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 22:20:36,039 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 22:20:36,039 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-09 22:20:36,039 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-09 22:20:36,040 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 22:20:36,040 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 22:20:36,040 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 22:20:36,040 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 22:20:36,040 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 22:20:36,041 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 22:20:36,041 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 22:20:36,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 22:20:36,041 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-09 22:20:36,041 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-09 22:20:36,041 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-09 22:20:36,041 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 22:20:36,042 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 22:20:36,042 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-09 22:20:36,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 22:20:36,042 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 22:20:36,042 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-09 22:20:36,042 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-09 22:20:36,042 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-09 22:20:36,043 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 22:20:36,043 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-09 22:20:36,043 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-09 22:20:36,043 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 22:20:36,043 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-09 22:20:36,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-09 22:20:36,043 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_db4c0613-1d67-4cd7-855e-d1a184d49c49/bin-2019/uautomizer 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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2018-11-09 22:20:36,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 22:20:36,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 22:20:36,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 22:20:36,079 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 22:20:36,079 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 22:20:36,079 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_db4c0613-1d67-4cd7-855e-d1a184d49c49/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-09 22:20:36,114 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db4c0613-1d67-4cd7-855e-d1a184d49c49/bin-2019/uautomizer/data/de42145c8/cdabe491c8c6409ba004030d779fe4c6/FLAG847465e23 [2018-11-09 22:20:36,506 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 22:20:36,506 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_db4c0613-1d67-4cd7-855e-d1a184d49c49/sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-09 22:20:36,511 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db4c0613-1d67-4cd7-855e-d1a184d49c49/bin-2019/uautomizer/data/de42145c8/cdabe491c8c6409ba004030d779fe4c6/FLAG847465e23 [2018-11-09 22:20:36,521 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_db4c0613-1d67-4cd7-855e-d1a184d49c49/bin-2019/uautomizer/data/de42145c8/cdabe491c8c6409ba004030d779fe4c6 [2018-11-09 22:20:36,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 22:20:36,524 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-09 22:20:36,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 22:20:36,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 22:20:36,527 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 22:20:36,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:20:36" (1/1) ... [2018-11-09 22:20:36,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e7f328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:36, skipping insertion in model container [2018-11-09 22:20:36,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:20:36" (1/1) ... [2018-11-09 22:20:36,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 22:20:36,547 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 22:20:36,652 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:20:36,654 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 22:20:36,669 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:20:36,677 INFO L193 MainTranslator]: Completed translation [2018-11-09 22:20:36,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:36 WrapperNode [2018-11-09 22:20:36,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 22:20:36,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 22:20:36,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 22:20:36,678 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 22:20:36,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:36" (1/1) ... [2018-11-09 22:20:36,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:36" (1/1) ... [2018-11-09 22:20:36,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:36" (1/1) ... [2018-11-09 22:20:36,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:36" (1/1) ... [2018-11-09 22:20:36,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:36" (1/1) ... [2018-11-09 22:20:36,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:36" (1/1) ... [2018-11-09 22:20:36,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:36" (1/1) ... [2018-11-09 22:20:36,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 22:20:36,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 22:20:36,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 22:20:36,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 22:20:36,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db4c0613-1d67-4cd7-855e-d1a184d49c49/bin-2019/uautomizer/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-09 22:20:36,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-09 22:20:36,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 22:20:36,781 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-09 22:20:36,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-09 22:20:36,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-09 22:20:36,781 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-09 22:20:36,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-09 22:20:36,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 22:20:36,965 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 22:20:36,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:20:36 BoogieIcfgContainer [2018-11-09 22:20:36,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 22:20:36,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-09 22:20:36,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-09 22:20:36,968 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-09 22:20:36,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:20:36" (1/3) ... [2018-11-09 22:20:36,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbff217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:20:36, skipping insertion in model container [2018-11-09 22:20:36,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:36" (2/3) ... [2018-11-09 22:20:36,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbff217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:20:36, skipping insertion in model container [2018-11-09 22:20:36,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:20:36" (3/3) ... [2018-11-09 22:20:36,971 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-09 22:20:36,979 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-09 22:20:36,985 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-09 22:20:36,999 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-09 22:20:37,026 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 22:20:37,026 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-09 22:20:37,026 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-09 22:20:37,026 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-09 22:20:37,027 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 22:20:37,027 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 22:20:37,027 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-09 22:20:37,027 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 22:20:37,027 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-09 22:20:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-09 22:20:37,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-09 22:20:37,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:37,047 INFO L375 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-09 22:20:37,049 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:37,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:37,054 INFO L82 PathProgramCache]: Analyzing trace with hash -811584747, now seen corresponding path program 1 times [2018-11-09 22:20:37,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:37,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:37,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:37,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:37,192 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-09 22:20:37,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:37,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:37,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:37,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:37,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:37,207 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-11-09 22:20:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:37,243 INFO L93 Difference]: Finished difference Result 83 states and 140 transitions. [2018-11-09 22:20:37,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:37,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-09 22:20:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:37,252 INFO L225 Difference]: With dead ends: 83 [2018-11-09 22:20:37,253 INFO L226 Difference]: Without dead ends: 68 [2018-11-09 22:20:37,255 INFO L605 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-09 22:20:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-09 22:20:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-11-09 22:20:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-09 22:20:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2018-11-09 22:20:37,282 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 20 [2018-11-09 22:20:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:37,282 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 82 transitions. [2018-11-09 22:20:37,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2018-11-09 22:20:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-09 22:20:37,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:37,283 INFO L375 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-09 22:20:37,283 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:37,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:37,284 INFO L82 PathProgramCache]: Analyzing trace with hash -553419309, now seen corresponding path program 1 times [2018-11-09 22:20:37,284 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:37,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:37,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:37,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:37,319 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-09 22:20:37,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:37,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:37,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:37,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:37,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:37,321 INFO L87 Difference]: Start difference. First operand 47 states and 82 transitions. Second operand 3 states. [2018-11-09 22:20:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:37,348 INFO L93 Difference]: Finished difference Result 110 states and 195 transitions. [2018-11-09 22:20:37,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:37,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-09 22:20:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:37,350 INFO L225 Difference]: With dead ends: 110 [2018-11-09 22:20:37,350 INFO L226 Difference]: Without dead ends: 68 [2018-11-09 22:20:37,351 INFO L605 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-09 22:20:37,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-09 22:20:37,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-09 22:20:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-09 22:20:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 115 transitions. [2018-11-09 22:20:37,357 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 115 transitions. Word has length 20 [2018-11-09 22:20:37,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:37,357 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 115 transitions. [2018-11-09 22:20:37,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 115 transitions. [2018-11-09 22:20:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-09 22:20:37,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:37,358 INFO L375 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-09 22:20:37,358 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:37,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:37,359 INFO L82 PathProgramCache]: Analyzing trace with hash 610890324, now seen corresponding path program 1 times [2018-11-09 22:20:37,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:37,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:37,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:37,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:37,395 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-09 22:20:37,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:37,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:37,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:37,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:37,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:37,396 INFO L87 Difference]: Start difference. First operand 66 states and 115 transitions. Second operand 3 states. [2018-11-09 22:20:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:37,417 INFO L93 Difference]: Finished difference Result 103 states and 175 transitions. [2018-11-09 22:20:37,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:37,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-09 22:20:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:37,419 INFO L225 Difference]: With dead ends: 103 [2018-11-09 22:20:37,419 INFO L226 Difference]: Without dead ends: 72 [2018-11-09 22:20:37,419 INFO L605 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-09 22:20:37,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-09 22:20:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-09 22:20:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-09 22:20:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 118 transitions. [2018-11-09 22:20:37,425 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 118 transitions. Word has length 21 [2018-11-09 22:20:37,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:37,426 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 118 transitions. [2018-11-09 22:20:37,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2018-11-09 22:20:37,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-09 22:20:37,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:37,427 INFO L375 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-09 22:20:37,427 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:37,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:37,427 INFO L82 PathProgramCache]: Analyzing trace with hash 24084310, now seen corresponding path program 1 times [2018-11-09 22:20:37,427 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:37,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:37,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:37,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:37,461 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-09 22:20:37,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:37,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:37,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:37,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:37,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:37,461 INFO L87 Difference]: Start difference. First operand 70 states and 118 transitions. Second operand 3 states. [2018-11-09 22:20:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:37,479 INFO L93 Difference]: Finished difference Result 129 states and 221 transitions. [2018-11-09 22:20:37,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:37,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-09 22:20:37,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:37,480 INFO L225 Difference]: With dead ends: 129 [2018-11-09 22:20:37,480 INFO L226 Difference]: Without dead ends: 127 [2018-11-09 22:20:37,481 INFO L605 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-09 22:20:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-09 22:20:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2018-11-09 22:20:37,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-09 22:20:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 155 transitions. [2018-11-09 22:20:37,488 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 155 transitions. Word has length 21 [2018-11-09 22:20:37,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:37,488 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 155 transitions. [2018-11-09 22:20:37,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 155 transitions. [2018-11-09 22:20:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-09 22:20:37,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:37,489 INFO L375 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-09 22:20:37,490 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:37,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:37,490 INFO L82 PathProgramCache]: Analyzing trace with hash 282249748, now seen corresponding path program 1 times [2018-11-09 22:20:37,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:37,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:37,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:37,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:37,517 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-09 22:20:37,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:37,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:37,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:37,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:37,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:37,518 INFO L87 Difference]: Start difference. First operand 91 states and 155 transitions. Second operand 3 states. [2018-11-09 22:20:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:37,538 INFO L93 Difference]: Finished difference Result 211 states and 365 transitions. [2018-11-09 22:20:37,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:37,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-09 22:20:37,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:37,539 INFO L225 Difference]: With dead ends: 211 [2018-11-09 22:20:37,539 INFO L226 Difference]: Without dead ends: 129 [2018-11-09 22:20:37,539 INFO L605 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-09 22:20:37,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-09 22:20:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-11-09 22:20:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-09 22:20:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 215 transitions. [2018-11-09 22:20:37,547 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 215 transitions. Word has length 21 [2018-11-09 22:20:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:37,547 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 215 transitions. [2018-11-09 22:20:37,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:37,548 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 215 transitions. [2018-11-09 22:20:37,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-09 22:20:37,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:37,548 INFO L375 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-09 22:20:37,549 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:37,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:37,549 INFO L82 PathProgramCache]: Analyzing trace with hash 746827656, now seen corresponding path program 1 times [2018-11-09 22:20:37,549 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:37,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:37,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:37,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:37,574 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-09 22:20:37,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:37,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:37,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:37,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:37,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:37,575 INFO L87 Difference]: Start difference. First operand 127 states and 215 transitions. Second operand 3 states. [2018-11-09 22:20:37,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:37,589 INFO L93 Difference]: Finished difference Result 190 states and 320 transitions. [2018-11-09 22:20:37,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:37,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-09 22:20:37,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:37,590 INFO L225 Difference]: With dead ends: 190 [2018-11-09 22:20:37,590 INFO L226 Difference]: Without dead ends: 131 [2018-11-09 22:20:37,591 INFO L605 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-09 22:20:37,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-09 22:20:37,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-11-09 22:20:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-09 22:20:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 215 transitions. [2018-11-09 22:20:37,598 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 215 transitions. Word has length 22 [2018-11-09 22:20:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:37,598 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 215 transitions. [2018-11-09 22:20:37,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 215 transitions. [2018-11-09 22:20:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-09 22:20:37,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:37,599 INFO L375 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-09 22:20:37,600 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:37,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:37,600 INFO L82 PathProgramCache]: Analyzing trace with hash 160021642, now seen corresponding path program 1 times [2018-11-09 22:20:37,600 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:37,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:37,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:37,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:37,633 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-09 22:20:37,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:37,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:37,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:37,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:37,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:37,634 INFO L87 Difference]: Start difference. First operand 129 states and 215 transitions. Second operand 3 states. [2018-11-09 22:20:37,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:37,648 INFO L93 Difference]: Finished difference Result 237 states and 401 transitions. [2018-11-09 22:20:37,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:37,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-09 22:20:37,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:37,650 INFO L225 Difference]: With dead ends: 237 [2018-11-09 22:20:37,650 INFO L226 Difference]: Without dead ends: 235 [2018-11-09 22:20:37,650 INFO L605 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-09 22:20:37,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-09 22:20:37,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 173. [2018-11-09 22:20:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-09 22:20:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 287 transitions. [2018-11-09 22:20:37,660 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 287 transitions. Word has length 22 [2018-11-09 22:20:37,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:37,660 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 287 transitions. [2018-11-09 22:20:37,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 287 transitions. [2018-11-09 22:20:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-09 22:20:37,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:37,662 INFO L375 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-09 22:20:37,662 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:37,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:37,662 INFO L82 PathProgramCache]: Analyzing trace with hash 418187080, now seen corresponding path program 1 times [2018-11-09 22:20:37,662 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:37,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:37,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:37,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:37,693 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-09 22:20:37,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:37,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:37,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:37,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:37,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:37,694 INFO L87 Difference]: Start difference. First operand 173 states and 287 transitions. Second operand 3 states. [2018-11-09 22:20:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:37,713 INFO L93 Difference]: Finished difference Result 405 states and 677 transitions. [2018-11-09 22:20:37,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:37,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-09 22:20:37,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:37,714 INFO L225 Difference]: With dead ends: 405 [2018-11-09 22:20:37,714 INFO L226 Difference]: Without dead ends: 243 [2018-11-09 22:20:37,715 INFO L605 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-09 22:20:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-09 22:20:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-11-09 22:20:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-09 22:20:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 395 transitions. [2018-11-09 22:20:37,725 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 395 transitions. Word has length 22 [2018-11-09 22:20:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:37,725 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 395 transitions. [2018-11-09 22:20:37,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 395 transitions. [2018-11-09 22:20:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-09 22:20:37,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:37,726 INFO L375 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-09 22:20:37,726 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:37,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:37,727 INFO L82 PathProgramCache]: Analyzing trace with hash 665917993, now seen corresponding path program 1 times [2018-11-09 22:20:37,727 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:37,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:37,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:37,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:37,757 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-09 22:20:37,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:37,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:37,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:37,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:37,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:37,758 INFO L87 Difference]: Start difference. First operand 241 states and 395 transitions. Second operand 3 states. [2018-11-09 22:20:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:37,781 INFO L93 Difference]: Finished difference Result 361 states and 589 transitions. [2018-11-09 22:20:37,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:37,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-09 22:20:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:37,782 INFO L225 Difference]: With dead ends: 361 [2018-11-09 22:20:37,782 INFO L226 Difference]: Without dead ends: 247 [2018-11-09 22:20:37,783 INFO L605 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-09 22:20:37,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-09 22:20:37,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-11-09 22:20:37,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-09 22:20:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 395 transitions. [2018-11-09 22:20:37,791 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 395 transitions. Word has length 23 [2018-11-09 22:20:37,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:37,791 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 395 transitions. [2018-11-09 22:20:37,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:37,791 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 395 transitions. [2018-11-09 22:20:37,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-09 22:20:37,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:37,792 INFO L375 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-09 22:20:37,792 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:37,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:37,792 INFO L82 PathProgramCache]: Analyzing trace with hash 79111979, now seen corresponding path program 1 times [2018-11-09 22:20:37,792 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:37,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:37,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:37,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:37,820 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-09 22:20:37,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:37,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:37,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:37,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:37,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:37,821 INFO L87 Difference]: Start difference. First operand 245 states and 395 transitions. Second operand 3 states. [2018-11-09 22:20:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:37,856 INFO L93 Difference]: Finished difference Result 445 states and 729 transitions. [2018-11-09 22:20:37,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:37,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-09 22:20:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:37,858 INFO L225 Difference]: With dead ends: 445 [2018-11-09 22:20:37,858 INFO L226 Difference]: Without dead ends: 443 [2018-11-09 22:20:37,859 INFO L605 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-09 22:20:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-11-09 22:20:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 337. [2018-11-09 22:20:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-09 22:20:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 535 transitions. [2018-11-09 22:20:37,868 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 535 transitions. Word has length 23 [2018-11-09 22:20:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:37,868 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 535 transitions. [2018-11-09 22:20:37,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:37,869 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 535 transitions. [2018-11-09 22:20:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-09 22:20:37,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:37,869 INFO L375 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-09 22:20:37,870 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:37,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:37,870 INFO L82 PathProgramCache]: Analyzing trace with hash 337277417, now seen corresponding path program 1 times [2018-11-09 22:20:37,870 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:37,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:37,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:37,893 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-09 22:20:37,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:37,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:37,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:37,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:37,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:37,894 INFO L87 Difference]: Start difference. First operand 337 states and 535 transitions. Second operand 3 states. [2018-11-09 22:20:37,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:37,915 INFO L93 Difference]: Finished difference Result 789 states and 1257 transitions. [2018-11-09 22:20:37,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:37,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-09 22:20:37,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:37,917 INFO L225 Difference]: With dead ends: 789 [2018-11-09 22:20:37,917 INFO L226 Difference]: Without dead ends: 467 [2018-11-09 22:20:37,918 INFO L605 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-09 22:20:37,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-11-09 22:20:37,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 465. [2018-11-09 22:20:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-11-09 22:20:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 727 transitions. [2018-11-09 22:20:37,927 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 727 transitions. Word has length 23 [2018-11-09 22:20:37,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:37,927 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 727 transitions. [2018-11-09 22:20:37,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 727 transitions. [2018-11-09 22:20:37,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-09 22:20:37,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:37,928 INFO L375 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, 1] [2018-11-09 22:20:37,928 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:37,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:37,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1842281219, now seen corresponding path program 1 times [2018-11-09 22:20:37,928 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:37,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:37,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:37,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:20:37,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:37,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:37,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:37,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:37,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:37,954 INFO L87 Difference]: Start difference. First operand 465 states and 727 transitions. Second operand 3 states. [2018-11-09 22:20:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:37,976 INFO L93 Difference]: Finished difference Result 697 states and 1085 transitions. [2018-11-09 22:20:37,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:37,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-09 22:20:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:37,978 INFO L225 Difference]: With dead ends: 697 [2018-11-09 22:20:37,978 INFO L226 Difference]: Without dead ends: 475 [2018-11-09 22:20:37,978 INFO L605 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-09 22:20:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-11-09 22:20:37,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 473. [2018-11-09 22:20:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-11-09 22:20:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 727 transitions. [2018-11-09 22:20:37,987 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 727 transitions. Word has length 24 [2018-11-09 22:20:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:37,988 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 727 transitions. [2018-11-09 22:20:37,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 727 transitions. [2018-11-09 22:20:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-09 22:20:37,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:37,989 INFO L375 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, 1] [2018-11-09 22:20:37,989 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:37,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:37,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1865880063, now seen corresponding path program 1 times [2018-11-09 22:20:37,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:37,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:37,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:37,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:38,006 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-09 22:20:38,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:38,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:38,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:38,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:38,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:38,007 INFO L87 Difference]: Start difference. First operand 473 states and 727 transitions. Second operand 3 states. [2018-11-09 22:20:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:38,029 INFO L93 Difference]: Finished difference Result 1357 states and 2073 transitions. [2018-11-09 22:20:38,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:38,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-09 22:20:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:38,031 INFO L225 Difference]: With dead ends: 1357 [2018-11-09 22:20:38,031 INFO L226 Difference]: Without dead ends: 907 [2018-11-09 22:20:38,032 INFO L605 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-09 22:20:38,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-11-09 22:20:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 905. [2018-11-09 22:20:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-11-09 22:20:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1351 transitions. [2018-11-09 22:20:38,049 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1351 transitions. Word has length 24 [2018-11-09 22:20:38,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:38,049 INFO L481 AbstractCegarLoop]: Abstraction has 905 states and 1351 transitions. [2018-11-09 22:20:38,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1351 transitions. [2018-11-09 22:20:38,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-09 22:20:38,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:38,051 INFO L375 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, 1] [2018-11-09 22:20:38,051 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:38,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:38,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1607714625, now seen corresponding path program 1 times [2018-11-09 22:20:38,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:38,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:38,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:38,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:38,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:38,069 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-09 22:20:38,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:38,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:38,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:38,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:38,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:38,070 INFO L87 Difference]: Start difference. First operand 905 states and 1351 transitions. Second operand 3 states. [2018-11-09 22:20:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:38,104 INFO L93 Difference]: Finished difference Result 1085 states and 1657 transitions. [2018-11-09 22:20:38,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:38,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-09 22:20:38,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:38,108 INFO L225 Difference]: With dead ends: 1085 [2018-11-09 22:20:38,108 INFO L226 Difference]: Without dead ends: 1083 [2018-11-09 22:20:38,109 INFO L605 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-09 22:20:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-11-09 22:20:38,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 905. [2018-11-09 22:20:38,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-11-09 22:20:38,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1335 transitions. [2018-11-09 22:20:38,136 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1335 transitions. Word has length 24 [2018-11-09 22:20:38,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:38,137 INFO L481 AbstractCegarLoop]: Abstraction has 905 states and 1335 transitions. [2018-11-09 22:20:38,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1335 transitions. [2018-11-09 22:20:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-09 22:20:38,138 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:38,138 INFO L375 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, 1, 1] [2018-11-09 22:20:38,138 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:38,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:38,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2007922174, now seen corresponding path program 1 times [2018-11-09 22:20:38,139 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:38,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:38,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:38,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:38,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:38,169 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-09 22:20:38,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:38,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:38,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:38,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:38,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:38,171 INFO L87 Difference]: Start difference. First operand 905 states and 1335 transitions. Second operand 3 states. [2018-11-09 22:20:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:38,202 INFO L93 Difference]: Finished difference Result 1597 states and 2393 transitions. [2018-11-09 22:20:38,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:38,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-09 22:20:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:38,207 INFO L225 Difference]: With dead ends: 1597 [2018-11-09 22:20:38,207 INFO L226 Difference]: Without dead ends: 1595 [2018-11-09 22:20:38,208 INFO L605 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-09 22:20:38,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-11-09 22:20:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1305. [2018-11-09 22:20:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2018-11-09 22:20:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1879 transitions. [2018-11-09 22:20:38,248 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1879 transitions. Word has length 25 [2018-11-09 22:20:38,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:38,248 INFO L481 AbstractCegarLoop]: Abstraction has 1305 states and 1879 transitions. [2018-11-09 22:20:38,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1879 transitions. [2018-11-09 22:20:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-09 22:20:38,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:38,250 INFO L375 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, 1, 1] [2018-11-09 22:20:38,251 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:38,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:38,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2028879684, now seen corresponding path program 1 times [2018-11-09 22:20:38,251 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:38,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:38,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:38,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:38,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:38,265 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-09 22:20:38,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:38,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:38,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:38,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:38,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:38,266 INFO L87 Difference]: Start difference. First operand 1305 states and 1879 transitions. Second operand 3 states. [2018-11-09 22:20:38,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:38,310 INFO L93 Difference]: Finished difference Result 3037 states and 4377 transitions. [2018-11-09 22:20:38,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:38,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-09 22:20:38,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:38,316 INFO L225 Difference]: With dead ends: 3037 [2018-11-09 22:20:38,316 INFO L226 Difference]: Without dead ends: 1755 [2018-11-09 22:20:38,318 INFO L605 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-09 22:20:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2018-11-09 22:20:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1753. [2018-11-09 22:20:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2018-11-09 22:20:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2471 transitions. [2018-11-09 22:20:38,372 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2471 transitions. Word has length 25 [2018-11-09 22:20:38,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:38,372 INFO L481 AbstractCegarLoop]: Abstraction has 1753 states and 2471 transitions. [2018-11-09 22:20:38,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2471 transitions. [2018-11-09 22:20:38,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-09 22:20:38,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:38,374 INFO L375 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, 1, 1, 1] [2018-11-09 22:20:38,374 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:38,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:38,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2116260660, now seen corresponding path program 1 times [2018-11-09 22:20:38,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:38,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:38,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:38,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:38,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:38,393 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-09 22:20:38,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:38,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:38,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:38,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:38,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:38,394 INFO L87 Difference]: Start difference. First operand 1753 states and 2471 transitions. Second operand 3 states. [2018-11-09 22:20:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:38,431 INFO L93 Difference]: Finished difference Result 2653 states and 3737 transitions. [2018-11-09 22:20:38,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:38,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-09 22:20:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:38,435 INFO L225 Difference]: With dead ends: 2653 [2018-11-09 22:20:38,436 INFO L226 Difference]: Without dead ends: 1803 [2018-11-09 22:20:38,437 INFO L605 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-09 22:20:38,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2018-11-09 22:20:38,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1801. [2018-11-09 22:20:38,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1801 states. [2018-11-09 22:20:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2503 transitions. [2018-11-09 22:20:38,491 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2503 transitions. Word has length 26 [2018-11-09 22:20:38,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:38,491 INFO L481 AbstractCegarLoop]: Abstraction has 1801 states and 2503 transitions. [2018-11-09 22:20:38,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2503 transitions. [2018-11-09 22:20:38,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-09 22:20:38,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:38,493 INFO L375 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, 1, 1, 1] [2018-11-09 22:20:38,494 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:38,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:38,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1529454646, now seen corresponding path program 1 times [2018-11-09 22:20:38,494 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:38,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:38,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:38,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:38,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:38,521 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-09 22:20:38,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:38,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:38,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:38,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:38,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:38,523 INFO L87 Difference]: Start difference. First operand 1801 states and 2503 transitions. Second operand 3 states. [2018-11-09 22:20:38,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:38,590 INFO L93 Difference]: Finished difference Result 3085 states and 4329 transitions. [2018-11-09 22:20:38,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:38,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-09 22:20:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:38,600 INFO L225 Difference]: With dead ends: 3085 [2018-11-09 22:20:38,601 INFO L226 Difference]: Without dead ends: 3083 [2018-11-09 22:20:38,602 INFO L605 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-09 22:20:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2018-11-09 22:20:38,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 2633. [2018-11-09 22:20:38,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2633 states. [2018-11-09 22:20:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3559 transitions. [2018-11-09 22:20:38,680 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3559 transitions. Word has length 26 [2018-11-09 22:20:38,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:38,680 INFO L481 AbstractCegarLoop]: Abstraction has 2633 states and 3559 transitions. [2018-11-09 22:20:38,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3559 transitions. [2018-11-09 22:20:38,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-09 22:20:38,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:38,683 INFO L375 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, 1, 1, 1] [2018-11-09 22:20:38,683 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:38,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:38,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1787620084, now seen corresponding path program 1 times [2018-11-09 22:20:38,686 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:38,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:38,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:38,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:38,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:38,700 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-09 22:20:38,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:38,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:38,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:38,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:38,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:38,701 INFO L87 Difference]: Start difference. First operand 2633 states and 3559 transitions. Second operand 3 states. [2018-11-09 22:20:38,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:38,785 INFO L93 Difference]: Finished difference Result 6029 states and 8105 transitions. [2018-11-09 22:20:38,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:38,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-09 22:20:38,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:38,794 INFO L225 Difference]: With dead ends: 6029 [2018-11-09 22:20:38,794 INFO L226 Difference]: Without dead ends: 3467 [2018-11-09 22:20:38,798 INFO L605 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-09 22:20:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2018-11-09 22:20:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 3465. [2018-11-09 22:20:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3465 states. [2018-11-09 22:20:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 4551 transitions. [2018-11-09 22:20:38,892 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 4551 transitions. Word has length 26 [2018-11-09 22:20:38,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:38,892 INFO L481 AbstractCegarLoop]: Abstraction has 3465 states and 4551 transitions. [2018-11-09 22:20:38,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:38,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 4551 transitions. [2018-11-09 22:20:38,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-09 22:20:38,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:38,895 INFO L375 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, 1, 1, 1, 1] [2018-11-09 22:20:38,895 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:38,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:38,896 INFO L82 PathProgramCache]: Analyzing trace with hash 168669521, now seen corresponding path program 1 times [2018-11-09 22:20:38,896 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:38,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:38,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:38,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:38,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:38,909 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-09 22:20:38,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:38,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:38,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:38,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:38,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:38,910 INFO L87 Difference]: Start difference. First operand 3465 states and 4551 transitions. Second operand 3 states. [2018-11-09 22:20:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:38,983 INFO L93 Difference]: Finished difference Result 5197 states and 6793 transitions. [2018-11-09 22:20:38,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:38,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-09 22:20:38,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:38,992 INFO L225 Difference]: With dead ends: 5197 [2018-11-09 22:20:38,992 INFO L226 Difference]: Without dead ends: 3531 [2018-11-09 22:20:38,995 INFO L605 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-09 22:20:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3531 states. [2018-11-09 22:20:39,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3531 to 3529. [2018-11-09 22:20:39,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3529 states. [2018-11-09 22:20:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 4551 transitions. [2018-11-09 22:20:39,088 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 4551 transitions. Word has length 27 [2018-11-09 22:20:39,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:39,089 INFO L481 AbstractCegarLoop]: Abstraction has 3529 states and 4551 transitions. [2018-11-09 22:20:39,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 4551 transitions. [2018-11-09 22:20:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-09 22:20:39,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:39,092 INFO L375 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, 1, 1, 1, 1] [2018-11-09 22:20:39,092 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:39,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:39,092 INFO L82 PathProgramCache]: Analyzing trace with hash -418136493, now seen corresponding path program 1 times [2018-11-09 22:20:39,092 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:39,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:39,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:39,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:39,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:39,106 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-09 22:20:39,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:39,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:39,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:39,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:39,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:39,107 INFO L87 Difference]: Start difference. First operand 3529 states and 4551 transitions. Second operand 3 states. [2018-11-09 22:20:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:39,214 INFO L93 Difference]: Finished difference Result 5901 states and 7625 transitions. [2018-11-09 22:20:39,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:39,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-09 22:20:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:39,228 INFO L225 Difference]: With dead ends: 5901 [2018-11-09 22:20:39,229 INFO L226 Difference]: Without dead ends: 5899 [2018-11-09 22:20:39,230 INFO L605 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-09 22:20:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2018-11-09 22:20:39,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 5257. [2018-11-09 22:20:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5257 states. [2018-11-09 22:20:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 6599 transitions. [2018-11-09 22:20:39,345 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 6599 transitions. Word has length 27 [2018-11-09 22:20:39,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:39,345 INFO L481 AbstractCegarLoop]: Abstraction has 5257 states and 6599 transitions. [2018-11-09 22:20:39,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 6599 transitions. [2018-11-09 22:20:39,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-09 22:20:39,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:39,351 INFO L375 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, 1, 1, 1, 1] [2018-11-09 22:20:39,351 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:39,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:39,351 INFO L82 PathProgramCache]: Analyzing trace with hash -159971055, now seen corresponding path program 1 times [2018-11-09 22:20:39,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:39,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:39,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:39,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:39,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:39,365 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-09 22:20:39,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:39,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:39,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:39,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:39,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:39,366 INFO L87 Difference]: Start difference. First operand 5257 states and 6599 transitions. Second operand 3 states. [2018-11-09 22:20:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:39,480 INFO L93 Difference]: Finished difference Result 11917 states and 14793 transitions. [2018-11-09 22:20:39,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:39,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-09 22:20:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:39,490 INFO L225 Difference]: With dead ends: 11917 [2018-11-09 22:20:39,490 INFO L226 Difference]: Without dead ends: 6795 [2018-11-09 22:20:39,497 INFO L605 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-09 22:20:39,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6795 states. [2018-11-09 22:20:39,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6795 to 6793. [2018-11-09 22:20:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6793 states. [2018-11-09 22:20:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 8199 transitions. [2018-11-09 22:20:39,682 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 8199 transitions. Word has length 27 [2018-11-09 22:20:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:39,682 INFO L481 AbstractCegarLoop]: Abstraction has 6793 states and 8199 transitions. [2018-11-09 22:20:39,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 8199 transitions. [2018-11-09 22:20:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-09 22:20:39,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:39,689 INFO L375 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, 1, 1, 1, 1, 1] [2018-11-09 22:20:39,690 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:39,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:39,690 INFO L82 PathProgramCache]: Analyzing trace with hash -77113303, now seen corresponding path program 1 times [2018-11-09 22:20:39,690 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:39,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:39,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:39,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:39,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:39,705 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-09 22:20:39,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:39,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:39,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:39,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:39,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:39,706 INFO L87 Difference]: Start difference. First operand 6793 states and 8199 transitions. Second operand 3 states. [2018-11-09 22:20:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:39,842 INFO L93 Difference]: Finished difference Result 10189 states and 12233 transitions. [2018-11-09 22:20:39,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:39,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-09 22:20:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:39,852 INFO L225 Difference]: With dead ends: 10189 [2018-11-09 22:20:39,852 INFO L226 Difference]: Without dead ends: 6923 [2018-11-09 22:20:39,857 INFO L605 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-09 22:20:39,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6923 states. [2018-11-09 22:20:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6923 to 6921. [2018-11-09 22:20:39,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6921 states. [2018-11-09 22:20:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6921 states to 6921 states and 8199 transitions. [2018-11-09 22:20:40,009 INFO L78 Accepts]: Start accepts. Automaton has 6921 states and 8199 transitions. Word has length 28 [2018-11-09 22:20:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:40,009 INFO L481 AbstractCegarLoop]: Abstraction has 6921 states and 8199 transitions. [2018-11-09 22:20:40,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 6921 states and 8199 transitions. [2018-11-09 22:20:40,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-09 22:20:40,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:40,015 INFO L375 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, 1, 1, 1, 1, 1] [2018-11-09 22:20:40,015 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:40,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:40,015 INFO L82 PathProgramCache]: Analyzing trace with hash -663919317, now seen corresponding path program 1 times [2018-11-09 22:20:40,015 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:40,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:40,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:40,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:40,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:40,037 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-09 22:20:40,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:40,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:40,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:40,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:40,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:40,038 INFO L87 Difference]: Start difference. First operand 6921 states and 8199 transitions. Second operand 3 states. [2018-11-09 22:20:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:40,217 INFO L93 Difference]: Finished difference Result 11275 states and 13192 transitions. [2018-11-09 22:20:40,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:40,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-09 22:20:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:40,232 INFO L225 Difference]: With dead ends: 11275 [2018-11-09 22:20:40,232 INFO L226 Difference]: Without dead ends: 11273 [2018-11-09 22:20:40,235 INFO L605 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-09 22:20:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11273 states. [2018-11-09 22:20:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11273 to 10505. [2018-11-09 22:20:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10505 states. [2018-11-09 22:20:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10505 states to 10505 states and 12167 transitions. [2018-11-09 22:20:40,449 INFO L78 Accepts]: Start accepts. Automaton has 10505 states and 12167 transitions. Word has length 28 [2018-11-09 22:20:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:40,450 INFO L481 AbstractCegarLoop]: Abstraction has 10505 states and 12167 transitions. [2018-11-09 22:20:40,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 10505 states and 12167 transitions. [2018-11-09 22:20:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-09 22:20:40,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:20:40,461 INFO L375 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, 1, 1, 1, 1, 1] [2018-11-09 22:20:40,461 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:20:40,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:20:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash -405753879, now seen corresponding path program 1 times [2018-11-09 22:20:40,461 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:20:40,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:20:40,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:40,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:20:40,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:20:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:20:40,477 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-09 22:20:40,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:20:40,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:20:40,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:20:40,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:20:40,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:20:40,478 INFO L87 Difference]: Start difference. First operand 10505 states and 12167 transitions. Second operand 3 states. [2018-11-09 22:20:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:20:40,681 INFO L93 Difference]: Finished difference Result 23561 states and 26759 transitions. [2018-11-09 22:20:40,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:20:40,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-09 22:20:40,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:20:40,681 INFO L225 Difference]: With dead ends: 23561 [2018-11-09 22:20:40,682 INFO L226 Difference]: Without dead ends: 0 [2018-11-09 22:20:40,708 INFO L605 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-09 22:20:40,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-09 22:20:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-09 22:20:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-09 22:20:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-09 22:20:40,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-11-09 22:20:40,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:20:40,710 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:20:40,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:20:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-09 22:20:40,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-09 22:20:40,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-09 22:20:40,750 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-09 22:20:40,751 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-09 22:20:40,751 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-09 22:20:40,751 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-09 22:20:40,751 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-09 22:20:40,751 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-09 22:20:40,751 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,751 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2018-11-09 22:20:40,751 INFO L425 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,751 INFO L425 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-09 22:20:40,751 INFO L425 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,752 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-09 22:20:40,752 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,752 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,752 INFO L425 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2018-11-09 22:20:40,752 INFO L425 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,752 INFO L425 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,752 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-09 22:20:40,752 INFO L428 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2018-11-09 22:20:40,752 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2018-11-09 22:20:40,752 INFO L425 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,752 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-11-09 22:20:40,753 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,753 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2018-11-09 22:20:40,753 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-09 22:20:40,753 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-09 22:20:40,753 INFO L425 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,753 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,753 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,753 INFO L428 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2018-11-09 22:20:40,753 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2018-11-09 22:20:40,753 INFO L425 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,754 INFO L425 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,754 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-09 22:20:40,754 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-09 22:20:40,754 INFO L421 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2018-11-09 22:20:40,754 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,754 INFO L425 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,754 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-09 22:20:40,754 INFO L425 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-11-09 22:20:40,754 INFO L425 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,754 INFO L425 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2018-11-09 22:20:40,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:20:40 BoogieIcfgContainer [2018-11-09 22:20:40,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-09 22:20:40,761 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 22:20:40,761 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 22:20:40,761 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 22:20:40,762 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:20:36" (3/4) ... [2018-11-09 22:20:40,765 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-09 22:20:40,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-09 22:20:40,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-09 22:20:40,776 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-09 22:20:40,776 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-09 22:20:40,776 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-09 22:20:40,825 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_db4c0613-1d67-4cd7-855e-d1a184d49c49/bin-2019/uautomizer/witness.graphml [2018-11-09 22:20:40,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 22:20:40,826 INFO L168 Benchmark]: Toolchain (without parser) took 4301.78 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.5 MB). Free memory was 960.2 MB in the beginning and 865.6 MB in the end (delta: 94.6 MB). Peak memory consumption was 418.1 MB. Max. memory is 11.5 GB. [2018-11-09 22:20:40,827 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:20:40,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.54 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-09 22:20:40,827 INFO L168 Benchmark]: Boogie Preprocessor took 18.71 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-09 22:20:40,827 INFO L168 Benchmark]: RCFGBuilder took 268.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-09 22:20:40,828 INFO L168 Benchmark]: TraceAbstraction took 3794.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 867.7 MB in the end (delta: 241.0 MB). Peak memory consumption was 432.9 MB. Max. memory is 11.5 GB. [2018-11-09 22:20:40,828 INFO L168 Benchmark]: Witness Printer took 64.37 ms. Allocated memory is still 1.4 GB. Free memory was 867.7 MB in the beginning and 865.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2018-11-09 22:20:40,829 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.54 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.71 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 268.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3794.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 867.7 MB in the end (delta: 241.0 MB). Peak memory consumption was 432.9 MB. Max. memory is 11.5 GB. * Witness Printer took 64.37 ms. Allocated memory is still 1.4 GB. Free memory was 867.7 MB in the beginning and 865.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 1 error locations. SAFE Result, 3.7s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1990 SDtfs, 948 SDslu, 1336 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10505occurred in iteration=24, 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: 1.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 2583 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 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, 0.4s InterpolantComputationTime, 603 NumberOfCodeBlocks, 603 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 25820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...