/usr/bin/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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:12:33,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:12:33,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:12:33,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:12:33,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:12:33,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:12:33,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:12:33,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:12:33,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:12:33,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:12:33,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:12:33,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:12:33,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:12:33,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:12:33,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:12:33,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:12:33,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:12:33,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:12:33,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:12:33,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:12:33,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:12:33,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:12:33,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:12:33,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:12:33,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:12:33,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:12:33,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:12:33,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:12:33,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:12:34,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:12:34,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:12:34,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:12:34,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:12:34,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:12:34,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:12:34,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:12:34,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:12:34,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:12:34,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:12:34,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:12:34,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:12:34,017 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-11-06 22:12:34,039 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:12:34,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:12:34,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:12:34,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:12:34,044 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:12:34,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:12:34,045 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:12:34,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:12:34,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:12:34,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:12:34,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:12:34,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:12:34,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:12:34,047 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:12:34,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:12:34,048 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:12:34,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:12:34,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:12:34,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:12:34,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:12:34,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:12:34,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:12:34,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:12:34,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:12:34,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:12:34,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:12:34,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:12:34,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:12:34,050 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:12:34,324 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:12:34,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:12:34,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:12:34,342 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:12:34,342 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:12:34,343 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-06 22:12:34,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3cd7c3c/a86e93cd806446369d17bfcb223b44f2/FLAG3d1ca067e [2019-11-06 22:12:34,943 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:12:34,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-06 22:12:34,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3cd7c3c/a86e93cd806446369d17bfcb223b44f2/FLAG3d1ca067e [2019-11-06 22:12:35,217 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3cd7c3c/a86e93cd806446369d17bfcb223b44f2 [2019-11-06 22:12:35,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:12:35,236 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:12:35,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:12:35,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:12:35,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:12:35,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:35" (1/1) ... [2019-11-06 22:12:35,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da24f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:35, skipping insertion in model container [2019-11-06 22:12:35,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:35" (1/1) ... [2019-11-06 22:12:35,254 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:12:35,305 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:12:35,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:12:35,687 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:12:35,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:12:35,941 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:12:35,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:35 WrapperNode [2019-11-06 22:12:35,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:12:35,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:12:35,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:12:35,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:12:35,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:35" (1/1) ... [2019-11-06 22:12:35,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:35" (1/1) ... [2019-11-06 22:12:35,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:35" (1/1) ... [2019-11-06 22:12:35,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:35" (1/1) ... [2019-11-06 22:12:35,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:35" (1/1) ... [2019-11-06 22:12:36,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:35" (1/1) ... [2019-11-06 22:12:36,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:35" (1/1) ... [2019-11-06 22:12:36,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:12:36,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:12:36,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:12:36,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:12:36,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:35" (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-11-06 22:12:36,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:12:36,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:12:36,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:12:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:12:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:12:36,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-06 22:12:36,135 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-06 22:12:36,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:12:36,135 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-06 22:12:36,136 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-06 22:12:36,137 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-06 22:12:36,137 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-06 22:12:36,137 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-06 22:12:36,138 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-06 22:12:36,139 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 22:12:36,139 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:12:36,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:12:36,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:12:37,398 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:12:37,399 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 22:12:37,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:37 BoogieIcfgContainer [2019-11-06 22:12:37,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:12:37,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:12:37,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:12:37,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:12:37,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:12:35" (1/3) ... [2019-11-06 22:12:37,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d85fd3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:37, skipping insertion in model container [2019-11-06 22:12:37,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:35" (2/3) ... [2019-11-06 22:12:37,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d85fd3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:37, skipping insertion in model container [2019-11-06 22:12:37,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:37" (3/3) ... [2019-11-06 22:12:37,415 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-06 22:12:37,426 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:12:37,445 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-06 22:12:37,458 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-06 22:12:37,492 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:12:37,493 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:12:37,493 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:12:37,493 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:12:37,493 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:12:37,494 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:12:37,494 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:12:37,494 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:12:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states. [2019-11-06 22:12:37,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-06 22:12:37,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:37,550 INFO L410 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] [2019-11-06 22:12:37,552 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:37,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:37,556 INFO L82 PathProgramCache]: Analyzing trace with hash 621454591, now seen corresponding path program 1 times [2019-11-06 22:12:37,563 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:37,563 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044532305] [2019-11-06 22:12:37,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:38,582 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 22:12:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:38,682 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044532305] [2019-11-06 22:12:38,683 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:38,683 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:38,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475178625] [2019-11-06 22:12:38,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:38,695 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:38,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:38,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:38,714 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 5 states. [2019-11-06 22:12:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:41,027 INFO L93 Difference]: Finished difference Result 692 states and 1230 transitions. [2019-11-06 22:12:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:12:41,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-06 22:12:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:41,057 INFO L225 Difference]: With dead ends: 692 [2019-11-06 22:12:41,058 INFO L226 Difference]: Without dead ends: 455 [2019-11-06 22:12:41,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:12:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-06 22:12:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 435. [2019-11-06 22:12:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-11-06 22:12:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 633 transitions. [2019-11-06 22:12:41,178 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 633 transitions. Word has length 95 [2019-11-06 22:12:41,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:41,180 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 633 transitions. [2019-11-06 22:12:41,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:12:41,181 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 633 transitions. [2019-11-06 22:12:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-06 22:12:41,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:41,191 INFO L410 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] [2019-11-06 22:12:41,191 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:41,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:41,192 INFO L82 PathProgramCache]: Analyzing trace with hash -12071785, now seen corresponding path program 1 times [2019-11-06 22:12:41,192 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:41,192 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053117091] [2019-11-06 22:12:41,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:41,534 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 22:12:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:41,560 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053117091] [2019-11-06 22:12:41,560 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:41,561 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:12:41,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981788645] [2019-11-06 22:12:41,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:12:41,563 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:41,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:12:41,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:41,564 INFO L87 Difference]: Start difference. First operand 435 states and 633 transitions. Second operand 4 states. [2019-11-06 22:12:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:43,426 INFO L93 Difference]: Finished difference Result 1259 states and 1829 transitions. [2019-11-06 22:12:43,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:12:43,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-06 22:12:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:43,433 INFO L225 Difference]: With dead ends: 1259 [2019-11-06 22:12:43,434 INFO L226 Difference]: Without dead ends: 856 [2019-11-06 22:12:43,437 INFO L630 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-11-06 22:12:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-11-06 22:12:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 437. [2019-11-06 22:12:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-11-06 22:12:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 635 transitions. [2019-11-06 22:12:43,479 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 635 transitions. Word has length 96 [2019-11-06 22:12:43,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:43,479 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 635 transitions. [2019-11-06 22:12:43,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:12:43,479 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 635 transitions. [2019-11-06 22:12:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-06 22:12:43,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:43,483 INFO L410 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] [2019-11-06 22:12:43,483 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:43,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:43,484 INFO L82 PathProgramCache]: Analyzing trace with hash 551245475, now seen corresponding path program 1 times [2019-11-06 22:12:43,484 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:43,484 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187110493] [2019-11-06 22:12:43,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:43,755 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 22:12:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:43,788 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187110493] [2019-11-06 22:12:43,789 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:43,789 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:12:43,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175716477] [2019-11-06 22:12:43,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:12:43,790 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:43,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:12:43,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:43,791 INFO L87 Difference]: Start difference. First operand 437 states and 635 transitions. Second operand 4 states. [2019-11-06 22:12:45,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:45,577 INFO L93 Difference]: Finished difference Result 1094 states and 1608 transitions. [2019-11-06 22:12:45,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:12:45,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-06 22:12:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:45,583 INFO L225 Difference]: With dead ends: 1094 [2019-11-06 22:12:45,583 INFO L226 Difference]: Without dead ends: 839 [2019-11-06 22:12:45,585 INFO L630 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-11-06 22:12:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-11-06 22:12:45,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 821. [2019-11-06 22:12:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2019-11-06 22:12:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1189 transitions. [2019-11-06 22:12:45,629 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1189 transitions. Word has length 97 [2019-11-06 22:12:45,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:45,630 INFO L462 AbstractCegarLoop]: Abstraction has 821 states and 1189 transitions. [2019-11-06 22:12:45,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:12:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1189 transitions. [2019-11-06 22:12:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-06 22:12:45,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:45,633 INFO L410 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] [2019-11-06 22:12:45,633 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash -604854874, now seen corresponding path program 1 times [2019-11-06 22:12:45,634 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:45,634 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133632886] [2019-11-06 22:12:45,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:46,008 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 22:12:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:46,038 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133632886] [2019-11-06 22:12:46,038 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:46,038 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:46,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095759917] [2019-11-06 22:12:46,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:46,039 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:46,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:46,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:46,041 INFO L87 Difference]: Start difference. First operand 821 states and 1189 transitions. Second operand 5 states. [2019-11-06 22:12:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:47,159 INFO L93 Difference]: Finished difference Result 1281 states and 1871 transitions. [2019-11-06 22:12:47,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:12:47,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-11-06 22:12:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:47,164 INFO L225 Difference]: With dead ends: 1281 [2019-11-06 22:12:47,165 INFO L226 Difference]: Without dead ends: 632 [2019-11-06 22:12:47,167 INFO L630 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-11-06 22:12:47,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-11-06 22:12:47,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-11-06 22:12:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-11-06 22:12:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 909 transitions. [2019-11-06 22:12:47,202 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 909 transitions. Word has length 97 [2019-11-06 22:12:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:47,202 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 909 transitions. [2019-11-06 22:12:47,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:12:47,203 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 909 transitions. [2019-11-06 22:12:47,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-06 22:12:47,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:47,224 INFO L410 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] [2019-11-06 22:12:47,224 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:47,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:47,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1078583877, now seen corresponding path program 1 times [2019-11-06 22:12:47,225 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:47,225 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873085152] [2019-11-06 22:12:47,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:47,539 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 22:12:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:47,569 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873085152] [2019-11-06 22:12:47,569 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:47,570 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:47,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789834836] [2019-11-06 22:12:47,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:12:47,571 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:47,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:12:47,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:12:47,571 INFO L87 Difference]: Start difference. First operand 632 states and 909 transitions. Second operand 6 states. [2019-11-06 22:12:47,830 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-06 22:12:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:49,306 INFO L93 Difference]: Finished difference Result 1328 states and 1993 transitions. [2019-11-06 22:12:49,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:12:49,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-06 22:12:49,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:49,311 INFO L225 Difference]: With dead ends: 1328 [2019-11-06 22:12:49,312 INFO L226 Difference]: Without dead ends: 867 [2019-11-06 22:12:49,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:12:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-11-06 22:12:49,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2019-11-06 22:12:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-11-06 22:12:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1286 transitions. [2019-11-06 22:12:49,361 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1286 transitions. Word has length 99 [2019-11-06 22:12:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:49,362 INFO L462 AbstractCegarLoop]: Abstraction has 865 states and 1286 transitions. [2019-11-06 22:12:49,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:12:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1286 transitions. [2019-11-06 22:12:49,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-06 22:12:49,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:49,364 INFO L410 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] [2019-11-06 22:12:49,364 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:49,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:49,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1205034742, now seen corresponding path program 1 times [2019-11-06 22:12:49,365 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:49,365 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657678231] [2019-11-06 22:12:49,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:49,679 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 22:12:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:49,710 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657678231] [2019-11-06 22:12:49,710 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:49,711 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:49,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609280411] [2019-11-06 22:12:49,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:49,712 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:49,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:49,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:49,712 INFO L87 Difference]: Start difference. First operand 865 states and 1286 transitions. Second operand 5 states. [2019-11-06 22:12:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:51,521 INFO L93 Difference]: Finished difference Result 2160 states and 3219 transitions. [2019-11-06 22:12:51,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:12:51,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-06 22:12:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:51,533 INFO L225 Difference]: With dead ends: 2160 [2019-11-06 22:12:51,534 INFO L226 Difference]: Without dead ends: 1318 [2019-11-06 22:12:51,544 INFO L630 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-11-06 22:12:51,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2019-11-06 22:12:51,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1304. [2019-11-06 22:12:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1304 states. [2019-11-06 22:12:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1930 transitions. [2019-11-06 22:12:51,643 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1930 transitions. Word has length 99 [2019-11-06 22:12:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:51,644 INFO L462 AbstractCegarLoop]: Abstraction has 1304 states and 1930 transitions. [2019-11-06 22:12:51,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:12:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1930 transitions. [2019-11-06 22:12:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-06 22:12:51,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:51,648 INFO L410 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] [2019-11-06 22:12:51,648 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2136447595, now seen corresponding path program 1 times [2019-11-06 22:12:51,649 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:51,649 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115167466] [2019-11-06 22:12:51,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:52,044 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 22:12:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:52,069 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115167466] [2019-11-06 22:12:52,069 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:52,069 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:52,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447474826] [2019-11-06 22:12:52,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:52,070 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:52,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:52,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:52,071 INFO L87 Difference]: Start difference. First operand 1304 states and 1930 transitions. Second operand 5 states. [2019-11-06 22:12:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:53,007 INFO L93 Difference]: Finished difference Result 2251 states and 3353 transitions. [2019-11-06 22:12:53,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:12:53,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-11-06 22:12:53,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:53,015 INFO L225 Difference]: With dead ends: 2251 [2019-11-06 22:12:53,015 INFO L226 Difference]: Without dead ends: 1304 [2019-11-06 22:12:53,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:12:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2019-11-06 22:12:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2019-11-06 22:12:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1304 states. [2019-11-06 22:12:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1929 transitions. [2019-11-06 22:12:53,085 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1929 transitions. Word has length 101 [2019-11-06 22:12:53,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:53,086 INFO L462 AbstractCegarLoop]: Abstraction has 1304 states and 1929 transitions. [2019-11-06 22:12:53,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:12:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1929 transitions. [2019-11-06 22:12:53,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-06 22:12:53,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:53,088 INFO L410 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] [2019-11-06 22:12:53,089 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:53,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:53,089 INFO L82 PathProgramCache]: Analyzing trace with hash 752353320, now seen corresponding path program 1 times [2019-11-06 22:12:53,089 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:53,089 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995984973] [2019-11-06 22:12:53,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:53,382 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 22:12:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:53,459 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995984973] [2019-11-06 22:12:53,459 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:53,459 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:12:53,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324117812] [2019-11-06 22:12:53,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:12:53,462 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:53,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:12:53,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:53,464 INFO L87 Difference]: Start difference. First operand 1304 states and 1929 transitions. Second operand 4 states. [2019-11-06 22:12:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:55,089 INFO L93 Difference]: Finished difference Result 2939 states and 4429 transitions. [2019-11-06 22:12:55,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:12:55,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-06 22:12:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:55,099 INFO L225 Difference]: With dead ends: 2939 [2019-11-06 22:12:55,100 INFO L226 Difference]: Without dead ends: 1968 [2019-11-06 22:12:55,102 INFO L630 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-11-06 22:12:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2019-11-06 22:12:55,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1956. [2019-11-06 22:12:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2019-11-06 22:12:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2882 transitions. [2019-11-06 22:12:55,199 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2882 transitions. Word has length 101 [2019-11-06 22:12:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:55,200 INFO L462 AbstractCegarLoop]: Abstraction has 1956 states and 2882 transitions. [2019-11-06 22:12:55,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:12:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2882 transitions. [2019-11-06 22:12:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-06 22:12:55,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:55,226 INFO L410 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] [2019-11-06 22:12:55,226 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:55,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:55,227 INFO L82 PathProgramCache]: Analyzing trace with hash -401467718, now seen corresponding path program 1 times [2019-11-06 22:12:55,227 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:55,227 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806017467] [2019-11-06 22:12:55,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:55,614 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 22:12:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:55,642 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806017467] [2019-11-06 22:12:55,642 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:55,642 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:55,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567980315] [2019-11-06 22:12:55,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:55,643 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:55,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:55,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:55,644 INFO L87 Difference]: Start difference. First operand 1956 states and 2882 transitions. Second operand 5 states. [2019-11-06 22:12:56,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:56,842 INFO L93 Difference]: Finished difference Result 5625 states and 8282 transitions. [2019-11-06 22:12:56,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:12:56,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-11-06 22:12:56,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:56,859 INFO L225 Difference]: With dead ends: 5625 [2019-11-06 22:12:56,859 INFO L226 Difference]: Without dead ends: 3712 [2019-11-06 22:12:56,864 INFO L630 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-11-06 22:12:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2019-11-06 22:12:57,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 3639. [2019-11-06 22:12:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2019-11-06 22:12:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 5322 transitions. [2019-11-06 22:12:57,126 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 5322 transitions. Word has length 103 [2019-11-06 22:12:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:57,127 INFO L462 AbstractCegarLoop]: Abstraction has 3639 states and 5322 transitions. [2019-11-06 22:12:57,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:12:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 5322 transitions. [2019-11-06 22:12:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-06 22:12:57,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:57,136 INFO L410 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] [2019-11-06 22:12:57,136 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:57,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:57,139 INFO L82 PathProgramCache]: Analyzing trace with hash -344356272, now seen corresponding path program 1 times [2019-11-06 22:12:57,139 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:57,144 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858652188] [2019-11-06 22:12:57,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:57,366 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 22:12:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:57,385 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858652188] [2019-11-06 22:12:57,385 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:57,385 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:12:57,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769560116] [2019-11-06 22:12:57,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:12:57,386 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:57,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:12:57,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:57,387 INFO L87 Difference]: Start difference. First operand 3639 states and 5322 transitions. Second operand 4 states. [2019-11-06 22:12:58,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:58,867 INFO L93 Difference]: Finished difference Result 10723 states and 15717 transitions. [2019-11-06 22:12:58,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:12:58,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-06 22:12:58,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:58,895 INFO L225 Difference]: With dead ends: 10723 [2019-11-06 22:12:58,895 INFO L226 Difference]: Without dead ends: 7190 [2019-11-06 22:12:58,902 INFO L630 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-11-06 22:12:58,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7190 states. [2019-11-06 22:12:59,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7190 to 3645. [2019-11-06 22:12:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3645 states. [2019-11-06 22:12:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 3645 states and 5328 transitions. [2019-11-06 22:12:59,135 INFO L78 Accepts]: Start accepts. Automaton has 3645 states and 5328 transitions. Word has length 104 [2019-11-06 22:12:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:59,136 INFO L462 AbstractCegarLoop]: Abstraction has 3645 states and 5328 transitions. [2019-11-06 22:12:59,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:12:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3645 states and 5328 transitions. [2019-11-06 22:12:59,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:12:59,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:59,140 INFO L410 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-11-06 22:12:59,140 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:59,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:59,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1407880473, now seen corresponding path program 1 times [2019-11-06 22:12:59,141 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:59,141 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636178220] [2019-11-06 22:12:59,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:59,430 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 22:12:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:59,454 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636178220] [2019-11-06 22:12:59,455 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:59,455 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:59,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126191735] [2019-11-06 22:12:59,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:59,456 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:59,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:59,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:59,456 INFO L87 Difference]: Start difference. First operand 3645 states and 5328 transitions. Second operand 5 states. [2019-11-06 22:13:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:00,478 INFO L93 Difference]: Finished difference Result 7248 states and 10600 transitions. [2019-11-06 22:13:00,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:13:00,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-06 22:13:00,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:00,493 INFO L225 Difference]: With dead ends: 7248 [2019-11-06 22:13:00,494 INFO L226 Difference]: Without dead ends: 3639 [2019-11-06 22:13:00,501 INFO L630 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-11-06 22:13:00,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2019-11-06 22:13:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 3639. [2019-11-06 22:13:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2019-11-06 22:13:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 5316 transitions. [2019-11-06 22:13:00,695 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 5316 transitions. Word has length 105 [2019-11-06 22:13:00,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:00,695 INFO L462 AbstractCegarLoop]: Abstraction has 3639 states and 5316 transitions. [2019-11-06 22:13:00,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:13:00,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 5316 transitions. [2019-11-06 22:13:00,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:13:00,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:00,699 INFO L410 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-11-06 22:13:00,700 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:00,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:00,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1322542982, now seen corresponding path program 1 times [2019-11-06 22:13:00,701 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:00,701 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930658682] [2019-11-06 22:13:00,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:00,949 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 22:13:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:00,976 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930658682] [2019-11-06 22:13:00,976 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:00,976 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:13:00,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331538017] [2019-11-06 22:13:00,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:13:00,977 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:00,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:13:00,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:13:00,977 INFO L87 Difference]: Start difference. First operand 3639 states and 5316 transitions. Second operand 4 states. [2019-11-06 22:13:02,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:02,637 INFO L93 Difference]: Finished difference Result 8390 states and 12380 transitions. [2019-11-06 22:13:02,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:13:02,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-06 22:13:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:02,663 INFO L225 Difference]: With dead ends: 8390 [2019-11-06 22:13:02,664 INFO L226 Difference]: Without dead ends: 5435 [2019-11-06 22:13:02,670 INFO L630 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-11-06 22:13:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5435 states. [2019-11-06 22:13:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5435 to 5362. [2019-11-06 22:13:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5362 states. [2019-11-06 22:13:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5362 states to 5362 states and 7702 transitions. [2019-11-06 22:13:02,973 INFO L78 Accepts]: Start accepts. Automaton has 5362 states and 7702 transitions. Word has length 105 [2019-11-06 22:13:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:02,973 INFO L462 AbstractCegarLoop]: Abstraction has 5362 states and 7702 transitions. [2019-11-06 22:13:02,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:13:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 5362 states and 7702 transitions. [2019-11-06 22:13:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-06 22:13:02,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:02,980 INFO L410 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-11-06 22:13:02,980 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:02,980 INFO L82 PathProgramCache]: Analyzing trace with hash 826091784, now seen corresponding path program 1 times [2019-11-06 22:13:02,981 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:02,981 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987246261] [2019-11-06 22:13:02,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:03,424 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 22:13:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:03,466 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987246261] [2019-11-06 22:13:03,467 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:03,467 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-06 22:13:03,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148316887] [2019-11-06 22:13:03,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 22:13:03,468 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:03,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:13:03,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-06 22:13:03,469 INFO L87 Difference]: Start difference. First operand 5362 states and 7702 transitions. Second operand 13 states. [2019-11-06 22:13:03,754 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-11-06 22:13:06,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:06,034 INFO L93 Difference]: Finished difference Result 15774 states and 23850 transitions. [2019-11-06 22:13:06,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 22:13:06,035 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 107 [2019-11-06 22:13:06,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:06,063 INFO L225 Difference]: With dead ends: 15774 [2019-11-06 22:13:06,063 INFO L226 Difference]: Without dead ends: 12444 [2019-11-06 22:13:06,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-11-06 22:13:06,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12444 states. [2019-11-06 22:13:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12444 to 10908. [2019-11-06 22:13:06,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10908 states. [2019-11-06 22:13:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10908 states to 10908 states and 16052 transitions. [2019-11-06 22:13:06,724 INFO L78 Accepts]: Start accepts. Automaton has 10908 states and 16052 transitions. Word has length 107 [2019-11-06 22:13:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:06,724 INFO L462 AbstractCegarLoop]: Abstraction has 10908 states and 16052 transitions. [2019-11-06 22:13:06,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 22:13:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 10908 states and 16052 transitions. [2019-11-06 22:13:06,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-06 22:13:06,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:06,731 INFO L410 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-11-06 22:13:06,731 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:06,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:06,732 INFO L82 PathProgramCache]: Analyzing trace with hash -583385139, now seen corresponding path program 1 times [2019-11-06 22:13:06,732 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:06,732 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129016251] [2019-11-06 22:13:06,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:07,091 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 22:13:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:07,134 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129016251] [2019-11-06 22:13:07,134 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:07,134 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:13:07,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568857476] [2019-11-06 22:13:07,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:13:07,135 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:07,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:13:07,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:13:07,136 INFO L87 Difference]: Start difference. First operand 10908 states and 16052 transitions. Second operand 9 states. [2019-11-06 22:13:07,582 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2019-11-06 22:13:08,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:08,819 INFO L93 Difference]: Finished difference Result 15628 states and 23581 transitions. [2019-11-06 22:13:08,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:13:08,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 107 [2019-11-06 22:13:08,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:08,837 INFO L225 Difference]: With dead ends: 15628 [2019-11-06 22:13:08,837 INFO L226 Difference]: Without dead ends: 7884 [2019-11-06 22:13:08,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-06 22:13:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7884 states. [2019-11-06 22:13:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7884 to 4357. [2019-11-06 22:13:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4357 states. [2019-11-06 22:13:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4357 states to 4357 states and 5829 transitions. [2019-11-06 22:13:09,317 INFO L78 Accepts]: Start accepts. Automaton has 4357 states and 5829 transitions. Word has length 107 [2019-11-06 22:13:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:09,318 INFO L462 AbstractCegarLoop]: Abstraction has 4357 states and 5829 transitions. [2019-11-06 22:13:09,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:13:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4357 states and 5829 transitions. [2019-11-06 22:13:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-06 22:13:09,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:09,323 INFO L410 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-11-06 22:13:09,323 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:09,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1184443987, now seen corresponding path program 1 times [2019-11-06 22:13:09,324 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:09,327 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562076506] [2019-11-06 22:13:09,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:09,629 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 22:13:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:09,657 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562076506] [2019-11-06 22:13:09,657 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:09,657 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:13:09,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679602824] [2019-11-06 22:13:09,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:13:09,658 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:09,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:13:09,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:13:09,659 INFO L87 Difference]: Start difference. First operand 4357 states and 5829 transitions. Second operand 5 states.