java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:44:59,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:44:59,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:44:59,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:44:59,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:44:59,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:44:59,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:44:59,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:44:59,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:44:59,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:44:59,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:44:59,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:44:59,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:44:59,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:44:59,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:44:59,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:44:59,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:44:59,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:44:59,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:44:59,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:44:59,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:44:59,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:44:59,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:44:59,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:44:59,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:44:59,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:44:59,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:44:59,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:44:59,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:44:59,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:44:59,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:44:59,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:44:59,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:44:59,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:44:59,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:44:59,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:44:59,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:44:59,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:44:59,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:44:59,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:44:59,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:44:59,994 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:45:00,008 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:45:00,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:45:00,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:45:00,010 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:45:00,010 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:45:00,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:45:00,011 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:45:00,011 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:45:00,011 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:45:00,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:45:00,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:45:00,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:45:00,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:45:00,012 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:45:00,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:45:00,012 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:45:00,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:45:00,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:45:00,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:45:00,013 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:45:00,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:45:00,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:45:00,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:45:00,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:45:00,014 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:45:00,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:45:00,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:45:00,015 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:45:00,015 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:45:00,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:45:00,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:45:00,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:45:00,320 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:45:00,320 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:45:00,322 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-14 23:45:00,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d320c0081/e651b211018841e587e3f198eff42c40/FLAG6bcd09471 [2019-10-14 23:45:00,973 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:45:00,974 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-14 23:45:00,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d320c0081/e651b211018841e587e3f198eff42c40/FLAG6bcd09471 [2019-10-14 23:45:01,225 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d320c0081/e651b211018841e587e3f198eff42c40 [2019-10-14 23:45:01,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:45:01,241 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:45:01,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:45:01,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:45:01,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:45:01,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:45:01" (1/1) ... [2019-10-14 23:45:01,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28d3fd5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:01, skipping insertion in model container [2019-10-14 23:45:01,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:45:01" (1/1) ... [2019-10-14 23:45:01,261 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:45:01,326 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:45:01,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:45:01,805 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:45:01,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:45:01,943 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:45:01,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:01 WrapperNode [2019-10-14 23:45:01,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:45:01,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:45:01,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:45:01,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:45:01,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:01" (1/1) ... [2019-10-14 23:45:01,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:01" (1/1) ... [2019-10-14 23:45:01,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:01" (1/1) ... [2019-10-14 23:45:01,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:01" (1/1) ... [2019-10-14 23:45:01,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:01" (1/1) ... [2019-10-14 23:45:02,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:01" (1/1) ... [2019-10-14 23:45:02,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:01" (1/1) ... [2019-10-14 23:45:02,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:45:02,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:45:02,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:45:02,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:45:02,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:45:02,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:45:02,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:45:02,109 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:45:02,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:45:02,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:45:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-14 23:45:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-14 23:45:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-14 23:45:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:45:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-14 23:45:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-14 23:45:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-14 23:45:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-14 23:45:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-14 23:45:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-14 23:45:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-14 23:45:02,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:45:02,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:45:02,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:45:03,381 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:45:03,381 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-14 23:45:03,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:03 BoogieIcfgContainer [2019-10-14 23:45:03,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:45:03,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:45:03,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:45:03,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:45:03,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:45:01" (1/3) ... [2019-10-14 23:45:03,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7268b759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:45:03, skipping insertion in model container [2019-10-14 23:45:03,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:01" (2/3) ... [2019-10-14 23:45:03,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7268b759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:45:03, skipping insertion in model container [2019-10-14 23:45:03,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:03" (3/3) ... [2019-10-14 23:45:03,400 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-14 23:45:03,411 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:45:03,423 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:45:03,434 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:45:03,461 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:45:03,461 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:45:03,461 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:45:03,461 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:45:03,462 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:45:03,462 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:45:03,462 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:45:03,462 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:45:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states. [2019-10-14 23:45:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:45:03,499 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:03,500 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:03,502 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:03,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1942738218, now seen corresponding path program 1 times [2019-10-14 23:45:03,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:03,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845362415] [2019-10-14 23:45:03,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:03,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:03,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:04,306 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-14 23:45:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:04,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845362415] [2019-10-14 23:45:04,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:04,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:04,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807158990] [2019-10-14 23:45:04,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:04,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:04,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:04,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:04,423 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 4 states. [2019-10-14 23:45:04,782 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2019-10-14 23:45:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:06,123 INFO L93 Difference]: Finished difference Result 509 states and 869 transitions. [2019-10-14 23:45:06,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:06,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-14 23:45:06,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:06,144 INFO L225 Difference]: With dead ends: 509 [2019-10-14 23:45:06,144 INFO L226 Difference]: Without dead ends: 375 [2019-10-14 23:45:06,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:06,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-14 23:45:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2019-10-14 23:45:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-14 23:45:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 566 transitions. [2019-10-14 23:45:06,231 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 566 transitions. Word has length 105 [2019-10-14 23:45:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:06,232 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 566 transitions. [2019-10-14 23:45:06,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:06,232 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 566 transitions. [2019-10-14 23:45:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:45:06,238 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:06,238 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:06,241 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:06,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1562873963, now seen corresponding path program 1 times [2019-10-14 23:45:06,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:06,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246961415] [2019-10-14 23:45:06,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:06,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:06,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:06,816 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-14 23:45:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:06,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246961415] [2019-10-14 23:45:06,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:06,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:06,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711002463] [2019-10-14 23:45:06,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:06,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:06,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:06,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:06,854 INFO L87 Difference]: Start difference. First operand 373 states and 566 transitions. Second operand 5 states. [2019-10-14 23:45:08,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:08,504 INFO L93 Difference]: Finished difference Result 1077 states and 1633 transitions. [2019-10-14 23:45:08,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:08,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-14 23:45:08,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:08,511 INFO L225 Difference]: With dead ends: 1077 [2019-10-14 23:45:08,512 INFO L226 Difference]: Without dead ends: 717 [2019-10-14 23:45:08,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-14 23:45:08,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2019-10-14 23:45:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-10-14 23:45:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1076 transitions. [2019-10-14 23:45:08,572 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1076 transitions. Word has length 105 [2019-10-14 23:45:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:08,573 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1076 transitions. [2019-10-14 23:45:08,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1076 transitions. [2019-10-14 23:45:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:45:08,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:08,577 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:08,578 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:08,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:08,578 INFO L82 PathProgramCache]: Analyzing trace with hash 878256033, now seen corresponding path program 1 times [2019-10-14 23:45:08,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:08,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090988651] [2019-10-14 23:45:08,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:08,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:08,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:08,832 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-14 23:45:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:08,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090988651] [2019-10-14 23:45:08,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:08,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:08,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104497900] [2019-10-14 23:45:08,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:08,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:08,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:08,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:08,856 INFO L87 Difference]: Start difference. First operand 715 states and 1076 transitions. Second operand 4 states. [2019-10-14 23:45:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:10,743 INFO L93 Difference]: Finished difference Result 2099 states and 3158 transitions. [2019-10-14 23:45:10,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:10,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-14 23:45:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:10,753 INFO L225 Difference]: With dead ends: 2099 [2019-10-14 23:45:10,754 INFO L226 Difference]: Without dead ends: 1416 [2019-10-14 23:45:10,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-10-14 23:45:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 717. [2019-10-14 23:45:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-14 23:45:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1078 transitions. [2019-10-14 23:45:10,827 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1078 transitions. Word has length 106 [2019-10-14 23:45:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:10,830 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1078 transitions. [2019-10-14 23:45:10,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1078 transitions. [2019-10-14 23:45:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-14 23:45:10,837 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:10,837 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:10,837 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:10,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:10,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1289386322, now seen corresponding path program 1 times [2019-10-14 23:45:10,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:10,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809567776] [2019-10-14 23:45:10,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:10,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:10,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:11,203 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-14 23:45:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:11,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809567776] [2019-10-14 23:45:11,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:11,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:11,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911625897] [2019-10-14 23:45:11,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:11,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:11,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:11,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:11,242 INFO L87 Difference]: Start difference. First operand 717 states and 1078 transitions. Second operand 4 states. [2019-10-14 23:45:12,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:12,904 INFO L93 Difference]: Finished difference Result 1629 states and 2536 transitions. [2019-10-14 23:45:12,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:12,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-14 23:45:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:12,918 INFO L225 Difference]: With dead ends: 1629 [2019-10-14 23:45:12,918 INFO L226 Difference]: Without dead ends: 1043 [2019-10-14 23:45:12,921 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:12,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-10-14 23:45:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1013. [2019-10-14 23:45:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2019-10-14 23:45:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1569 transitions. [2019-10-14 23:45:13,006 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1569 transitions. Word has length 107 [2019-10-14 23:45:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:13,008 INFO L462 AbstractCegarLoop]: Abstraction has 1013 states and 1569 transitions. [2019-10-14 23:45:13,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1569 transitions. [2019-10-14 23:45:13,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-14 23:45:13,012 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:13,012 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:13,013 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:13,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:13,013 INFO L82 PathProgramCache]: Analyzing trace with hash 75181962, now seen corresponding path program 1 times [2019-10-14 23:45:13,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:13,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065859506] [2019-10-14 23:45:13,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:13,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:13,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:13,442 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-14 23:45:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:13,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065859506] [2019-10-14 23:45:13,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:13,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:13,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843274917] [2019-10-14 23:45:13,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:13,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:13,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:13,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:13,473 INFO L87 Difference]: Start difference. First operand 1013 states and 1569 transitions. Second operand 5 states. [2019-10-14 23:45:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:14,716 INFO L93 Difference]: Finished difference Result 2008 states and 3113 transitions. [2019-10-14 23:45:14,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:14,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-14 23:45:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:14,728 INFO L225 Difference]: With dead ends: 2008 [2019-10-14 23:45:14,728 INFO L226 Difference]: Without dead ends: 1013 [2019-10-14 23:45:14,732 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-10-14 23:45:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1012. [2019-10-14 23:45:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-10-14 23:45:14,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1566 transitions. [2019-10-14 23:45:14,800 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1566 transitions. Word has length 107 [2019-10-14 23:45:14,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:14,800 INFO L462 AbstractCegarLoop]: Abstraction has 1012 states and 1566 transitions. [2019-10-14 23:45:14,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1566 transitions. [2019-10-14 23:45:14,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-14 23:45:14,803 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:14,804 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:14,804 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:14,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:14,805 INFO L82 PathProgramCache]: Analyzing trace with hash -610700672, now seen corresponding path program 1 times [2019-10-14 23:45:14,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:14,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455556865] [2019-10-14 23:45:14,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:14,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:14,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:15,071 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-14 23:45:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:15,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455556865] [2019-10-14 23:45:15,103 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:15,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:15,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763426096] [2019-10-14 23:45:15,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:15,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:15,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:15,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:15,105 INFO L87 Difference]: Start difference. First operand 1012 states and 1566 transitions. Second operand 4 states. [2019-10-14 23:45:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:16,953 INFO L93 Difference]: Finished difference Result 2765 states and 4312 transitions. [2019-10-14 23:45:16,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:16,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-14 23:45:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:16,965 INFO L225 Difference]: With dead ends: 2765 [2019-10-14 23:45:16,965 INFO L226 Difference]: Without dead ends: 1949 [2019-10-14 23:45:16,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:16,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2019-10-14 23:45:17,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1947. [2019-10-14 23:45:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2019-10-14 23:45:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2988 transitions. [2019-10-14 23:45:17,077 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2988 transitions. Word has length 107 [2019-10-14 23:45:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:17,078 INFO L462 AbstractCegarLoop]: Abstraction has 1947 states and 2988 transitions. [2019-10-14 23:45:17,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2988 transitions. [2019-10-14 23:45:17,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-14 23:45:17,081 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:17,081 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:17,081 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:17,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:17,082 INFO L82 PathProgramCache]: Analyzing trace with hash 935860675, now seen corresponding path program 1 times [2019-10-14 23:45:17,082 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:17,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721737417] [2019-10-14 23:45:17,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:17,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:17,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:17,432 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-14 23:45:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:17,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721737417] [2019-10-14 23:45:17,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:17,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:17,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027501054] [2019-10-14 23:45:17,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:17,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:17,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:17,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:17,487 INFO L87 Difference]: Start difference. First operand 1947 states and 2988 transitions. Second operand 5 states. [2019-10-14 23:45:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:18,517 INFO L93 Difference]: Finished difference Result 3252 states and 5019 transitions. [2019-10-14 23:45:18,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:18,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-14 23:45:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:18,526 INFO L225 Difference]: With dead ends: 3252 [2019-10-14 23:45:18,526 INFO L226 Difference]: Without dead ends: 1489 [2019-10-14 23:45:18,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:18,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2019-10-14 23:45:18,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1489. [2019-10-14 23:45:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1489 states. [2019-10-14 23:45:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 2274 transitions. [2019-10-14 23:45:18,600 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 2274 transitions. Word has length 107 [2019-10-14 23:45:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:18,601 INFO L462 AbstractCegarLoop]: Abstraction has 1489 states and 2274 transitions. [2019-10-14 23:45:18,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2274 transitions. [2019-10-14 23:45:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-14 23:45:18,603 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:18,603 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:18,604 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:18,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:18,604 INFO L82 PathProgramCache]: Analyzing trace with hash -967455086, now seen corresponding path program 1 times [2019-10-14 23:45:18,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:18,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055397500] [2019-10-14 23:45:18,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:18,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:18,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:18,894 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-14 23:45:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:18,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055397500] [2019-10-14 23:45:18,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:18,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:18,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720324657] [2019-10-14 23:45:18,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:18,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:18,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:18,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:18,921 INFO L87 Difference]: Start difference. First operand 1489 states and 2274 transitions. Second operand 4 states. [2019-10-14 23:45:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:20,244 INFO L93 Difference]: Finished difference Result 3562 states and 5609 transitions. [2019-10-14 23:45:20,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:20,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-14 23:45:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:20,255 INFO L225 Difference]: With dead ends: 3562 [2019-10-14 23:45:20,256 INFO L226 Difference]: Without dead ends: 2343 [2019-10-14 23:45:20,259 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-10-14 23:45:20,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2257. [2019-10-14 23:45:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2019-10-14 23:45:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3522 transitions. [2019-10-14 23:45:20,426 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3522 transitions. Word has length 109 [2019-10-14 23:45:20,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:20,427 INFO L462 AbstractCegarLoop]: Abstraction has 2257 states and 3522 transitions. [2019-10-14 23:45:20,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:20,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3522 transitions. [2019-10-14 23:45:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-14 23:45:20,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:20,429 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:20,430 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:20,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:20,430 INFO L82 PathProgramCache]: Analyzing trace with hash 195490705, now seen corresponding path program 1 times [2019-10-14 23:45:20,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:20,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914150910] [2019-10-14 23:45:20,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:20,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:20,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:20,798 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-14 23:45:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:20,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914150910] [2019-10-14 23:45:20,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:20,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:20,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920005448] [2019-10-14 23:45:20,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:20,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:20,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:20,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:20,834 INFO L87 Difference]: Start difference. First operand 2257 states and 3522 transitions. Second operand 5 states. [2019-10-14 23:45:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:22,644 INFO L93 Difference]: Finished difference Result 5820 states and 9101 transitions. [2019-10-14 23:45:22,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:22,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-14 23:45:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:22,661 INFO L225 Difference]: With dead ends: 5820 [2019-10-14 23:45:22,662 INFO L226 Difference]: Without dead ends: 3594 [2019-10-14 23:45:22,666 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2019-10-14 23:45:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3592. [2019-10-14 23:45:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2019-10-14 23:45:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5576 transitions. [2019-10-14 23:45:22,827 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5576 transitions. Word has length 110 [2019-10-14 23:45:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:22,827 INFO L462 AbstractCegarLoop]: Abstraction has 3592 states and 5576 transitions. [2019-10-14 23:45:22,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5576 transitions. [2019-10-14 23:45:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-14 23:45:22,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:22,830 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:22,830 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:22,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:22,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2099167218, now seen corresponding path program 1 times [2019-10-14 23:45:22,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:22,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370938627] [2019-10-14 23:45:22,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:22,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:22,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:23,156 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-14 23:45:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:23,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370938627] [2019-10-14 23:45:23,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:23,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:23,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596375911] [2019-10-14 23:45:23,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:23,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:23,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:23,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:23,202 INFO L87 Difference]: Start difference. First operand 3592 states and 5576 transitions. Second operand 4 states. [2019-10-14 23:45:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:24,599 INFO L93 Difference]: Finished difference Result 8748 states and 13683 transitions. [2019-10-14 23:45:24,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:24,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-14 23:45:24,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:24,625 INFO L225 Difference]: With dead ends: 8748 [2019-10-14 23:45:24,625 INFO L226 Difference]: Without dead ends: 5532 [2019-10-14 23:45:24,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2019-10-14 23:45:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5530. [2019-10-14 23:45:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5530 states. [2019-10-14 23:45:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5530 states to 5530 states and 8515 transitions. [2019-10-14 23:45:24,883 INFO L78 Accepts]: Start accepts. Automaton has 5530 states and 8515 transitions. Word has length 112 [2019-10-14 23:45:24,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:24,884 INFO L462 AbstractCegarLoop]: Abstraction has 5530 states and 8515 transitions. [2019-10-14 23:45:24,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:24,884 INFO L276 IsEmpty]: Start isEmpty. Operand 5530 states and 8515 transitions. [2019-10-14 23:45:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-14 23:45:24,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:24,887 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:24,887 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:24,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:24,888 INFO L82 PathProgramCache]: Analyzing trace with hash -122679506, now seen corresponding path program 1 times [2019-10-14 23:45:24,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:24,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959239879] [2019-10-14 23:45:24,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:24,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:24,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:25,142 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-14 23:45:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:25,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959239879] [2019-10-14 23:45:25,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:25,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:25,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164973537] [2019-10-14 23:45:25,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:25,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:25,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:25,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:25,167 INFO L87 Difference]: Start difference. First operand 5530 states and 8515 transitions. Second operand 4 states. [2019-10-14 23:45:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:26,643 INFO L93 Difference]: Finished difference Result 14570 states and 22850 transitions. [2019-10-14 23:45:26,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:26,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-14 23:45:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:26,677 INFO L225 Difference]: With dead ends: 14570 [2019-10-14 23:45:26,677 INFO L226 Difference]: Without dead ends: 9376 [2019-10-14 23:45:26,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:26,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9376 states. [2019-10-14 23:45:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9376 to 8966. [2019-10-14 23:45:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8966 states. [2019-10-14 23:45:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8966 states to 8966 states and 14034 transitions. [2019-10-14 23:45:27,119 INFO L78 Accepts]: Start accepts. Automaton has 8966 states and 14034 transitions. Word has length 114 [2019-10-14 23:45:27,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:27,119 INFO L462 AbstractCegarLoop]: Abstraction has 8966 states and 14034 transitions. [2019-10-14 23:45:27,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 8966 states and 14034 transitions. [2019-10-14 23:45:27,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-14 23:45:27,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:27,122 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:27,123 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:27,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:27,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1346619386, now seen corresponding path program 1 times [2019-10-14 23:45:27,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:27,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224269873] [2019-10-14 23:45:27,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:27,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:27,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:27,383 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-14 23:45:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:27,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224269873] [2019-10-14 23:45:27,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:27,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:27,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726117001] [2019-10-14 23:45:27,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:27,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:27,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:27,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:27,407 INFO L87 Difference]: Start difference. First operand 8966 states and 14034 transitions. Second operand 4 states. [2019-10-14 23:45:27,646 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2019-10-14 23:45:29,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:29,164 INFO L93 Difference]: Finished difference Result 25623 states and 40462 transitions. [2019-10-14 23:45:29,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:29,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-14 23:45:29,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:29,202 INFO L225 Difference]: With dead ends: 25623 [2019-10-14 23:45:29,202 INFO L226 Difference]: Without dead ends: 17325 [2019-10-14 23:45:29,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:29,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17325 states. [2019-10-14 23:45:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17325 to 17323. [2019-10-14 23:45:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2019-10-14 23:45:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 27148 transitions. [2019-10-14 23:45:29,988 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 27148 transitions. Word has length 115 [2019-10-14 23:45:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:29,988 INFO L462 AbstractCegarLoop]: Abstraction has 17323 states and 27148 transitions. [2019-10-14 23:45:29,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 27148 transitions. [2019-10-14 23:45:29,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-14 23:45:29,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:29,992 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:29,992 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:29,993 INFO L82 PathProgramCache]: Analyzing trace with hash 636430229, now seen corresponding path program 1 times [2019-10-14 23:45:29,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:29,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495735058] [2019-10-14 23:45:29,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:29,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:29,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:30,318 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-14 23:45:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:30,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495735058] [2019-10-14 23:45:30,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:30,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:30,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97114706] [2019-10-14 23:45:30,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:30,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:30,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:30,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:30,353 INFO L87 Difference]: Start difference. First operand 17323 states and 27148 transitions. Second operand 5 states. [2019-10-14 23:45:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:33,263 INFO L93 Difference]: Finished difference Result 48390 states and 75721 transitions. [2019-10-14 23:45:33,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:33,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-10-14 23:45:33,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:33,335 INFO L225 Difference]: With dead ends: 48390 [2019-10-14 23:45:33,335 INFO L226 Difference]: Without dead ends: 31110 [2019-10-14 23:45:33,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31110 states. [2019-10-14 23:45:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31110 to 31108. [2019-10-14 23:45:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31108 states. [2019-10-14 23:45:34,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31108 states to 31108 states and 48219 transitions. [2019-10-14 23:45:34,604 INFO L78 Accepts]: Start accepts. Automaton has 31108 states and 48219 transitions. Word has length 115 [2019-10-14 23:45:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:34,605 INFO L462 AbstractCegarLoop]: Abstraction has 31108 states and 48219 transitions. [2019-10-14 23:45:34,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:34,605 INFO L276 IsEmpty]: Start isEmpty. Operand 31108 states and 48219 transitions. [2019-10-14 23:45:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-14 23:45:34,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:34,612 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:34,613 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:34,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:34,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2111377993, now seen corresponding path program 1 times [2019-10-14 23:45:34,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:34,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649803903] [2019-10-14 23:45:34,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:34,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:34,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:34,994 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-14 23:45:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:35,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649803903] [2019-10-14 23:45:35,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:35,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:35,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117232670] [2019-10-14 23:45:35,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:35,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:35,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:35,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:35,017 INFO L87 Difference]: Start difference. First operand 31108 states and 48219 transitions. Second operand 4 states.