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_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:16:22,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:16:22,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:16:22,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:16:22,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:16:22,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:16:22,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:16:22,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:16:22,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:16:22,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:16:22,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:16:22,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:16:22,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:16:22,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:16:22,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:16:22,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:16:22,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:16:22,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:16:22,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:16:22,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:16:22,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:16:22,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:16:22,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:16:22,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:16:22,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:16:22,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:16:22,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:16:22,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:16:22,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:16:22,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:16:22,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:16:22,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:16:22,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:16:22,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:16:22,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:16:22,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:16:22,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:16:22,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:16:22,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:16:22,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:16:22,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:16:22,218 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-09-08 12:16:22,239 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:16:22,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:16:22,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:16:22,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:16:22,241 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:16:22,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:16:22,241 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:16:22,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:16:22,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:16:22,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:16:22,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:16:22,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:16:22,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:16:22,242 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:16:22,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:16:22,243 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:16:22,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:16:22,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:16:22,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:16:22,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:16:22,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:16:22,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:16:22,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:16:22,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:16:22,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:16:22,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:16:22,248 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:16:22,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:16:22,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:16:22,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:16:22,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:16:22,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:16:22,311 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:16:22,311 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:16:22,312 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-08 12:16:22,370 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ea77fd3/ff3a498cabce46188d8d2d4b0eedc888/FLAG402f3ffda [2019-09-08 12:16:22,848 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:16:22,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-08 12:16:22,859 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ea77fd3/ff3a498cabce46188d8d2d4b0eedc888/FLAG402f3ffda [2019-09-08 12:16:23,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ea77fd3/ff3a498cabce46188d8d2d4b0eedc888 [2019-09-08 12:16:23,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:16:23,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:16:23,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:16:23,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:16:23,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:16:23,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:16:23" (1/1) ... [2019-09-08 12:16:23,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f59ac88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:16:23, skipping insertion in model container [2019-09-08 12:16:23,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:16:23" (1/1) ... [2019-09-08 12:16:23,216 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:16:23,281 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:16:23,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:16:23,717 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:16:23,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:16:23,852 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:16:23,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:16:23 WrapperNode [2019-09-08 12:16:23,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:16:23,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:16:23,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:16:23,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:16:23,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:16:23" (1/1) ... [2019-09-08 12:16:23,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:16:23" (1/1) ... [2019-09-08 12:16:23,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:16:23" (1/1) ... [2019-09-08 12:16:23,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:16:23" (1/1) ... [2019-09-08 12:16:23,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:16:23" (1/1) ... [2019-09-08 12:16:23,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:16:23" (1/1) ... [2019-09-08 12:16:23,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:16:23" (1/1) ... [2019-09-08 12:16:23,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:16:23,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:16:23,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:16:23,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:16:23,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:16:23" (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-09-08 12:16:23,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:16:23,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:16:23,969 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:16:23,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:16:23,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:16:23,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:16:23,970 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:16:23,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:16:23,971 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:16:23,971 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:16:23,971 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:16:23,971 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:16:23,972 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:16:23,972 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:16:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:16:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:16:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:16:23,975 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:16:23,976 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:16:23,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:16:23,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:16:24,761 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:16:24,762 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:16:24,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:16:24 BoogieIcfgContainer [2019-09-08 12:16:24,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:16:24,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:16:24,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:16:24,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:16:24,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:16:23" (1/3) ... [2019-09-08 12:16:24,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a01f2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:16:24, skipping insertion in model container [2019-09-08 12:16:24,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:16:23" (2/3) ... [2019-09-08 12:16:24,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a01f2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:16:24, skipping insertion in model container [2019-09-08 12:16:24,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:16:24" (3/3) ... [2019-09-08 12:16:24,778 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-08 12:16:24,788 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:16:24,810 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:16:24,828 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:16:24,862 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:16:24,863 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:16:24,863 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:16:24,863 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:16:24,863 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:16:24,863 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:16:24,863 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:16:24,864 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:16:24,864 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:16:24,884 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2019-09-08 12:16:24,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:16:24,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:24,896 INFO L399 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] [2019-09-08 12:16:24,897 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:24,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:24,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1596383191, now seen corresponding path program 1 times [2019-09-08 12:16:24,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:24,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:24,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:24,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:24,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:25,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:25,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:16:25,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:16:25,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:16:25,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:25,416 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2019-09-08 12:16:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:25,529 INFO L93 Difference]: Finished difference Result 261 states and 423 transitions. [2019-09-08 12:16:25,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:16:25,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 12:16:25,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:25,568 INFO L225 Difference]: With dead ends: 261 [2019-09-08 12:16:25,568 INFO L226 Difference]: Without dead ends: 179 [2019-09-08 12:16:25,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:25,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-08 12:16:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-09-08 12:16:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-08 12:16:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 254 transitions. [2019-09-08 12:16:25,636 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 254 transitions. Word has length 76 [2019-09-08 12:16:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:25,637 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 254 transitions. [2019-09-08 12:16:25,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:16:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 254 transitions. [2019-09-08 12:16:25,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:16:25,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:25,640 INFO L399 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] [2019-09-08 12:16:25,641 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:25,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:25,641 INFO L82 PathProgramCache]: Analyzing trace with hash 959202196, now seen corresponding path program 1 times [2019-09-08 12:16:25,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:25,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:25,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:25,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:25,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:25,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:25,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:16:25,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:16:25,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:16:25,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:25,794 INFO L87 Difference]: Start difference. First operand 177 states and 254 transitions. Second operand 3 states. [2019-09-08 12:16:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:25,865 INFO L93 Difference]: Finished difference Result 421 states and 642 transitions. [2019-09-08 12:16:25,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:16:25,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 12:16:25,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:25,872 INFO L225 Difference]: With dead ends: 421 [2019-09-08 12:16:25,872 INFO L226 Difference]: Without dead ends: 291 [2019-09-08 12:16:25,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-08 12:16:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2019-09-08 12:16:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-08 12:16:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 432 transitions. [2019-09-08 12:16:25,932 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 432 transitions. Word has length 77 [2019-09-08 12:16:25,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:25,935 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 432 transitions. [2019-09-08 12:16:25,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:16:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 432 transitions. [2019-09-08 12:16:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 12:16:25,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:25,942 INFO L399 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] [2019-09-08 12:16:25,942 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:25,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:25,943 INFO L82 PathProgramCache]: Analyzing trace with hash -927003067, now seen corresponding path program 1 times [2019-09-08 12:16:25,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:25,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:25,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:25,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:25,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:26,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:26,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:16:26,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:16:26,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:16:26,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:26,108 INFO L87 Difference]: Start difference. First operand 289 states and 432 transitions. Second operand 3 states. [2019-09-08 12:16:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:26,162 INFO L93 Difference]: Finished difference Result 741 states and 1150 transitions. [2019-09-08 12:16:26,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:16:26,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 12:16:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:26,166 INFO L225 Difference]: With dead ends: 741 [2019-09-08 12:16:26,166 INFO L226 Difference]: Without dead ends: 499 [2019-09-08 12:16:26,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-08 12:16:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2019-09-08 12:16:26,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-09-08 12:16:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 760 transitions. [2019-09-08 12:16:26,197 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 760 transitions. Word has length 78 [2019-09-08 12:16:26,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:26,198 INFO L475 AbstractCegarLoop]: Abstraction has 497 states and 760 transitions. [2019-09-08 12:16:26,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:16:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 760 transitions. [2019-09-08 12:16:26,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:16:26,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:26,200 INFO L399 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] [2019-09-08 12:16:26,200 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:26,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:26,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1219899588, now seen corresponding path program 1 times [2019-09-08 12:16:26,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:26,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:26,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:26,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:26,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:26,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:26,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:16:26,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:16:26,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:16:26,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:26,302 INFO L87 Difference]: Start difference. First operand 497 states and 760 transitions. Second operand 3 states. [2019-09-08 12:16:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:26,361 INFO L93 Difference]: Finished difference Result 1333 states and 2082 transitions. [2019-09-08 12:16:26,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:16:26,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 12:16:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:26,377 INFO L225 Difference]: With dead ends: 1333 [2019-09-08 12:16:26,377 INFO L226 Difference]: Without dead ends: 883 [2019-09-08 12:16:26,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:26,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-09-08 12:16:26,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 881. [2019-09-08 12:16:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-08 12:16:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1360 transitions. [2019-09-08 12:16:26,437 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1360 transitions. Word has length 79 [2019-09-08 12:16:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:26,437 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1360 transitions. [2019-09-08 12:16:26,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:16:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1360 transitions. [2019-09-08 12:16:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:16:26,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:26,448 INFO L399 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] [2019-09-08 12:16:26,448 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:26,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:26,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1078210598, now seen corresponding path program 1 times [2019-09-08 12:16:26,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:26,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:26,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:26,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:26,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:26,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:26,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:16:26,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:16:26,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:16:26,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:26,565 INFO L87 Difference]: Start difference. First operand 881 states and 1360 transitions. Second operand 3 states. [2019-09-08 12:16:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:26,641 INFO L93 Difference]: Finished difference Result 2421 states and 3778 transitions. [2019-09-08 12:16:26,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:16:26,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 12:16:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:26,651 INFO L225 Difference]: With dead ends: 2421 [2019-09-08 12:16:26,652 INFO L226 Difference]: Without dead ends: 1587 [2019-09-08 12:16:26,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2019-09-08 12:16:26,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1585. [2019-09-08 12:16:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2019-09-08 12:16:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2448 transitions. [2019-09-08 12:16:26,730 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2448 transitions. Word has length 80 [2019-09-08 12:16:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:26,731 INFO L475 AbstractCegarLoop]: Abstraction has 1585 states and 2448 transitions. [2019-09-08 12:16:26,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:16:26,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2448 transitions. [2019-09-08 12:16:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:16:26,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:26,734 INFO L399 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] [2019-09-08 12:16:26,734 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:26,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:26,734 INFO L82 PathProgramCache]: Analyzing trace with hash 847671569, now seen corresponding path program 1 times [2019-09-08 12:16:26,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:26,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:26,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:26,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:26,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:26,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:26,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:16:26,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:16:26,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:16:26,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:26,812 INFO L87 Difference]: Start difference. First operand 1585 states and 2448 transitions. Second operand 3 states. [2019-09-08 12:16:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:26,948 INFO L93 Difference]: Finished difference Result 4405 states and 6834 transitions. [2019-09-08 12:16:26,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:16:26,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 12:16:26,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:26,966 INFO L225 Difference]: With dead ends: 4405 [2019-09-08 12:16:26,968 INFO L226 Difference]: Without dead ends: 2867 [2019-09-08 12:16:26,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2019-09-08 12:16:27,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 2865. [2019-09-08 12:16:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-08 12:16:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4400 transitions. [2019-09-08 12:16:27,150 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4400 transitions. Word has length 81 [2019-09-08 12:16:27,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:27,151 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4400 transitions. [2019-09-08 12:16:27,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:16:27,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4400 transitions. [2019-09-08 12:16:27,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:16:27,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:27,152 INFO L399 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] [2019-09-08 12:16:27,152 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:27,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:27,157 INFO L82 PathProgramCache]: Analyzing trace with hash 12169119, now seen corresponding path program 1 times [2019-09-08 12:16:27,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:27,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:27,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:27,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:27,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:27,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:27,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:16:27,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:16:27,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:16:27,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:16:27,293 INFO L87 Difference]: Start difference. First operand 2865 states and 4400 transitions. Second operand 5 states. [2019-09-08 12:16:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:27,783 INFO L93 Difference]: Finished difference Result 8501 states and 13106 transitions. [2019-09-08 12:16:27,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:16:27,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:16:27,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:27,810 INFO L225 Difference]: With dead ends: 8501 [2019-09-08 12:16:27,810 INFO L226 Difference]: Without dead ends: 5683 [2019-09-08 12:16:27,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:16:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5683 states. [2019-09-08 12:16:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5683 to 5681. [2019-09-08 12:16:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5681 states. [2019-09-08 12:16:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5681 states to 5681 states and 8720 transitions. [2019-09-08 12:16:28,107 INFO L78 Accepts]: Start accepts. Automaton has 5681 states and 8720 transitions. Word has length 82 [2019-09-08 12:16:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:28,107 INFO L475 AbstractCegarLoop]: Abstraction has 5681 states and 8720 transitions. [2019-09-08 12:16:28,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:16:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 5681 states and 8720 transitions. [2019-09-08 12:16:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:16:28,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:28,108 INFO L399 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] [2019-09-08 12:16:28,109 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:28,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:28,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1733499994, now seen corresponding path program 1 times [2019-09-08 12:16:28,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:28,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:28,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:28,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:28,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:28,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:28,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:16:28,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:16:28,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:16:28,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:16:28,223 INFO L87 Difference]: Start difference. First operand 5681 states and 8720 transitions. Second operand 5 states. [2019-09-08 12:16:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:28,643 INFO L93 Difference]: Finished difference Result 11315 states and 17393 transitions. [2019-09-08 12:16:28,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:16:28,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:16:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:28,670 INFO L225 Difference]: With dead ends: 11315 [2019-09-08 12:16:28,670 INFO L226 Difference]: Without dead ends: 5681 [2019-09-08 12:16:28,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:16:28,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2019-09-08 12:16:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 5681. [2019-09-08 12:16:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5681 states. [2019-09-08 12:16:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5681 states to 5681 states and 8656 transitions. [2019-09-08 12:16:28,966 INFO L78 Accepts]: Start accepts. Automaton has 5681 states and 8656 transitions. Word has length 82 [2019-09-08 12:16:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:28,967 INFO L475 AbstractCegarLoop]: Abstraction has 5681 states and 8656 transitions. [2019-09-08 12:16:28,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:16:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5681 states and 8656 transitions. [2019-09-08 12:16:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:16:28,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:28,968 INFO L399 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] [2019-09-08 12:16:28,969 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:28,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:28,969 INFO L82 PathProgramCache]: Analyzing trace with hash 286470399, now seen corresponding path program 1 times [2019-09-08 12:16:28,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:28,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:28,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:28,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:29,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:29,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:16:29,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:16:29,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:16:29,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:16:29,095 INFO L87 Difference]: Start difference. First operand 5681 states and 8656 transitions. Second operand 5 states. [2019-09-08 12:16:29,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:29,448 INFO L93 Difference]: Finished difference Result 11315 states and 17265 transitions. [2019-09-08 12:16:29,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:16:29,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:16:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:29,474 INFO L225 Difference]: With dead ends: 11315 [2019-09-08 12:16:29,474 INFO L226 Difference]: Without dead ends: 5681 [2019-09-08 12:16:29,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:16:29,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2019-09-08 12:16:29,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 5681. [2019-09-08 12:16:29,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5681 states. [2019-09-08 12:16:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5681 states to 5681 states and 8592 transitions. [2019-09-08 12:16:29,872 INFO L78 Accepts]: Start accepts. Automaton has 5681 states and 8592 transitions. Word has length 82 [2019-09-08 12:16:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:29,872 INFO L475 AbstractCegarLoop]: Abstraction has 5681 states and 8592 transitions. [2019-09-08 12:16:29,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:16:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 5681 states and 8592 transitions. [2019-09-08 12:16:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:16:29,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:29,874 INFO L399 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] [2019-09-08 12:16:29,874 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:29,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:29,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1555560134, now seen corresponding path program 1 times [2019-09-08 12:16:29,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:29,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:29,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:29,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:29,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:29,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:29,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:16:29,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:16:29,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:16:29,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:16:29,965 INFO L87 Difference]: Start difference. First operand 5681 states and 8592 transitions. Second operand 5 states. [2019-09-08 12:16:30,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:30,356 INFO L93 Difference]: Finished difference Result 11315 states and 17137 transitions. [2019-09-08 12:16:30,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:16:30,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:16:30,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:30,394 INFO L225 Difference]: With dead ends: 11315 [2019-09-08 12:16:30,395 INFO L226 Difference]: Without dead ends: 5681 [2019-09-08 12:16:30,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:16:30,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2019-09-08 12:16:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 5681. [2019-09-08 12:16:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5681 states. [2019-09-08 12:16:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5681 states to 5681 states and 8528 transitions. [2019-09-08 12:16:30,735 INFO L78 Accepts]: Start accepts. Automaton has 5681 states and 8528 transitions. Word has length 82 [2019-09-08 12:16:30,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:30,736 INFO L475 AbstractCegarLoop]: Abstraction has 5681 states and 8528 transitions. [2019-09-08 12:16:30,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:16:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 5681 states and 8528 transitions. [2019-09-08 12:16:30,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:16:30,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:30,738 INFO L399 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] [2019-09-08 12:16:30,738 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:30,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:30,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1275335605, now seen corresponding path program 1 times [2019-09-08 12:16:30,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:30,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:30,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:30,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:30,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:30,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:30,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:16:30,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:16:30,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:16:30,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:16:30,836 INFO L87 Difference]: Start difference. First operand 5681 states and 8528 transitions. Second operand 5 states. [2019-09-08 12:16:31,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:31,220 INFO L93 Difference]: Finished difference Result 11315 states and 17009 transitions. [2019-09-08 12:16:31,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:16:31,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:16:31,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:31,236 INFO L225 Difference]: With dead ends: 11315 [2019-09-08 12:16:31,236 INFO L226 Difference]: Without dead ends: 5681 [2019-09-08 12:16:31,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:16:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2019-09-08 12:16:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 5681. [2019-09-08 12:16:31,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5681 states. [2019-09-08 12:16:31,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5681 states to 5681 states and 8464 transitions. [2019-09-08 12:16:31,644 INFO L78 Accepts]: Start accepts. Automaton has 5681 states and 8464 transitions. Word has length 82 [2019-09-08 12:16:31,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:31,644 INFO L475 AbstractCegarLoop]: Abstraction has 5681 states and 8464 transitions. [2019-09-08 12:16:31,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:16:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5681 states and 8464 transitions. [2019-09-08 12:16:31,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:16:31,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:31,646 INFO L399 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] [2019-09-08 12:16:31,646 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:31,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:31,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1745763686, now seen corresponding path program 1 times [2019-09-08 12:16:31,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:31,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:31,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:31,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:31,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:31,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:31,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:16:31,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:16:31,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:16:31,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:16:31,797 INFO L87 Difference]: Start difference. First operand 5681 states and 8464 transitions. Second operand 8 states. [2019-09-08 12:16:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:34,319 INFO L93 Difference]: Finished difference Result 62021 states and 92634 transitions. [2019-09-08 12:16:34,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:16:34,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-09-08 12:16:34,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:34,476 INFO L225 Difference]: With dead ends: 62021 [2019-09-08 12:16:34,476 INFO L226 Difference]: Without dead ends: 56387 [2019-09-08 12:16:34,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:16:34,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56387 states. [2019-09-08 12:16:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56387 to 16945. [2019-09-08 12:16:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16945 states. [2019-09-08 12:16:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16945 states to 16945 states and 25040 transitions. [2019-09-08 12:16:36,584 INFO L78 Accepts]: Start accepts. Automaton has 16945 states and 25040 transitions. Word has length 82 [2019-09-08 12:16:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:36,585 INFO L475 AbstractCegarLoop]: Abstraction has 16945 states and 25040 transitions. [2019-09-08 12:16:36,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:16:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 16945 states and 25040 transitions. [2019-09-08 12:16:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:16:36,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:36,586 INFO L399 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] [2019-09-08 12:16:36,586 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:36,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:36,587 INFO L82 PathProgramCache]: Analyzing trace with hash 760119925, now seen corresponding path program 1 times [2019-09-08 12:16:36,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:36,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:36,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:36,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:36,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:36,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:36,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:16:36,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:16:36,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:16:36,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:36,653 INFO L87 Difference]: Start difference. First operand 16945 states and 25040 transitions. Second operand 3 states. [2019-09-08 12:16:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:37,789 INFO L93 Difference]: Finished difference Result 37943 states and 55988 transitions. [2019-09-08 12:16:37,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:16:37,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-08 12:16:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:37,832 INFO L225 Difference]: With dead ends: 37943 [2019-09-08 12:16:37,833 INFO L226 Difference]: Without dead ends: 21045 [2019-09-08 12:16:37,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:37,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21045 states. [2019-09-08 12:16:39,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21045 to 21043. [2019-09-08 12:16:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21043 states. [2019-09-08 12:16:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21043 states to 21043 states and 30834 transitions. [2019-09-08 12:16:39,560 INFO L78 Accepts]: Start accepts. Automaton has 21043 states and 30834 transitions. Word has length 84 [2019-09-08 12:16:39,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:39,560 INFO L475 AbstractCegarLoop]: Abstraction has 21043 states and 30834 transitions. [2019-09-08 12:16:39,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:16:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 21043 states and 30834 transitions. [2019-09-08 12:16:39,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:16:39,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:39,562 INFO L399 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] [2019-09-08 12:16:39,562 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:39,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:39,562 INFO L82 PathProgramCache]: Analyzing trace with hash 780169268, now seen corresponding path program 1 times [2019-09-08 12:16:39,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:39,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:39,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:39,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:39,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:39,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:39,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:16:39,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:16:39,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:16:39,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:16:39,846 INFO L87 Difference]: Start difference. First operand 21043 states and 30834 transitions. Second operand 8 states. [2019-09-08 12:16:41,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:41,454 INFO L93 Difference]: Finished difference Result 47675 states and 70038 transitions. [2019-09-08 12:16:41,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:16:41,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-09-08 12:16:41,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:41,493 INFO L225 Difference]: With dead ends: 47675 [2019-09-08 12:16:41,493 INFO L226 Difference]: Without dead ends: 26681 [2019-09-08 12:16:41,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:16:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26681 states. [2019-09-08 12:16:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26681 to 21043. [2019-09-08 12:16:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21043 states. [2019-09-08 12:16:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21043 states to 21043 states and 30674 transitions. [2019-09-08 12:16:42,789 INFO L78 Accepts]: Start accepts. Automaton has 21043 states and 30674 transitions. Word has length 84 [2019-09-08 12:16:42,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:42,789 INFO L475 AbstractCegarLoop]: Abstraction has 21043 states and 30674 transitions. [2019-09-08 12:16:42,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:16:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 21043 states and 30674 transitions. [2019-09-08 12:16:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:16:42,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:42,791 INFO L399 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] [2019-09-08 12:16:42,791 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:42,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:42,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1586465785, now seen corresponding path program 1 times [2019-09-08 12:16:42,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:42,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:42,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:42,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:42,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:42,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:42,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:16:42,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:16:42,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:16:42,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:16:42,881 INFO L87 Difference]: Start difference. First operand 21043 states and 30674 transitions. Second operand 5 states. [2019-09-08 12:16:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:45,037 INFO L93 Difference]: Finished difference Result 40839 states and 59250 transitions. [2019-09-08 12:16:45,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:16:45,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 12:16:45,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:45,079 INFO L225 Difference]: With dead ends: 40839 [2019-09-08 12:16:45,079 INFO L226 Difference]: Without dead ends: 40837 [2019-09-08 12:16:45,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:16:45,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40837 states. [2019-09-08 12:16:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40837 to 21875. [2019-09-08 12:16:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21875 states. [2019-09-08 12:16:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21875 states to 21875 states and 31474 transitions. [2019-09-08 12:16:47,119 INFO L78 Accepts]: Start accepts. Automaton has 21875 states and 31474 transitions. Word has length 85 [2019-09-08 12:16:47,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:47,119 INFO L475 AbstractCegarLoop]: Abstraction has 21875 states and 31474 transitions. [2019-09-08 12:16:47,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:16:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand 21875 states and 31474 transitions. [2019-09-08 12:16:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:16:47,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:47,127 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:16:47,127 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:47,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:47,128 INFO L82 PathProgramCache]: Analyzing trace with hash -784533912, now seen corresponding path program 1 times [2019-09-08 12:16:47,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:47,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:47,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:47,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:47,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:16:47,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:47,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:16:47,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:16:47,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:16:47,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:16:47,326 INFO L87 Difference]: Start difference. First operand 21875 states and 31474 transitions. Second operand 8 states. [2019-09-08 12:16:53,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:53,592 INFO L93 Difference]: Finished difference Result 107969 states and 155865 transitions. [2019-09-08 12:16:53,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:16:53,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-08 12:16:53,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:53,699 INFO L225 Difference]: With dead ends: 107969 [2019-09-08 12:16:53,700 INFO L226 Difference]: Without dead ends: 102079 [2019-09-08 12:16:53,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:16:53,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102079 states. [2019-09-08 12:16:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102079 to 35027. [2019-09-08 12:16:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35027 states. [2019-09-08 12:16:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35027 states to 35027 states and 50162 transitions. [2019-09-08 12:16:57,377 INFO L78 Accepts]: Start accepts. Automaton has 35027 states and 50162 transitions. Word has length 115 [2019-09-08 12:16:57,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:57,378 INFO L475 AbstractCegarLoop]: Abstraction has 35027 states and 50162 transitions. [2019-09-08 12:16:57,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:16:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 35027 states and 50162 transitions. [2019-09-08 12:16:57,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:16:57,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:57,388 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:16:57,389 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:57,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:57,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1354552530, now seen corresponding path program 1 times [2019-09-08 12:16:57,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:57,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:57,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:57,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:57,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 12:16:57,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:57,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:16:57,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:16:57,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:16:57,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:16:57,558 INFO L87 Difference]: Start difference. First operand 35027 states and 50162 transitions. Second operand 8 states. [2019-09-08 12:17:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:04,616 INFO L93 Difference]: Finished difference Result 121057 states and 174489 transitions. [2019-09-08 12:17:04,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:17:04,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-08 12:17:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:04,742 INFO L225 Difference]: With dead ends: 121057 [2019-09-08 12:17:04,742 INFO L226 Difference]: Without dead ends: 113727 [2019-09-08 12:17:04,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:17:04,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113727 states. [2019-09-08 12:17:09,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113727 to 42355. [2019-09-08 12:17:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42355 states. [2019-09-08 12:17:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42355 states to 42355 states and 60690 transitions. [2019-09-08 12:17:09,330 INFO L78 Accepts]: Start accepts. Automaton has 42355 states and 60690 transitions. Word has length 115 [2019-09-08 12:17:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:09,330 INFO L475 AbstractCegarLoop]: Abstraction has 42355 states and 60690 transitions. [2019-09-08 12:17:09,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:17:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 42355 states and 60690 transitions. [2019-09-08 12:17:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:17:09,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:09,340 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:17:09,340 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:09,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:09,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1652537018, now seen corresponding path program 1 times [2019-09-08 12:17:09,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:09,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:09,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:09,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:09,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:09,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:17:09,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:17:09,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:17:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:09,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 12:17:09,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:17:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 12:17:09,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:17:09,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2019-09-08 12:17:09,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:17:09,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:17:09,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:17:09,825 INFO L87 Difference]: Start difference. First operand 42355 states and 60690 transitions. Second operand 11 states. [2019-09-08 12:17:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:22,907 INFO L93 Difference]: Finished difference Result 196533 states and 282819 transitions. [2019-09-08 12:17:22,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:17:22,907 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2019-09-08 12:17:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:23,412 INFO L225 Difference]: With dead ends: 196533 [2019-09-08 12:17:23,412 INFO L226 Difference]: Without dead ends: 174707 [2019-09-08 12:17:23,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:17:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174707 states. [2019-09-08 12:17:32,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174707 to 77267. [2019-09-08 12:17:32,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77267 states. [2019-09-08 12:17:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77267 states to 77267 states and 111218 transitions. [2019-09-08 12:17:32,967 INFO L78 Accepts]: Start accepts. Automaton has 77267 states and 111218 transitions. Word has length 115 [2019-09-08 12:17:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:32,968 INFO L475 AbstractCegarLoop]: Abstraction has 77267 states and 111218 transitions. [2019-09-08 12:17:32,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:17:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 77267 states and 111218 transitions. [2019-09-08 12:17:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:17:32,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:32,987 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:17:32,987 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:32,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:32,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1676282240, now seen corresponding path program 1 times [2019-09-08 12:17:32,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:32,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:32,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:32,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:32,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:33,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:17:33,097 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:17:33,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:17:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:33,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 12:17:33,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:17:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:17:33,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:17:33,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2019-09-08 12:17:33,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:17:33,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:17:33,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:17:33,399 INFO L87 Difference]: Start difference. First operand 77267 states and 111218 transitions. Second operand 11 states. [2019-09-08 12:17:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:53,025 INFO L93 Difference]: Finished difference Result 279477 states and 402979 transitions. [2019-09-08 12:17:53,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:17:53,025 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2019-09-08 12:17:53,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:53,303 INFO L225 Difference]: With dead ends: 279477 [2019-09-08 12:17:53,303 INFO L226 Difference]: Without dead ends: 235859 [2019-09-08 12:17:53,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=461, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:17:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235859 states. [2019-09-08 12:18:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235859 to 98963. [2019-09-08 12:18:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98963 states. [2019-09-08 12:18:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98963 states to 98963 states and 142514 transitions. [2019-09-08 12:18:04,843 INFO L78 Accepts]: Start accepts. Automaton has 98963 states and 142514 transitions. Word has length 115 [2019-09-08 12:18:04,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:04,843 INFO L475 AbstractCegarLoop]: Abstraction has 98963 states and 142514 transitions. [2019-09-08 12:18:04,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:18:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 98963 states and 142514 transitions. [2019-09-08 12:18:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:18:04,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:04,853 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:18:04,854 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:04,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:04,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2048808134, now seen corresponding path program 1 times [2019-09-08 12:18:04,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:04,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:04,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:04,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:04,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:18:05,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:05,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:18:05,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:18:05,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:18:05,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:18:05,075 INFO L87 Difference]: Start difference. First operand 98963 states and 142514 transitions. Second operand 8 states. [2019-09-08 12:18:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:23,721 INFO L93 Difference]: Finished difference Result 258913 states and 373273 transitions. [2019-09-08 12:18:23,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:18:23,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-08 12:18:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:23,924 INFO L225 Difference]: With dead ends: 258913 [2019-09-08 12:18:23,924 INFO L226 Difference]: Without dead ends: 193599 [2019-09-08 12:18:23,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:18:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193599 states. [2019-09-08 12:18:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193599 to 113459. [2019-09-08 12:18:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113459 states. [2019-09-08 12:18:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113459 states to 113459 states and 163090 transitions. [2019-09-08 12:18:34,988 INFO L78 Accepts]: Start accepts. Automaton has 113459 states and 163090 transitions. Word has length 115 [2019-09-08 12:18:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:34,988 INFO L475 AbstractCegarLoop]: Abstraction has 113459 states and 163090 transitions. [2019-09-08 12:18:34,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:18:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand 113459 states and 163090 transitions. [2019-09-08 12:18:34,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:18:34,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:34,998 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:18:34,999 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:34,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:34,999 INFO L82 PathProgramCache]: Analyzing trace with hash 333801332, now seen corresponding path program 1 times [2019-09-08 12:18:34,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:34,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:35,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:35,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:35,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:35,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:18:35,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:18:35,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:35,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 12:18:35,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:18:35,399 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 12:18:35,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:18:35,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2019-09-08 12:18:35,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:18:35,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:18:35,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:18:35,404 INFO L87 Difference]: Start difference. First operand 113459 states and 163090 transitions. Second operand 11 states. [2019-09-08 12:19:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:02,560 INFO L93 Difference]: Finished difference Result 343253 states and 494691 transitions. [2019-09-08 12:19:02,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:19:02,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2019-09-08 12:19:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:02,897 INFO L225 Difference]: With dead ends: 343253 [2019-09-08 12:19:02,897 INFO L226 Difference]: Without dead ends: 277939 [2019-09-08 12:19:02,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=461, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:19:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277939 states. [2019-09-08 12:19:19,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277939 to 127923. [2019-09-08 12:19:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127923 states. [2019-09-08 12:19:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127923 states to 127923 states and 183954 transitions. [2019-09-08 12:19:20,065 INFO L78 Accepts]: Start accepts. Automaton has 127923 states and 183954 transitions. Word has length 115 [2019-09-08 12:19:20,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:20,066 INFO L475 AbstractCegarLoop]: Abstraction has 127923 states and 183954 transitions. [2019-09-08 12:19:20,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:19:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 127923 states and 183954 transitions. [2019-09-08 12:19:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:19:20,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:20,076 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:19:20,076 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:20,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:20,076 INFO L82 PathProgramCache]: Analyzing trace with hash 90667176, now seen corresponding path program 1 times [2019-09-08 12:19:20,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:20,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:20,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:20,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:20,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:19:20,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:19:20,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:19:20,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:19:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:20,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 12:19:20,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:19:20,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:19:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:20,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:19:20,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10] total 12 [2019-09-08 12:19:20,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:19:20,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:19:20,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:19:20,773 INFO L87 Difference]: Start difference. First operand 127923 states and 183954 transitions. Second operand 12 states. [2019-09-08 12:20:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:50,343 INFO L93 Difference]: Finished difference Result 802623 states and 1141736 transitions. [2019-09-08 12:20:50,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 12:20:50,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 116 [2019-09-08 12:20:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:51,291 INFO L225 Difference]: With dead ends: 802623 [2019-09-08 12:20:51,291 INFO L226 Difference]: Without dead ends: 674749 [2019-09-08 12:20:51,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=955, Invalid=2951, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 12:20:52,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674749 states. [2019-09-08 12:21:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674749 to 366435. [2019-09-08 12:21:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366435 states. [2019-09-08 12:21:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366435 states to 366435 states and 517890 transitions. [2019-09-08 12:21:42,852 INFO L78 Accepts]: Start accepts. Automaton has 366435 states and 517890 transitions. Word has length 116 [2019-09-08 12:21:42,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:42,852 INFO L475 AbstractCegarLoop]: Abstraction has 366435 states and 517890 transitions. [2019-09-08 12:21:42,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:21:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 366435 states and 517890 transitions. [2019-09-08 12:21:42,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:21:42,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:42,868 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:21:42,869 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:42,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:42,869 INFO L82 PathProgramCache]: Analyzing trace with hash -827392191, now seen corresponding path program 1 times [2019-09-08 12:21:42,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:42,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:42,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:42,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:42,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:43,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:21:43,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:21:43,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:43,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 12:21:43,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:21:43,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:21:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:43,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:21:43,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-08 12:21:43,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:21:43,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:21:43,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:21:43,615 INFO L87 Difference]: Start difference. First operand 366435 states and 517890 transitions. Second operand 17 states. [2019-09-08 12:23:56,308 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49