/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.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:12:39,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:12:39,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:12:39,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:12:39,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:12:39,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:12:39,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:12:39,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:12:39,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:12:39,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:12:39,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:12:39,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:12:39,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:12:39,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:12:39,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:12:39,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:12:39,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:12:39,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:12:39,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:12:39,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:12:39,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:12:39,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:12:39,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:12:39,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:12:39,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:12:39,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:12:39,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:12:39,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:12:39,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:12:39,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:12:39,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:12:39,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:12:39,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:12:39,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:12:39,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:12:39,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:12:39,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:12:39,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:12:39,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:12:39,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:12:39,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:12:39,121 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:39,144 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:12:39,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:12:39,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:12:39,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:12:39,147 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:12:39,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:12:39,147 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:12:39,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:12:39,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:12:39,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:12:39,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:12:39,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:12:39,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:12:39,150 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:12:39,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:12:39,150 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:12:39,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:12:39,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:12:39,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:12:39,151 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:12:39,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:12:39,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:12:39,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:12:39,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:12:39,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:12:39,152 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:12:39,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:12:39,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:12:39,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:12:39,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:12:39,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:12:39,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:12:39,470 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:12:39,471 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:12:39,471 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.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-06 22:12:39,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a28dd16/88bd5d8c79bb4391964d8e51cade6184/FLAGb21a5e91e [2019-11-06 22:12:40,109 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:12:40,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-06 22:12:40,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a28dd16/88bd5d8c79bb4391964d8e51cade6184/FLAGb21a5e91e [2019-11-06 22:12:40,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a28dd16/88bd5d8c79bb4391964d8e51cade6184 [2019-11-06 22:12:40,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:12:40,377 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:12:40,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:12:40,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:12:40,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:12:40,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:40" (1/1) ... [2019-11-06 22:12:40,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f6a27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:40, skipping insertion in model container [2019-11-06 22:12:40,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:40" (1/1) ... [2019-11-06 22:12:40,393 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:12:40,450 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:12:40,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:12:40,954 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:12:41,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:12:41,081 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:12:41,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:41 WrapperNode [2019-11-06 22:12:41,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:12:41,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:12:41,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:12:41,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:12:41,097 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:41" (1/1) ... [2019-11-06 22:12:41,097 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:41" (1/1) ... [2019-11-06 22:12:41,113 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:41" (1/1) ... [2019-11-06 22:12:41,113 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:41" (1/1) ... [2019-11-06 22:12:41,134 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:41" (1/1) ... [2019-11-06 22:12:41,150 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:41" (1/1) ... [2019-11-06 22:12:41,155 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:41" (1/1) ... [2019-11-06 22:12:41,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:12:41,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:12:41,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:12:41,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:12:41,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:41" (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:41,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:12:41,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:12:41,241 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:12:41,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:12:41,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:12:41,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-06 22:12:41,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-06 22:12:41,243 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-06 22:12:41,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:12:41,244 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-06 22:12:41,244 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-06 22:12:41,244 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-06 22:12:41,245 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-06 22:12:41,245 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-06 22:12:41,246 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-06 22:12:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 22:12:41,250 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:12:41,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:12:41,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:12:42,582 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:12:42,583 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 22:12:42,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:42 BoogieIcfgContainer [2019-11-06 22:12:42,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:12:42,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:12:42,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:12:42,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:12:42,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:12:40" (1/3) ... [2019-11-06 22:12:42,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:42, skipping insertion in model container [2019-11-06 22:12:42,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:41" (2/3) ... [2019-11-06 22:12:42,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:42, skipping insertion in model container [2019-11-06 22:12:42,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:42" (3/3) ... [2019-11-06 22:12:42,599 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-06 22:12:42,610 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:12:42,635 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:12:42,648 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:12:42,689 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:12:42,689 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:12:42,689 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:12:42,689 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:12:42,690 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:12:42,690 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:12:42,690 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:12:42,690 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:12:42,713 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states. [2019-11-06 22:12:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-06 22:12:42,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:42,724 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:42,725 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:42,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:42,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1231650886, now seen corresponding path program 1 times [2019-11-06 22:12:42,739 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:42,740 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442457732] [2019-11-06 22:12:42,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:43,676 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-06 22:12:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:43,752 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,752 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442457732] [2019-11-06 22:12:43,753 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:43,754 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:43,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373632377] [2019-11-06 22:12:43,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:43,767 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:43,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:43,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:43,784 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 5 states. [2019-11-06 22:12:45,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:45,883 INFO L93 Difference]: Finished difference Result 654 states and 1145 transitions. [2019-11-06 22:12:45,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:12:45,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-06 22:12:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:45,903 INFO L225 Difference]: With dead ends: 654 [2019-11-06 22:12:45,903 INFO L226 Difference]: Without dead ends: 430 [2019-11-06 22:12:45,908 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:45,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-11-06 22:12:45,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2019-11-06 22:12:45,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-11-06 22:12:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2019-11-06 22:12:45,992 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 99 [2019-11-06 22:12:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:45,992 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2019-11-06 22:12:45,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:12:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2019-11-06 22:12:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-06 22:12:45,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:45,998 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] [2019-11-06 22:12:45,999 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:45,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:45,999 INFO L82 PathProgramCache]: Analyzing trace with hash 829692944, now seen corresponding path program 1 times [2019-11-06 22:12:45,999 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:45,999 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051515649] [2019-11-06 22:12:46,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:46,327 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-06 22:12:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:46,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-11-06 22:12:46,350 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051515649] [2019-11-06 22:12:46,351 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:46,351 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:12:46,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362630892] [2019-11-06 22:12:46,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:12:46,353 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:46,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:12:46,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:46,354 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand 4 states. [2019-11-06 22:12:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:47,417 INFO L93 Difference]: Finished difference Result 1238 states and 1811 transitions. [2019-11-06 22:12:47,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:12:47,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-06 22:12:47,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:47,423 INFO L225 Difference]: With dead ends: 1238 [2019-11-06 22:12:47,424 INFO L226 Difference]: Without dead ends: 842 [2019-11-06 22:12:47,427 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:47,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-11-06 22:12:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 430. [2019-11-06 22:12:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-11-06 22:12:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 629 transitions. [2019-11-06 22:12:47,467 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 629 transitions. Word has length 100 [2019-11-06 22:12:47,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:47,467 INFO L462 AbstractCegarLoop]: Abstraction has 430 states and 629 transitions. [2019-11-06 22:12:47,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:12:47,468 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 629 transitions. [2019-11-06 22:12:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-06 22:12:47,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:47,471 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:47,471 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:47,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1677637145, now seen corresponding path program 1 times [2019-11-06 22:12:47,472 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:47,472 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426836782] [2019-11-06 22:12:47,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:47,807 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-06 22:12:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:47,835 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,835 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426836782] [2019-11-06 22:12:47,835 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:47,836 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:47,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045394970] [2019-11-06 22:12:47,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:47,837 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:47,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:47,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:47,838 INFO L87 Difference]: Start difference. First operand 430 states and 629 transitions. Second operand 5 states. [2019-11-06 22:12:48,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:48,823 INFO L93 Difference]: Finished difference Result 846 states and 1240 transitions. [2019-11-06 22:12:48,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:12:48,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-11-06 22:12:48,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:48,827 INFO L225 Difference]: With dead ends: 846 [2019-11-06 22:12:48,828 INFO L226 Difference]: Without dead ends: 428 [2019-11-06 22:12:48,829 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:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-11-06 22:12:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2019-11-06 22:12:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-11-06 22:12:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 625 transitions. [2019-11-06 22:12:48,854 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 625 transitions. Word has length 101 [2019-11-06 22:12:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:48,855 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 625 transitions. [2019-11-06 22:12:48,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:12:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 625 transitions. [2019-11-06 22:12:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-06 22:12:48,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:48,857 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:48,858 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:48,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:48,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1471843135, now seen corresponding path program 1 times [2019-11-06 22:12:48,858 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:48,859 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192574653] [2019-11-06 22:12:48,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:49,235 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-06 22:12:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:49,262 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,263 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192574653] [2019-11-06 22:12:49,263 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:49,263 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:12:49,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006500769] [2019-11-06 22:12:49,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:12:49,265 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:49,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:12:49,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:49,266 INFO L87 Difference]: Start difference. First operand 428 states and 625 transitions. Second operand 4 states. [2019-11-06 22:12:50,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:50,803 INFO L93 Difference]: Finished difference Result 881 states and 1305 transitions. [2019-11-06 22:12:50,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:12:50,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-06 22:12:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:50,808 INFO L225 Difference]: With dead ends: 881 [2019-11-06 22:12:50,808 INFO L226 Difference]: Without dead ends: 631 [2019-11-06 22:12:50,809 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:50,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-11-06 22:12:50,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 629. [2019-11-06 22:12:50,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-11-06 22:12:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 910 transitions. [2019-11-06 22:12:50,846 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 910 transitions. Word has length 101 [2019-11-06 22:12:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:50,848 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 910 transitions. [2019-11-06 22:12:50,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:12:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 910 transitions. [2019-11-06 22:12:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-06 22:12:50,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:50,850 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:50,851 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:50,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:50,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1316339424, now seen corresponding path program 1 times [2019-11-06 22:12:50,851 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:50,852 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533702195] [2019-11-06 22:12:50,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:51,273 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-06 22:12:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:51,310 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:51,311 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533702195] [2019-11-06 22:12:51,311 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:51,312 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:51,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497562111] [2019-11-06 22:12:51,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:12:51,313 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:51,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:12:51,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:12:51,313 INFO L87 Difference]: Start difference. First operand 629 states and 910 transitions. Second operand 6 states. [2019-11-06 22:12:51,550 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-11-06 22:12:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:52,746 INFO L93 Difference]: Finished difference Result 1413 states and 2116 transitions. [2019-11-06 22:12:52,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:12:52,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-11-06 22:12:52,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:52,752 INFO L225 Difference]: With dead ends: 1413 [2019-11-06 22:12:52,753 INFO L226 Difference]: Without dead ends: 952 [2019-11-06 22:12:52,754 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:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-11-06 22:12:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 950. [2019-11-06 22:12:52,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-11-06 22:12:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1405 transitions. [2019-11-06 22:12:52,844 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1405 transitions. Word has length 103 [2019-11-06 22:12:52,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:52,844 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1405 transitions. [2019-11-06 22:12:52,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:12:52,845 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1405 transitions. [2019-11-06 22:12:52,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-06 22:12:52,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:52,847 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:52,848 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:52,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:52,848 INFO L82 PathProgramCache]: Analyzing trace with hash 822354405, now seen corresponding path program 1 times [2019-11-06 22:12:52,848 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:52,849 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819611721] [2019-11-06 22:12:52,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:53,343 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-06 22:12:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:53,375 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,376 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819611721] [2019-11-06 22:12:53,377 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:53,377 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:53,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117225222] [2019-11-06 22:12:53,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:53,378 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:53,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:53,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:53,380 INFO L87 Difference]: Start difference. First operand 950 states and 1405 transitions. Second operand 5 states. [2019-11-06 22:12:54,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:54,764 INFO L93 Difference]: Finished difference Result 2380 states and 3527 transitions. [2019-11-06 22:12:54,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:12:54,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-11-06 22:12:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:54,775 INFO L225 Difference]: With dead ends: 2380 [2019-11-06 22:12:54,778 INFO L226 Difference]: Without dead ends: 1453 [2019-11-06 22:12:54,782 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:54,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-11-06 22:12:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1451. [2019-11-06 22:12:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-11-06 22:12:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2130 transitions. [2019-11-06 22:12:54,892 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2130 transitions. Word has length 103 [2019-11-06 22:12:54,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:54,893 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 2130 transitions. [2019-11-06 22:12:54,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:12:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2130 transitions. [2019-11-06 22:12:54,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:12:54,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:54,895 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:54,896 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:54,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1353908859, now seen corresponding path program 1 times [2019-11-06 22:12:54,896 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:54,897 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756035927] [2019-11-06 22:12:54,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:55,178 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-06 22:12:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:55,201 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,202 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756035927] [2019-11-06 22:12:55,202 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:55,202 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:55,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286601177] [2019-11-06 22:12:55,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:55,203 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:55,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:55,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:55,204 INFO L87 Difference]: Start difference. First operand 1451 states and 2130 transitions. Second operand 5 states. [2019-11-06 22:12:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:56,129 INFO L93 Difference]: Finished difference Result 2511 states and 3707 transitions. [2019-11-06 22:12:56,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:12:56,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-06 22:12:56,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:56,136 INFO L225 Difference]: With dead ends: 2511 [2019-11-06 22:12:56,136 INFO L226 Difference]: Without dead ends: 1451 [2019-11-06 22:12:56,139 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:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-11-06 22:12:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1451. [2019-11-06 22:12:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-11-06 22:12:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2129 transitions. [2019-11-06 22:12:56,218 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2129 transitions. Word has length 105 [2019-11-06 22:12:56,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:56,218 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 2129 transitions. [2019-11-06 22:12:56,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:12:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2129 transitions. [2019-11-06 22:12:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:12:56,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:56,221 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:56,222 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:56,222 INFO L82 PathProgramCache]: Analyzing trace with hash -673168968, now seen corresponding path program 1 times [2019-11-06 22:12:56,223 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:56,223 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499776624] [2019-11-06 22:12:56,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:56,493 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-06 22:12:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:56,535 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:56,536 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499776624] [2019-11-06 22:12:56,536 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:56,536 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:12:56,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903520883] [2019-11-06 22:12:56,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:12:56,538 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:56,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:12:56,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:56,539 INFO L87 Difference]: Start difference. First operand 1451 states and 2129 transitions. Second operand 4 states. [2019-11-06 22:12:58,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:58,127 INFO L93 Difference]: Finished difference Result 3308 states and 4930 transitions. [2019-11-06 22:12:58,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:12:58,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-06 22:12:58,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:58,139 INFO L225 Difference]: With dead ends: 3308 [2019-11-06 22:12:58,139 INFO L226 Difference]: Without dead ends: 2200 [2019-11-06 22:12:58,141 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:58,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2019-11-06 22:12:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 2198. [2019-11-06 22:12:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2198 states. [2019-11-06 22:12:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 3202 transitions. [2019-11-06 22:12:58,254 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 3202 transitions. Word has length 105 [2019-11-06 22:12:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:58,255 INFO L462 AbstractCegarLoop]: Abstraction has 2198 states and 3202 transitions. [2019-11-06 22:12:58,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:12:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 3202 transitions. [2019-11-06 22:12:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-06 22:12:58,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:58,258 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:12:58,258 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:58,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash -312373315, now seen corresponding path program 1 times [2019-11-06 22:12:58,259 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:58,259 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342878652] [2019-11-06 22:12:58,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:58,571 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-06 22:12:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:58,600 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:58,600 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342878652] [2019-11-06 22:12:58,600 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:58,601 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:58,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144937705] [2019-11-06 22:12:58,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:58,602 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:58,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:58,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:58,603 INFO L87 Difference]: Start difference. First operand 2198 states and 3202 transitions. Second operand 5 states. [2019-11-06 22:13:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:00,008 INFO L93 Difference]: Finished difference Result 6352 states and 9243 transitions. [2019-11-06 22:13:00,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:13:00,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-11-06 22:13:00,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:00,027 INFO L225 Difference]: With dead ends: 6352 [2019-11-06 22:13:00,027 INFO L226 Difference]: Without dead ends: 4197 [2019-11-06 22:13:00,033 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:13:00,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4197 states. [2019-11-06 22:13:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4197 to 4195. [2019-11-06 22:13:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4195 states. [2019-11-06 22:13:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 6052 transitions. [2019-11-06 22:13:00,254 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 6052 transitions. Word has length 107 [2019-11-06 22:13:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:00,254 INFO L462 AbstractCegarLoop]: Abstraction has 4195 states and 6052 transitions. [2019-11-06 22:13:00,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:13:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 6052 transitions. [2019-11-06 22:13:00,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-06 22:13:00,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:00,264 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, 1] [2019-11-06 22:13:00,264 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:00,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:00,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1907705071, now seen corresponding path program 1 times [2019-11-06 22:13:00,270 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:00,272 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419439534] [2019-11-06 22:13:00,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:00,540 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-06 22:13:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:00,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:13:00,560 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419439534] [2019-11-06 22:13:00,560 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:00,560 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:13:00,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621030291] [2019-11-06 22:13:00,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:13:00,561 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:00,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:13:00,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:13:00,561 INFO L87 Difference]: Start difference. First operand 4195 states and 6052 transitions. Second operand 4 states. [2019-11-06 22:13:01,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:01,725 INFO L93 Difference]: Finished difference Result 12393 states and 17909 transitions. [2019-11-06 22:13:01,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:13:01,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-06 22:13:01,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:01,758 INFO L225 Difference]: With dead ends: 12393 [2019-11-06 22:13:01,758 INFO L226 Difference]: Without dead ends: 8303 [2019-11-06 22:13:01,765 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:13:01,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8303 states. [2019-11-06 22:13:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8303 to 4201. [2019-11-06 22:13:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4201 states. [2019-11-06 22:13:02,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 6058 transitions. [2019-11-06 22:13:02,034 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 6058 transitions. Word has length 108 [2019-11-06 22:13:02,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:02,034 INFO L462 AbstractCegarLoop]: Abstraction has 4201 states and 6058 transitions. [2019-11-06 22:13:02,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:13:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 6058 transitions. [2019-11-06 22:13:02,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-06 22:13:02,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:02,042 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, 1, 1] [2019-11-06 22:13:02,042 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:02,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:02,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1358405212, now seen corresponding path program 1 times [2019-11-06 22:13:02,043 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:02,043 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074479948] [2019-11-06 22:13:02,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:02,352 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-06 22:13:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:02,377 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:02,377 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074479948] [2019-11-06 22:13:02,378 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:02,378 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:13:02,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619019448] [2019-11-06 22:13:02,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:13:02,379 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:02,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:13:02,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:13:02,379 INFO L87 Difference]: Start difference. First operand 4201 states and 6058 transitions. Second operand 5 states. [2019-11-06 22:13:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:03,328 INFO L93 Difference]: Finished difference Result 8360 states and 12060 transitions. [2019-11-06 22:13:03,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:13:03,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-11-06 22:13:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:03,343 INFO L225 Difference]: With dead ends: 8360 [2019-11-06 22:13:03,344 INFO L226 Difference]: Without dead ends: 4195 [2019-11-06 22:13:03,351 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:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2019-11-06 22:13:03,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 4195. [2019-11-06 22:13:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4195 states. [2019-11-06 22:13:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 6046 transitions. [2019-11-06 22:13:03,537 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 6046 transitions. Word has length 109 [2019-11-06 22:13:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:03,537 INFO L462 AbstractCegarLoop]: Abstraction has 4195 states and 6046 transitions. [2019-11-06 22:13:03,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:13:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 6046 transitions. [2019-11-06 22:13:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-06 22:13:03,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:03,542 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, 1, 1] [2019-11-06 22:13:03,543 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:03,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:03,543 INFO L82 PathProgramCache]: Analyzing trace with hash 825640158, now seen corresponding path program 1 times [2019-11-06 22:13:03,543 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:03,543 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348171151] [2019-11-06 22:13:03,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:03,806 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-06 22:13:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:03,837 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,837 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348171151] [2019-11-06 22:13:03,838 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:03,838 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:13:03,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129719766] [2019-11-06 22:13:03,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:13:03,839 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:03,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:13:03,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:13:03,839 INFO L87 Difference]: Start difference. First operand 4195 states and 6046 transitions. Second operand 4 states. [2019-11-06 22:13:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:05,410 INFO L93 Difference]: Finished difference Result 9753 states and 14169 transitions. [2019-11-06 22:13:05,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:13:05,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-06 22:13:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:05,424 INFO L225 Difference]: With dead ends: 9753 [2019-11-06 22:13:05,424 INFO L226 Difference]: Without dead ends: 6233 [2019-11-06 22:13:05,431 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:13:05,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2019-11-06 22:13:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 6231. [2019-11-06 22:13:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2019-11-06 22:13:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 8841 transitions. [2019-11-06 22:13:05,743 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 8841 transitions. Word has length 109 [2019-11-06 22:13:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:05,744 INFO L462 AbstractCegarLoop]: Abstraction has 6231 states and 8841 transitions. [2019-11-06 22:13:05,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:13:05,744 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 8841 transitions. [2019-11-06 22:13:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-06 22:13:05,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:05,751 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, 1, 1, 1, 1] [2019-11-06 22:13:05,751 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:05,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:05,751 INFO L82 PathProgramCache]: Analyzing trace with hash 200750214, now seen corresponding path program 1 times [2019-11-06 22:13:05,752 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:05,752 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178866203] [2019-11-06 22:13:05,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:06,228 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-06 22:13:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:06,267 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:06,267 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178866203] [2019-11-06 22:13:06,267 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:06,267 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-06 22:13:06,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504331765] [2019-11-06 22:13:06,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 22:13:06,268 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:06,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:13:06,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-06 22:13:06,269 INFO L87 Difference]: Start difference. First operand 6231 states and 8841 transitions. Second operand 13 states. [2019-11-06 22:13:06,541 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2019-11-06 22:13:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:08,933 INFO L93 Difference]: Finished difference Result 17888 states and 26756 transitions. [2019-11-06 22:13:08,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 22:13:08,934 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 111 [2019-11-06 22:13:08,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:09,037 INFO L225 Difference]: With dead ends: 17888 [2019-11-06 22:13:09,037 INFO L226 Difference]: Without dead ends: 13847 [2019-11-06 22:13:09,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-11-06 22:13:09,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13847 states. [2019-11-06 22:13:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13847 to 12191. [2019-11-06 22:13:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12191 states. [2019-11-06 22:13:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12191 states to 12191 states and 17824 transitions. [2019-11-06 22:13:09,811 INFO L78 Accepts]: Start accepts. Automaton has 12191 states and 17824 transitions. Word has length 111 [2019-11-06 22:13:09,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:09,811 INFO L462 AbstractCegarLoop]: Abstraction has 12191 states and 17824 transitions. [2019-11-06 22:13:09,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 22:13:09,811 INFO L276 IsEmpty]: Start isEmpty. Operand 12191 states and 17824 transitions. [2019-11-06 22:13:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-06 22:13:09,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:09,820 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, 1, 1, 1, 1] [2019-11-06 22:13:09,820 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:09,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:09,820 INFO L82 PathProgramCache]: Analyzing trace with hash -825612106, now seen corresponding path program 1 times [2019-11-06 22:13:09,821 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:09,821 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971267882] [2019-11-06 22:13:09,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:10,106 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-06 22:13:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:10,142 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:10,142 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971267882] [2019-11-06 22:13:10,142 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:10,143 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:13:10,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062028760] [2019-11-06 22:13:10,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:13:10,144 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:10,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:13:10,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:13:10,144 INFO L87 Difference]: Start difference. First operand 12191 states and 17824 transitions. Second operand 4 states. [2019-11-06 22:13:10,415 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-11-06 22:13:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:12,399 INFO L93 Difference]: Finished difference Result 28778 states and 44113 transitions. [2019-11-06 22:13:12,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:13:12,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-06 22:13:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:12,453 INFO L225 Difference]: With dead ends: 28778 [2019-11-06 22:13:12,453 INFO L226 Difference]: Without dead ends: 20474 [2019-11-06 22:13:12,471 INFO L630 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-11-06 22:13:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20474 states. [2019-11-06 22:13:14,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20474 to 20448. [2019-11-06 22:13:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20448 states. [2019-11-06 22:13:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20448 states to 20448 states and 30546 transitions. [2019-11-06 22:13:14,405 INFO L78 Accepts]: Start accepts. Automaton has 20448 states and 30546 transitions. Word has length 111 [2019-11-06 22:13:14,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:14,406 INFO L462 AbstractCegarLoop]: Abstraction has 20448 states and 30546 transitions. [2019-11-06 22:13:14,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:13:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 20448 states and 30546 transitions. [2019-11-06 22:13:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-06 22:13:14,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:14,413 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, 1, 1, 1, 1] [2019-11-06 22:13:14,413 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1946924417, now seen corresponding path program 1 times [2019-11-06 22:13:14,414 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:14,415 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651977413] [2019-11-06 22:13:14,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:14,750 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-06 22:13:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:14,775 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:14,776 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651977413] [2019-11-06 22:13:14,776 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:14,776 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:13:14,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311651911] [2019-11-06 22:13:14,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:13:14,777 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:14,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:13:14,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:13:14,778 INFO L87 Difference]: Start difference. First operand 20448 states and 30546 transitions. Second operand 9 states. [2019-11-06 22:13:15,026 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 161