./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bf2d7b05-afaa-4f75-b413-900bfe684dac/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bf2d7b05-afaa-4f75-b413-900bfe684dac/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bf2d7b05-afaa-4f75-b413-900bfe684dac/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bf2d7b05-afaa-4f75-b413-900bfe684dac/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bf2d7b05-afaa-4f75-b413-900bfe684dac/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bf2d7b05-afaa-4f75-b413-900bfe684dac/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 ccd6d122756047ddb1225c106ac06a6748e14c22 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:46:49,314 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:46:49,315 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:46:49,324 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:46:49,324 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:46:49,325 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:46:49,325 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:46:49,327 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:46:49,328 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:46:49,328 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:46:49,329 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:46:49,329 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:46:49,330 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:46:49,331 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:46:49,331 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:46:49,332 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:46:49,332 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:46:49,334 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:46:49,335 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:46:49,336 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:46:49,337 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:46:49,338 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:46:49,340 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:46:49,340 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:46:49,340 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:46:49,341 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:46:49,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:46:49,342 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:46:49,343 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:46:49,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:46:49,344 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:46:49,344 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:46:49,344 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:46:49,344 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:46:49,345 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:46:49,346 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:46:49,346 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bf2d7b05-afaa-4f75-b413-900bfe684dac/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 11:46:49,356 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:46:49,356 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:46:49,356 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:46:49,356 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 11:46:49,357 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:46:49,357 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:46:49,357 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:46:49,357 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:46:49,357 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:46:49,358 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:46:49,358 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:46:49,358 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:46:49,358 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:46:49,358 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:46:49,358 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:46:49,359 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:46:49,359 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:46:49,359 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:46:49,359 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:46:49,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:46:49,359 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:46:49,360 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:46:49,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:46:49,360 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:46:49,360 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:46:49,360 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:46:49,360 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:46:49,360 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:46:49,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:46:49,361 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_bf2d7b05-afaa-4f75-b413-900bfe684dac/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 -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2018-11-10 11:46:49,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:46:49,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:46:49,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:46:49,391 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:46:49,391 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:46:49,392 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bf2d7b05-afaa-4f75-b413-900bfe684dac/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 11:46:49,433 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bf2d7b05-afaa-4f75-b413-900bfe684dac/bin-2019/uautomizer/data/97ad4e598/bf16a073cf464050af8f57e665c98ac4/FLAG5c1752da0 [2018-11-10 11:46:49,728 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:46:49,729 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bf2d7b05-afaa-4f75-b413-900bfe684dac/sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 11:46:49,734 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bf2d7b05-afaa-4f75-b413-900bfe684dac/bin-2019/uautomizer/data/97ad4e598/bf16a073cf464050af8f57e665c98ac4/FLAG5c1752da0 [2018-11-10 11:46:49,742 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bf2d7b05-afaa-4f75-b413-900bfe684dac/bin-2019/uautomizer/data/97ad4e598/bf16a073cf464050af8f57e665c98ac4 [2018-11-10 11:46:49,744 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:46:49,745 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 11:46:49,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:46:49,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:46:49,748 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:46:49,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:46:49" (1/1) ... [2018-11-10 11:46:49,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:49, skipping insertion in model container [2018-11-10 11:46:49,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:46:49" (1/1) ... [2018-11-10 11:46:49,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:46:49,766 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:46:49,863 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:46:49,865 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:46:49,878 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:46:49,886 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:46:49,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:49 WrapperNode [2018-11-10 11:46:49,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:46:49,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:46:49,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:46:49,887 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:46:49,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:49" (1/1) ... [2018-11-10 11:46:49,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:49" (1/1) ... [2018-11-10 11:46:49,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:49" (1/1) ... [2018-11-10 11:46:49,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:49" (1/1) ... [2018-11-10 11:46:49,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:49" (1/1) ... [2018-11-10 11:46:49,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:49" (1/1) ... [2018-11-10 11:46:49,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:49" (1/1) ... [2018-11-10 11:46:49,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:46:49,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:46:49,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:46:49,909 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:46:49,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bf2d7b05-afaa-4f75-b413-900bfe684dac/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-10 11:46:49,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:46:49,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:46:49,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:46:49,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 11:46:49,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 11:46:49,989 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:46:49,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:46:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:46:50,164 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:46:50,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:46:50 BoogieIcfgContainer [2018-11-10 11:46:50,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:46:50,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:46:50,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:46:50,168 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:46:50,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:46:49" (1/3) ... [2018-11-10 11:46:50,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42990e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:46:50, skipping insertion in model container [2018-11-10 11:46:50,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:49" (2/3) ... [2018-11-10 11:46:50,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42990e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:46:50, skipping insertion in model container [2018-11-10 11:46:50,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:46:50" (3/3) ... [2018-11-10 11:46:50,171 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 11:46:50,177 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:46:50,182 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 11:46:50,195 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 11:46:50,215 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:46:50,215 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:46:50,215 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:46:50,216 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:46:50,216 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:46:50,216 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:46:50,216 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:46:50,216 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:46:50,216 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:46:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-10 11:46:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 11:46:50,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:50,237 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:50,238 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:50,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:50,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1900455195, now seen corresponding path program 1 times [2018-11-10 11:46:50,245 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:50,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:50,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:50,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:50,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-10 11:46:50,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:50,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:50,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:50,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:50,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:50,382 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-11-10 11:46:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:50,418 INFO L93 Difference]: Finished difference Result 71 states and 116 transitions. [2018-11-10 11:46:50,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:50,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-10 11:46:50,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:50,426 INFO L225 Difference]: With dead ends: 71 [2018-11-10 11:46:50,426 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 11:46:50,428 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-10 11:46:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 11:46:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2018-11-10 11:46:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 11:46:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2018-11-10 11:46:50,454 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 18 [2018-11-10 11:46:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:50,454 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2018-11-10 11:46:50,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2018-11-10 11:46:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 11:46:50,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:50,455 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:50,455 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:50,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:50,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1507428185, now seen corresponding path program 1 times [2018-11-10 11:46:50,456 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:50,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:50,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:50,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:50,488 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-10 11:46:50,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:50,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:50,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:50,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:50,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:50,490 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 3 states. [2018-11-10 11:46:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:50,509 INFO L93 Difference]: Finished difference Result 90 states and 155 transitions. [2018-11-10 11:46:50,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:50,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-10 11:46:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:50,511 INFO L225 Difference]: With dead ends: 90 [2018-11-10 11:46:50,511 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 11:46:50,511 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-10 11:46:50,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 11:46:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-10 11:46:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 11:46:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 91 transitions. [2018-11-10 11:46:50,516 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 91 transitions. Word has length 18 [2018-11-10 11:46:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:50,517 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 91 transitions. [2018-11-10 11:46:50,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 91 transitions. [2018-11-10 11:46:50,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 11:46:50,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:50,518 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:50,518 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:50,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:50,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1215216746, now seen corresponding path program 1 times [2018-11-10 11:46:50,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:50,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:50,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:50,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:50,546 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-10 11:46:50,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:50,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:50,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:50,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:50,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:50,548 INFO L87 Difference]: Start difference. First operand 54 states and 91 transitions. Second operand 3 states. [2018-11-10 11:46:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:50,571 INFO L93 Difference]: Finished difference Result 85 states and 139 transitions. [2018-11-10 11:46:50,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:50,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 11:46:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:50,572 INFO L225 Difference]: With dead ends: 85 [2018-11-10 11:46:50,572 INFO L226 Difference]: Without dead ends: 60 [2018-11-10 11:46:50,572 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-10 11:46:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-10 11:46:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-10 11:46:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 11:46:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 94 transitions. [2018-11-10 11:46:50,577 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 94 transitions. Word has length 19 [2018-11-10 11:46:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:50,577 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 94 transitions. [2018-11-10 11:46:50,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 94 transitions. [2018-11-10 11:46:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 11:46:50,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:50,577 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:50,577 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:50,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:50,578 INFO L82 PathProgramCache]: Analyzing trace with hash -514152168, now seen corresponding path program 1 times [2018-11-10 11:46:50,578 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:50,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:50,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:50,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:50,599 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-10 11:46:50,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:50,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:50,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:50,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:50,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:50,600 INFO L87 Difference]: Start difference. First operand 58 states and 94 transitions. Second operand 3 states. [2018-11-10 11:46:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:50,616 INFO L93 Difference]: Finished difference Result 105 states and 173 transitions. [2018-11-10 11:46:50,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:50,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 11:46:50,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:50,617 INFO L225 Difference]: With dead ends: 105 [2018-11-10 11:46:50,618 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 11:46:50,618 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-10 11:46:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 11:46:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2018-11-10 11:46:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 11:46:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 123 transitions. [2018-11-10 11:46:50,623 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 123 transitions. Word has length 19 [2018-11-10 11:46:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:50,623 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 123 transitions. [2018-11-10 11:46:50,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:50,623 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 123 transitions. [2018-11-10 11:46:50,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 11:46:50,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:50,624 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:50,624 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:50,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:50,624 INFO L82 PathProgramCache]: Analyzing trace with hash -907179178, now seen corresponding path program 1 times [2018-11-10 11:46:50,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:50,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:50,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:50,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:50,644 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-10 11:46:50,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:50,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:50,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:50,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:50,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:50,645 INFO L87 Difference]: Start difference. First operand 75 states and 123 transitions. Second operand 3 states. [2018-11-10 11:46:50,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:50,675 INFO L93 Difference]: Finished difference Result 171 states and 285 transitions. [2018-11-10 11:46:50,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:50,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 11:46:50,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:50,677 INFO L225 Difference]: With dead ends: 171 [2018-11-10 11:46:50,677 INFO L226 Difference]: Without dead ends: 105 [2018-11-10 11:46:50,677 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-10 11:46:50,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-10 11:46:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-10 11:46:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 11:46:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 167 transitions. [2018-11-10 11:46:50,685 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 167 transitions. Word has length 19 [2018-11-10 11:46:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:50,685 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 167 transitions. [2018-11-10 11:46:50,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 167 transitions. [2018-11-10 11:46:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 11:46:50,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:50,686 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-10 11:46:50,687 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:50,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:50,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1241366670, now seen corresponding path program 1 times [2018-11-10 11:46:50,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:50,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:50,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:50,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:50,715 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-10 11:46:50,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:50,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:50,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:50,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:50,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:50,716 INFO L87 Difference]: Start difference. First operand 103 states and 167 transitions. Second operand 3 states. [2018-11-10 11:46:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:50,725 INFO L93 Difference]: Finished difference Result 154 states and 248 transitions. [2018-11-10 11:46:50,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:50,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 11:46:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:50,726 INFO L225 Difference]: With dead ends: 154 [2018-11-10 11:46:50,726 INFO L226 Difference]: Without dead ends: 107 [2018-11-10 11:46:50,727 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-10 11:46:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-10 11:46:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-11-10 11:46:50,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 11:46:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 167 transitions. [2018-11-10 11:46:50,733 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 167 transitions. Word has length 20 [2018-11-10 11:46:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:50,733 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 167 transitions. [2018-11-10 11:46:50,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 167 transitions. [2018-11-10 11:46:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 11:46:50,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:50,734 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-10 11:46:50,735 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:50,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:50,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1942431248, now seen corresponding path program 1 times [2018-11-10 11:46:50,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:50,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:50,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:50,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:50,751 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-10 11:46:50,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:50,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:50,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:50,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:50,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:50,752 INFO L87 Difference]: Start difference. First operand 105 states and 167 transitions. Second operand 3 states. [2018-11-10 11:46:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:50,768 INFO L93 Difference]: Finished difference Result 189 states and 305 transitions. [2018-11-10 11:46:50,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:50,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 11:46:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:50,769 INFO L225 Difference]: With dead ends: 189 [2018-11-10 11:46:50,769 INFO L226 Difference]: Without dead ends: 187 [2018-11-10 11:46:50,769 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-10 11:46:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-10 11:46:50,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 141. [2018-11-10 11:46:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-10 11:46:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 223 transitions. [2018-11-10 11:46:50,778 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 223 transitions. Word has length 20 [2018-11-10 11:46:50,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:50,778 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 223 transitions. [2018-11-10 11:46:50,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:50,778 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 223 transitions. [2018-11-10 11:46:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 11:46:50,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:50,779 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-10 11:46:50,779 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:50,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:50,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1549404238, now seen corresponding path program 1 times [2018-11-10 11:46:50,780 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:50,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:50,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:50,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:50,815 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-10 11:46:50,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:50,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:50,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:50,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:50,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:50,817 INFO L87 Difference]: Start difference. First operand 141 states and 223 transitions. Second operand 3 states. [2018-11-10 11:46:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:50,848 INFO L93 Difference]: Finished difference Result 325 states and 517 transitions. [2018-11-10 11:46:50,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:50,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 11:46:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:50,849 INFO L225 Difference]: With dead ends: 325 [2018-11-10 11:46:50,849 INFO L226 Difference]: Without dead ends: 195 [2018-11-10 11:46:50,850 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-10 11:46:50,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-10 11:46:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2018-11-10 11:46:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-10 11:46:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 299 transitions. [2018-11-10 11:46:50,859 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 299 transitions. Word has length 20 [2018-11-10 11:46:50,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:50,860 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 299 transitions. [2018-11-10 11:46:50,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:50,860 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 299 transitions. [2018-11-10 11:46:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 11:46:50,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:50,861 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-10 11:46:50,861 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:50,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:50,861 INFO L82 PathProgramCache]: Analyzing trace with hash 86041579, now seen corresponding path program 1 times [2018-11-10 11:46:50,862 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:50,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:50,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:50,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:50,885 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-10 11:46:50,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:50,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:50,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:50,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:50,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:50,886 INFO L87 Difference]: Start difference. First operand 193 states and 299 transitions. Second operand 3 states. [2018-11-10 11:46:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:50,911 INFO L93 Difference]: Finished difference Result 289 states and 445 transitions. [2018-11-10 11:46:50,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:50,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 11:46:50,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:50,912 INFO L225 Difference]: With dead ends: 289 [2018-11-10 11:46:50,912 INFO L226 Difference]: Without dead ends: 199 [2018-11-10 11:46:50,913 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-10 11:46:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-10 11:46:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2018-11-10 11:46:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-10 11:46:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 299 transitions. [2018-11-10 11:46:50,920 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 299 transitions. Word has length 21 [2018-11-10 11:46:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:50,920 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 299 transitions. [2018-11-10 11:46:50,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 299 transitions. [2018-11-10 11:46:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 11:46:50,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:50,922 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-10 11:46:50,922 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:50,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:50,922 INFO L82 PathProgramCache]: Analyzing trace with hash 787106157, now seen corresponding path program 1 times [2018-11-10 11:46:50,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:50,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:50,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:50,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:50,940 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-10 11:46:50,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:50,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:50,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:50,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:50,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:50,941 INFO L87 Difference]: Start difference. First operand 197 states and 299 transitions. Second operand 3 states. [2018-11-10 11:46:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:50,953 INFO L93 Difference]: Finished difference Result 349 states and 537 transitions. [2018-11-10 11:46:50,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:50,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 11:46:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:50,955 INFO L225 Difference]: With dead ends: 349 [2018-11-10 11:46:50,955 INFO L226 Difference]: Without dead ends: 347 [2018-11-10 11:46:50,955 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-10 11:46:50,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-10 11:46:50,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 273. [2018-11-10 11:46:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-10 11:46:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 407 transitions. [2018-11-10 11:46:50,963 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 407 transitions. Word has length 21 [2018-11-10 11:46:50,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:50,963 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 407 transitions. [2018-11-10 11:46:50,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 407 transitions. [2018-11-10 11:46:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 11:46:50,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:50,964 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-10 11:46:50,965 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:50,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:50,965 INFO L82 PathProgramCache]: Analyzing trace with hash 394079147, now seen corresponding path program 1 times [2018-11-10 11:46:50,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:50,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:50,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:50,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:50,984 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-10 11:46:50,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:50,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:50,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:50,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:50,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:50,985 INFO L87 Difference]: Start difference. First operand 273 states and 407 transitions. Second operand 3 states. [2018-11-10 11:46:51,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:51,010 INFO L93 Difference]: Finished difference Result 629 states and 937 transitions. [2018-11-10 11:46:51,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:51,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 11:46:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:51,012 INFO L225 Difference]: With dead ends: 629 [2018-11-10 11:46:51,012 INFO L226 Difference]: Without dead ends: 371 [2018-11-10 11:46:51,013 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-10 11:46:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-11-10 11:46:51,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2018-11-10 11:46:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-10 11:46:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 535 transitions. [2018-11-10 11:46:51,025 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 535 transitions. Word has length 21 [2018-11-10 11:46:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:51,025 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 535 transitions. [2018-11-10 11:46:51,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 535 transitions. [2018-11-10 11:46:51,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 11:46:51,026 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:51,026 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-10 11:46:51,027 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:51,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:51,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1369297533, now seen corresponding path program 1 times [2018-11-10 11:46:51,027 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:51,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:51,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:51,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:51,043 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-10 11:46:51,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:51,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:51,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:51,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:51,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:51,044 INFO L87 Difference]: Start difference. First operand 369 states and 535 transitions. Second operand 3 states. [2018-11-10 11:46:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:51,061 INFO L93 Difference]: Finished difference Result 553 states and 797 transitions. [2018-11-10 11:46:51,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:51,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 11:46:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:51,062 INFO L225 Difference]: With dead ends: 553 [2018-11-10 11:46:51,063 INFO L226 Difference]: Without dead ends: 379 [2018-11-10 11:46:51,063 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-10 11:46:51,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-10 11:46:51,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2018-11-10 11:46:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-11-10 11:46:51,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 535 transitions. [2018-11-10 11:46:51,074 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 535 transitions. Word has length 22 [2018-11-10 11:46:51,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:51,075 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 535 transitions. [2018-11-10 11:46:51,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 535 transitions. [2018-11-10 11:46:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 11:46:51,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:51,076 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-10 11:46:51,076 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:51,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:51,076 INFO L82 PathProgramCache]: Analyzing trace with hash -668232955, now seen corresponding path program 1 times [2018-11-10 11:46:51,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:51,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:51,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:51,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:51,112 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-10 11:46:51,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:51,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:51,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:51,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:51,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:51,113 INFO L87 Difference]: Start difference. First operand 377 states and 535 transitions. Second operand 3 states. [2018-11-10 11:46:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:51,158 INFO L93 Difference]: Finished difference Result 1069 states and 1497 transitions. [2018-11-10 11:46:51,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:51,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 11:46:51,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:51,160 INFO L225 Difference]: With dead ends: 1069 [2018-11-10 11:46:51,161 INFO L226 Difference]: Without dead ends: 715 [2018-11-10 11:46:51,161 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-10 11:46:51,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-11-10 11:46:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 713. [2018-11-10 11:46:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-10 11:46:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 967 transitions. [2018-11-10 11:46:51,185 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 967 transitions. Word has length 22 [2018-11-10 11:46:51,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:51,185 INFO L481 AbstractCegarLoop]: Abstraction has 713 states and 967 transitions. [2018-11-10 11:46:51,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 967 transitions. [2018-11-10 11:46:51,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 11:46:51,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:51,187 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-10 11:46:51,187 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:51,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:51,187 INFO L82 PathProgramCache]: Analyzing trace with hash -275205945, now seen corresponding path program 1 times [2018-11-10 11:46:51,187 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:51,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:51,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:51,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:51,204 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-10 11:46:51,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:51,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:51,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:51,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:51,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:51,205 INFO L87 Difference]: Start difference. First operand 713 states and 967 transitions. Second operand 3 states. [2018-11-10 11:46:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:51,234 INFO L93 Difference]: Finished difference Result 829 states and 1145 transitions. [2018-11-10 11:46:51,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:51,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 11:46:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:51,236 INFO L225 Difference]: With dead ends: 829 [2018-11-10 11:46:51,236 INFO L226 Difference]: Without dead ends: 827 [2018-11-10 11:46:51,236 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-10 11:46:51,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-11-10 11:46:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 713. [2018-11-10 11:46:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-10 11:46:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 951 transitions. [2018-11-10 11:46:51,252 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 951 transitions. Word has length 22 [2018-11-10 11:46:51,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:51,252 INFO L481 AbstractCegarLoop]: Abstraction has 713 states and 951 transitions. [2018-11-10 11:46:51,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 951 transitions. [2018-11-10 11:46:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 11:46:51,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:51,254 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-10 11:46:51,254 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:51,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:51,254 INFO L82 PathProgramCache]: Analyzing trace with hash 759830592, now seen corresponding path program 1 times [2018-11-10 11:46:51,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:51,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:51,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:51,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:51,272 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-10 11:46:51,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:51,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:51,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:51,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:51,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:51,273 INFO L87 Difference]: Start difference. First operand 713 states and 951 transitions. Second operand 3 states. [2018-11-10 11:46:51,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:51,294 INFO L93 Difference]: Finished difference Result 1213 states and 1625 transitions. [2018-11-10 11:46:51,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:51,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 11:46:51,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:51,296 INFO L225 Difference]: With dead ends: 1213 [2018-11-10 11:46:51,296 INFO L226 Difference]: Without dead ends: 1211 [2018-11-10 11:46:51,297 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-10 11:46:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-11-10 11:46:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1049. [2018-11-10 11:46:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2018-11-10 11:46:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1367 transitions. [2018-11-10 11:46:51,317 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1367 transitions. Word has length 23 [2018-11-10 11:46:51,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:51,317 INFO L481 AbstractCegarLoop]: Abstraction has 1049 states and 1367 transitions. [2018-11-10 11:46:51,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1367 transitions. [2018-11-10 11:46:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 11:46:51,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:51,318 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-10 11:46:51,319 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:51,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:51,319 INFO L82 PathProgramCache]: Analyzing trace with hash 366803582, now seen corresponding path program 1 times [2018-11-10 11:46:51,319 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:51,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:51,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:51,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:51,335 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-10 11:46:51,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:51,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:51,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:51,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:51,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:51,336 INFO L87 Difference]: Start difference. First operand 1049 states and 1367 transitions. Second operand 3 states. [2018-11-10 11:46:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:51,369 INFO L93 Difference]: Finished difference Result 2397 states and 3097 transitions. [2018-11-10 11:46:51,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:51,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 11:46:51,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:51,372 INFO L225 Difference]: With dead ends: 2397 [2018-11-10 11:46:51,372 INFO L226 Difference]: Without dead ends: 1371 [2018-11-10 11:46:51,374 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-10 11:46:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-11-10 11:46:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2018-11-10 11:46:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-11-10 11:46:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1703 transitions. [2018-11-10 11:46:51,402 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1703 transitions. Word has length 23 [2018-11-10 11:46:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:51,403 INFO L481 AbstractCegarLoop]: Abstraction has 1369 states and 1703 transitions. [2018-11-10 11:46:51,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1703 transitions. [2018-11-10 11:46:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 11:46:51,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:51,404 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-10 11:46:51,405 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:51,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:51,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2080127930, now seen corresponding path program 1 times [2018-11-10 11:46:51,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:51,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:51,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:51,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:51,432 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-10 11:46:51,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:51,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:51,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:51,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:51,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:51,433 INFO L87 Difference]: Start difference. First operand 1369 states and 1703 transitions. Second operand 3 states. [2018-11-10 11:46:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:51,460 INFO L93 Difference]: Finished difference Result 2077 states and 2585 transitions. [2018-11-10 11:46:51,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:51,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 11:46:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:51,463 INFO L225 Difference]: With dead ends: 2077 [2018-11-10 11:46:51,463 INFO L226 Difference]: Without dead ends: 1419 [2018-11-10 11:46:51,465 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-10 11:46:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-11-10 11:46:51,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1417. [2018-11-10 11:46:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1417 states. [2018-11-10 11:46:51,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1735 transitions. [2018-11-10 11:46:51,490 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1735 transitions. Word has length 24 [2018-11-10 11:46:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:51,491 INFO L481 AbstractCegarLoop]: Abstraction has 1417 states and 1735 transitions. [2018-11-10 11:46:51,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1735 transitions. [2018-11-10 11:46:51,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 11:46:51,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:51,492 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-10 11:46:51,492 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:51,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1513774788, now seen corresponding path program 1 times [2018-11-10 11:46:51,493 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:51,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:51,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:51,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:51,511 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-10 11:46:51,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:51,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:51,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:51,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:51,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:51,512 INFO L87 Difference]: Start difference. First operand 1417 states and 1735 transitions. Second operand 3 states. [2018-11-10 11:46:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:51,549 INFO L93 Difference]: Finished difference Result 2315 states and 2792 transitions. [2018-11-10 11:46:51,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:51,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 11:46:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:51,553 INFO L225 Difference]: With dead ends: 2315 [2018-11-10 11:46:51,553 INFO L226 Difference]: Without dead ends: 2313 [2018-11-10 11:46:51,554 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-10 11:46:51,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2018-11-10 11:46:51,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2121. [2018-11-10 11:46:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2121 states. [2018-11-10 11:46:51,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2535 transitions. [2018-11-10 11:46:51,593 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2535 transitions. Word has length 24 [2018-11-10 11:46:51,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:51,593 INFO L481 AbstractCegarLoop]: Abstraction has 2121 states and 2535 transitions. [2018-11-10 11:46:51,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:51,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2535 transitions. [2018-11-10 11:46:51,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 11:46:51,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:51,595 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-10 11:46:51,596 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:51,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:51,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1906801798, now seen corresponding path program 1 times [2018-11-10 11:46:51,596 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:51,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:51,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:51,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:51,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:51,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:51,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:51,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:51,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:51,616 INFO L87 Difference]: Start difference. First operand 2121 states and 2535 transitions. Second operand 3 states. [2018-11-10 11:46:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:51,672 INFO L93 Difference]: Finished difference Result 4745 states and 5543 transitions. [2018-11-10 11:46:51,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:51,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 11:46:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:51,673 INFO L225 Difference]: With dead ends: 4745 [2018-11-10 11:46:51,673 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 11:46:51,677 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-10 11:46:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 11:46:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 11:46:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 11:46:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 11:46:51,678 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-11-10 11:46:51,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:51,678 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:46:51,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:46:51,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 11:46:51,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 11:46:51,708 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 11:46:51,709 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:46:51,709 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:46:51,709 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 11:46:51,709 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 11:46:51,709 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 11:46:51,709 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2018-11-10 11:46:51,709 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-10 11:46:51,709 INFO L425 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 11:46:51,709 INFO L428 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2018-11-10 11:46:51,709 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-10 11:46:51,709 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-10 11:46:51,710 INFO L421 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2018-11-10 11:46:51,710 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2018-11-10 11:46:51,710 INFO L425 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 11:46:51,710 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 11:46:51,710 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 11:46:51,710 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2018-11-10 11:46:51,710 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 11:46:51,710 INFO L425 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 11:46:51,710 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-10 11:46:51,710 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 11:46:51,710 INFO L425 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 11:46:51,711 INFO L425 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2018-11-10 11:46:51,711 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-10 11:46:51,711 INFO L425 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-11-10 11:46:51,711 INFO L425 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 11:46:51,711 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 11:46:51,711 INFO L425 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 11:46:51,711 INFO L425 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-11-10 11:46:51,711 INFO L425 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 11:46:51,711 INFO L428 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2018-11-10 11:46:51,711 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2018-11-10 11:46:51,711 INFO L425 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2018-11-10 11:46:51,711 INFO L425 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2018-11-10 11:46:51,712 INFO L425 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 11:46:51,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:46:51 BoogieIcfgContainer [2018-11-10 11:46:51,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:46:51,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:46:51,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:46:51,717 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:46:51,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:46:50" (3/4) ... [2018-11-10 11:46:51,721 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 11:46:51,725 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 11:46:51,725 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 11:46:51,729 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 11:46:51,729 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 11:46:51,729 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 11:46:51,765 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bf2d7b05-afaa-4f75-b413-900bfe684dac/bin-2019/uautomizer/witness.graphml [2018-11-10 11:46:51,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:46:51,766 INFO L168 Benchmark]: Toolchain (without parser) took 2021.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 960.2 MB in the beginning and 742.9 MB in the end (delta: 217.4 MB). Peak memory consumption was 308.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:46:51,767 INFO L168 Benchmark]: CDTParser took 0.10 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-10 11:46:51,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.87 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-10 11:46:51,767 INFO L168 Benchmark]: Boogie Preprocessor took 21.46 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-10 11:46:51,768 INFO L168 Benchmark]: RCFGBuilder took 256.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -115.4 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:46:51,768 INFO L168 Benchmark]: TraceAbstraction took 1551.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 746.4 MB in the end (delta: 315.7 MB). Peak memory consumption was 315.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:46:51,768 INFO L168 Benchmark]: Witness Printer took 48.17 ms. Allocated memory is still 1.1 GB. Free memory was 746.4 MB in the beginning and 742.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:46:51,770 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.10 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 140.87 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 21.46 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 256.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -115.4 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1551.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 746.4 MB in the end (delta: 315.7 MB). Peak memory consumption was 315.7 MB. Max. memory is 11.5 GB. * Witness Printer took 48.17 ms. Allocated memory is still 1.1 GB. Free memory was 746.4 MB in the beginning and 742.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 1 error locations. SAFE Result, 1.5s OverallTime, 19 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1222 SDtfs, 563 SDslu, 809 SDs, 0 SdLazy, 101 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2121occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 655 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 400 NumberOfCodeBlocks, 400 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 14032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...