java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:39:14,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:39:14,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:39:14,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:39:14,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:39:14,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:39:14,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:39:14,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:39:14,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:39:14,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:39:14,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:39:14,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:39:14,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:39:14,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:39:14,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:39:14,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:39:15,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:39:15,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:39:15,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:39:15,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:39:15,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:39:15,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:39:15,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:39:15,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:39:15,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:39:15,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:39:15,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:39:15,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:39:15,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:39:15,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:39:15,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:39:15,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:39:15,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:39:15,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:39:15,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:39:15,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:39:15,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:39:15,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:39:15,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:39:15,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:39:15,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:39:15,021 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 13:39:15,036 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:39:15,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:39:15,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:39:15,037 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:39:15,038 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:39:15,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:39:15,038 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:39:15,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:39:15,038 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:39:15,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:39:15,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:39:15,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:39:15,039 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:39:15,039 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:39:15,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:39:15,040 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:39:15,040 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:39:15,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:39:15,040 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:39:15,041 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:39:15,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:39:15,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:39:15,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:39:15,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:39:15,042 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:39:15,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:39:15,042 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:39:15,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:39:15,042 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:39:15,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:39:15,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:39:15,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:39:15,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:39:15,103 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:39:15,104 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 13:39:15,176 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a893b44ff/b4243f610ff54c079358a90d46222e34/FLAGd756536e2 [2019-09-08 13:39:15,969 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:39:15,972 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 13:39:16,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a893b44ff/b4243f610ff54c079358a90d46222e34/FLAGd756536e2 [2019-09-08 13:39:16,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a893b44ff/b4243f610ff54c079358a90d46222e34 [2019-09-08 13:39:16,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:39:16,066 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:39:16,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:39:16,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:39:16,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:39:16,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:39:16" (1/1) ... [2019-09-08 13:39:16,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e6d535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:16, skipping insertion in model container [2019-09-08 13:39:16,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:39:16" (1/1) ... [2019-09-08 13:39:16,083 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:39:16,344 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:39:18,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:39:18,861 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:39:20,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:39:20,667 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:39:20,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:20 WrapperNode [2019-09-08 13:39:20,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:39:20,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:39:20,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:39:20,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:39:20,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:20" (1/1) ... [2019-09-08 13:39:20,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:20" (1/1) ... [2019-09-08 13:39:20,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:20" (1/1) ... [2019-09-08 13:39:20,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:20" (1/1) ... [2019-09-08 13:39:20,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:20" (1/1) ... [2019-09-08 13:39:20,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:20" (1/1) ... [2019-09-08 13:39:20,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:20" (1/1) ... [2019-09-08 13:39:21,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:39:21,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:39:21,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:39:21,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:39:21,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:20" (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 13:39:21,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:39:21,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:39:21,134 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:39:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:39:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:39:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:39:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:39:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:39:21,137 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:39:21,137 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:39:21,138 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:39:21,138 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:39:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:39:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:39:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 13:39:21,141 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:39:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:39:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:39:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:39:21,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:39:28,169 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:39:28,169 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:39:28,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:39:28 BoogieIcfgContainer [2019-09-08 13:39:28,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:39:28,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:39:28,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:39:28,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:39:28,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:39:16" (1/3) ... [2019-09-08 13:39:28,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff0b4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:39:28, skipping insertion in model container [2019-09-08 13:39:28,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:39:20" (2/3) ... [2019-09-08 13:39:28,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff0b4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:39:28, skipping insertion in model container [2019-09-08 13:39:28,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:39:28" (3/3) ... [2019-09-08 13:39:28,188 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 13:39:28,204 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:39:28,235 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 13:39:28,258 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 13:39:28,308 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:39:28,309 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:39:28,309 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:39:28,310 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:39:28,310 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:39:28,310 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:39:28,310 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:39:28,310 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:39:28,310 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:39:28,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states. [2019-09-08 13:39:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:39:28,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:28,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:28,416 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:28,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:28,423 INFO L82 PathProgramCache]: Analyzing trace with hash 652537025, now seen corresponding path program 1 times [2019-09-08 13:39:28,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:28,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:28,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:28,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:28,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:29,371 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 13:39:29,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:29,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:39:29,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:39:29,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:39:29,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:39:29,408 INFO L87 Difference]: Start difference. First operand 2515 states. Second operand 4 states. [2019-09-08 13:39:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:29,872 INFO L93 Difference]: Finished difference Result 4483 states and 7776 transitions. [2019-09-08 13:39:29,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:39:29,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-08 13:39:29,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:29,915 INFO L225 Difference]: With dead ends: 4483 [2019-09-08 13:39:29,915 INFO L226 Difference]: Without dead ends: 2511 [2019-09-08 13:39:29,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:39:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2019-09-08 13:39:30,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2511. [2019-09-08 13:39:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2511 states. [2019-09-08 13:39:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 4317 transitions. [2019-09-08 13:39:30,149 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 4317 transitions. Word has length 322 [2019-09-08 13:39:30,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:30,152 INFO L475 AbstractCegarLoop]: Abstraction has 2511 states and 4317 transitions. [2019-09-08 13:39:30,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:39:30,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 4317 transitions. [2019-09-08 13:39:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-09-08 13:39:30,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:30,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:30,173 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:30,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:30,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1673753508, now seen corresponding path program 1 times [2019-09-08 13:39:30,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:30,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:30,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:30,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:30,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:30,749 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 13:39:30,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:30,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:30,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:30,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:30,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:30,757 INFO L87 Difference]: Start difference. First operand 2511 states and 4317 transitions. Second operand 3 states. [2019-09-08 13:39:31,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:31,218 INFO L93 Difference]: Finished difference Result 6234 states and 10658 transitions. [2019-09-08 13:39:31,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:31,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 386 [2019-09-08 13:39:31,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:31,246 INFO L225 Difference]: With dead ends: 6234 [2019-09-08 13:39:31,246 INFO L226 Difference]: Without dead ends: 4315 [2019-09-08 13:39:31,252 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 13:39:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4315 states. [2019-09-08 13:39:31,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4315 to 4311. [2019-09-08 13:39:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4311 states. [2019-09-08 13:39:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 7334 transitions. [2019-09-08 13:39:31,416 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 7334 transitions. Word has length 386 [2019-09-08 13:39:31,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:31,417 INFO L475 AbstractCegarLoop]: Abstraction has 4311 states and 7334 transitions. [2019-09-08 13:39:31,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 7334 transitions. [2019-09-08 13:39:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 13:39:31,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:31,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:31,435 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:31,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:31,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1267474840, now seen corresponding path program 1 times [2019-09-08 13:39:31,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:31,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:31,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:31,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:31,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:31,852 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 13:39:31,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:31,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:31,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:31,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:31,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:31,855 INFO L87 Difference]: Start difference. First operand 4311 states and 7334 transitions. Second operand 3 states. [2019-09-08 13:39:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:32,120 INFO L93 Difference]: Finished difference Result 7280 states and 12405 transitions. [2019-09-08 13:39:32,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:32,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-09-08 13:39:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:32,155 INFO L225 Difference]: With dead ends: 7280 [2019-09-08 13:39:32,156 INFO L226 Difference]: Without dead ends: 5350 [2019-09-08 13:39:32,174 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 13:39:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5350 states. [2019-09-08 13:39:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5350 to 5346. [2019-09-08 13:39:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5346 states. [2019-09-08 13:39:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5346 states to 5346 states and 9097 transitions. [2019-09-08 13:39:32,356 INFO L78 Accepts]: Start accepts. Automaton has 5346 states and 9097 transitions. Word has length 391 [2019-09-08 13:39:32,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:32,358 INFO L475 AbstractCegarLoop]: Abstraction has 5346 states and 9097 transitions. [2019-09-08 13:39:32,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 5346 states and 9097 transitions. [2019-09-08 13:39:32,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-08 13:39:32,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:32,376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:32,377 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:32,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:32,377 INFO L82 PathProgramCache]: Analyzing trace with hash -105335867, now seen corresponding path program 1 times [2019-09-08 13:39:32,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:32,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:32,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:32,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:32,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:32,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:39:32,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:32,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:32,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:32,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:32,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:32,839 INFO L87 Difference]: Start difference. First operand 5346 states and 9097 transitions. Second operand 3 states. [2019-09-08 13:39:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:33,444 INFO L93 Difference]: Finished difference Result 14521 states and 24616 transitions. [2019-09-08 13:39:33,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:33,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 395 [2019-09-08 13:39:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:33,493 INFO L225 Difference]: With dead ends: 14521 [2019-09-08 13:39:33,493 INFO L226 Difference]: Without dead ends: 9795 [2019-09-08 13:39:33,507 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 13:39:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9795 states. [2019-09-08 13:39:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9795 to 9791. [2019-09-08 13:39:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9791 states. [2019-09-08 13:39:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9791 states to 9791 states and 16577 transitions. [2019-09-08 13:39:33,947 INFO L78 Accepts]: Start accepts. Automaton has 9791 states and 16577 transitions. Word has length 395 [2019-09-08 13:39:33,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:33,948 INFO L475 AbstractCegarLoop]: Abstraction has 9791 states and 16577 transitions. [2019-09-08 13:39:33,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 9791 states and 16577 transitions. [2019-09-08 13:39:33,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-09-08 13:39:33,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:33,984 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:33,984 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:33,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:33,985 INFO L82 PathProgramCache]: Analyzing trace with hash -2042629109, now seen corresponding path program 1 times [2019-09-08 13:39:33,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:33,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:33,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:33,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:33,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:34,348 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 13:39:34,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:34,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:34,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:34,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:34,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:34,350 INFO L87 Difference]: Start difference. First operand 9791 states and 16577 transitions. Second operand 3 states. [2019-09-08 13:39:34,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:34,769 INFO L93 Difference]: Finished difference Result 17611 states and 29837 transitions. [2019-09-08 13:39:34,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:34,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 400 [2019-09-08 13:39:34,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:34,823 INFO L225 Difference]: With dead ends: 17611 [2019-09-08 13:39:34,824 INFO L226 Difference]: Without dead ends: 12874 [2019-09-08 13:39:34,838 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 13:39:34,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12874 states. [2019-09-08 13:39:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12874 to 12870. [2019-09-08 13:39:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12870 states. [2019-09-08 13:39:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12870 states to 12870 states and 21779 transitions. [2019-09-08 13:39:35,327 INFO L78 Accepts]: Start accepts. Automaton has 12870 states and 21779 transitions. Word has length 400 [2019-09-08 13:39:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:35,328 INFO L475 AbstractCegarLoop]: Abstraction has 12870 states and 21779 transitions. [2019-09-08 13:39:35,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 12870 states and 21779 transitions. [2019-09-08 13:39:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-08 13:39:35,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:35,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:35,359 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:35,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:35,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1055821996, now seen corresponding path program 1 times [2019-09-08 13:39:35,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:35,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:35,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:35,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:35,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:35,681 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 13:39:35,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:35,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:35,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:35,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:35,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:35,683 INFO L87 Difference]: Start difference. First operand 12870 states and 21779 transitions. Second operand 3 states. [2019-09-08 13:39:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:36,448 INFO L93 Difference]: Finished difference Result 36509 states and 61606 transitions. [2019-09-08 13:39:36,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:36,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 404 [2019-09-08 13:39:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:36,534 INFO L225 Difference]: With dead ends: 36509 [2019-09-08 13:39:36,535 INFO L226 Difference]: Without dead ends: 24287 [2019-09-08 13:39:36,585 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 13:39:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24287 states. [2019-09-08 13:39:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24287 to 24283. [2019-09-08 13:39:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24283 states. [2019-09-08 13:39:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24283 states to 24283 states and 40885 transitions. [2019-09-08 13:39:38,246 INFO L78 Accepts]: Start accepts. Automaton has 24283 states and 40885 transitions. Word has length 404 [2019-09-08 13:39:38,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:38,248 INFO L475 AbstractCegarLoop]: Abstraction has 24283 states and 40885 transitions. [2019-09-08 13:39:38,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand 24283 states and 40885 transitions. [2019-09-08 13:39:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-08 13:39:38,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:38,298 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:38,299 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:38,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:38,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1223038760, now seen corresponding path program 1 times [2019-09-08 13:39:38,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:38,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:38,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:38,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:38,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:38,637 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 13:39:38,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:38,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:38,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:38,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:38,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:38,640 INFO L87 Difference]: Start difference. First operand 24283 states and 40885 transitions. Second operand 3 states. [2019-09-08 13:39:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:39,531 INFO L93 Difference]: Finished difference Result 44887 states and 75675 transitions. [2019-09-08 13:39:39,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:39,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 409 [2019-09-08 13:39:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:39,611 INFO L225 Difference]: With dead ends: 44887 [2019-09-08 13:39:39,611 INFO L226 Difference]: Without dead ends: 32654 [2019-09-08 13:39:39,648 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 13:39:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32654 states. [2019-09-08 13:39:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32654 to 32650. [2019-09-08 13:39:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32650 states. [2019-09-08 13:39:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32650 states to 32650 states and 54937 transitions. [2019-09-08 13:39:40,556 INFO L78 Accepts]: Start accepts. Automaton has 32650 states and 54937 transitions. Word has length 409 [2019-09-08 13:39:40,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:40,556 INFO L475 AbstractCegarLoop]: Abstraction has 32650 states and 54937 transitions. [2019-09-08 13:39:40,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 32650 states and 54937 transitions. [2019-09-08 13:39:40,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-08 13:39:40,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:40,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:40,613 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:40,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:40,614 INFO L82 PathProgramCache]: Analyzing trace with hash -963797931, now seen corresponding path program 1 times [2019-09-08 13:39:40,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:40,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:40,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:40,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:40,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:41,120 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 13:39:41,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:41,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:41,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:41,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:41,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:41,122 INFO L87 Difference]: Start difference. First operand 32650 states and 54937 transitions. Second operand 3 states. [2019-09-08 13:39:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:42,287 INFO L93 Difference]: Finished difference Result 94233 states and 158132 transitions. [2019-09-08 13:39:42,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:42,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 413 [2019-09-08 13:39:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:42,426 INFO L225 Difference]: With dead ends: 94233 [2019-09-08 13:39:42,427 INFO L226 Difference]: Without dead ends: 62259 [2019-09-08 13:39:42,508 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 13:39:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62259 states. [2019-09-08 13:39:45,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62259 to 62255. [2019-09-08 13:39:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62255 states. [2019-09-08 13:39:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62255 states to 62255 states and 104167 transitions. [2019-09-08 13:39:45,450 INFO L78 Accepts]: Start accepts. Automaton has 62255 states and 104167 transitions. Word has length 413 [2019-09-08 13:39:45,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:45,451 INFO L475 AbstractCegarLoop]: Abstraction has 62255 states and 104167 transitions. [2019-09-08 13:39:45,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:45,451 INFO L276 IsEmpty]: Start isEmpty. Operand 62255 states and 104167 transitions. [2019-09-08 13:39:45,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-09-08 13:39:45,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:45,513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:45,513 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:45,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:45,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1387016581, now seen corresponding path program 1 times [2019-09-08 13:39:45,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:45,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:45,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:45,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:45,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:45,901 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 13:39:45,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:45,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:45,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:45,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:45,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:45,903 INFO L87 Difference]: Start difference. First operand 62255 states and 104167 transitions. Second operand 3 states. [2019-09-08 13:39:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:47,354 INFO L93 Difference]: Finished difference Result 116011 states and 194409 transitions. [2019-09-08 13:39:47,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:47,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-09-08 13:39:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:47,463 INFO L225 Difference]: With dead ends: 116011 [2019-09-08 13:39:47,463 INFO L226 Difference]: Without dead ends: 84026 [2019-09-08 13:39:47,521 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 13:39:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84026 states. [2019-09-08 13:39:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84026 to 84022. [2019-09-08 13:39:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84022 states. [2019-09-08 13:39:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84022 states to 84022 states and 140431 transitions. [2019-09-08 13:39:50,867 INFO L78 Accepts]: Start accepts. Automaton has 84022 states and 140431 transitions. Word has length 418 [2019-09-08 13:39:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:50,868 INFO L475 AbstractCegarLoop]: Abstraction has 84022 states and 140431 transitions. [2019-09-08 13:39:50,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 84022 states and 140431 transitions. [2019-09-08 13:39:50,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-09-08 13:39:50,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:50,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:50,948 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:50,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:50,949 INFO L82 PathProgramCache]: Analyzing trace with hash 947745956, now seen corresponding path program 1 times [2019-09-08 13:39:50,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:50,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:50,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:50,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:50,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:51,613 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 13:39:51,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:51,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:51,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:51,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:51,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:51,615 INFO L87 Difference]: Start difference. First operand 84022 states and 140431 transitions. Second operand 3 states. [2019-09-08 13:39:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:55,752 INFO L93 Difference]: Finished difference Result 243661 states and 406034 transitions. [2019-09-08 13:39:55,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:55,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 422 [2019-09-08 13:39:55,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:55,949 INFO L225 Difference]: With dead ends: 243661 [2019-09-08 13:39:55,949 INFO L226 Difference]: Without dead ends: 160343 [2019-09-08 13:39:56,043 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 13:39:56,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160343 states. [2019-09-08 13:40:01,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160343 to 160339. [2019-09-08 13:40:01,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160339 states. [2019-09-08 13:40:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160339 states to 160339 states and 266233 transitions. [2019-09-08 13:40:01,863 INFO L78 Accepts]: Start accepts. Automaton has 160339 states and 266233 transitions. Word has length 422 [2019-09-08 13:40:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:01,863 INFO L475 AbstractCegarLoop]: Abstraction has 160339 states and 266233 transitions. [2019-09-08 13:40:01,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 160339 states and 266233 transitions. [2019-09-08 13:40:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-09-08 13:40:01,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:01,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:40:01,975 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:01,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:01,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1032358384, now seen corresponding path program 1 times [2019-09-08 13:40:01,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:01,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:01,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:01,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:01,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:02,338 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 13:40:02,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:02,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:02,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:02,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:02,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:02,341 INFO L87 Difference]: Start difference. First operand 160339 states and 266233 transitions. Second operand 3 states. [2019-09-08 13:40:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:05,749 INFO L93 Difference]: Finished difference Result 298271 states and 495971 transitions. [2019-09-08 13:40:05,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:05,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 427 [2019-09-08 13:40:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:06,002 INFO L225 Difference]: With dead ends: 298271 [2019-09-08 13:40:06,002 INFO L226 Difference]: Without dead ends: 214942 [2019-09-08 13:40:06,097 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 13:40:06,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214942 states. [2019-09-08 13:40:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214942 to 214938. [2019-09-08 13:40:14,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214938 states. [2019-09-08 13:40:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214938 states to 214938 states and 356165 transitions. [2019-09-08 13:40:15,448 INFO L78 Accepts]: Start accepts. Automaton has 214938 states and 356165 transitions. Word has length 427 [2019-09-08 13:40:15,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:15,449 INFO L475 AbstractCegarLoop]: Abstraction has 214938 states and 356165 transitions. [2019-09-08 13:40:15,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 214938 states and 356165 transitions. [2019-09-08 13:40:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-09-08 13:40:15,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:15,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:40:15,603 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:15,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:15,603 INFO L82 PathProgramCache]: Analyzing trace with hash 592132413, now seen corresponding path program 1 times [2019-09-08 13:40:15,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:15,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:15,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:15,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:15,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:16,658 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 13:40:16,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:16,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:40:16,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:40:16,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:40:16,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:40:16,660 INFO L87 Difference]: Start difference. First operand 214938 states and 356165 transitions. Second operand 7 states. [2019-09-08 13:41:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:41:02,628 INFO L93 Difference]: Finished difference Result 1594431 states and 2650031 transitions. [2019-09-08 13:41:02,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 13:41:02,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 431 [2019-09-08 13:41:02,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:41:04,748 INFO L225 Difference]: With dead ends: 1594431 [2019-09-08 13:41:04,748 INFO L226 Difference]: Without dead ends: 1380199 [2019-09-08 13:41:05,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 13:41:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380199 states. [2019-09-08 13:41:44,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380199 to 427813. [2019-09-08 13:41:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427813 states. [2019-09-08 13:41:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427813 states to 427813 states and 706031 transitions. [2019-09-08 13:41:45,507 INFO L78 Accepts]: Start accepts. Automaton has 427813 states and 706031 transitions. Word has length 431 [2019-09-08 13:41:45,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:41:45,507 INFO L475 AbstractCegarLoop]: Abstraction has 427813 states and 706031 transitions. [2019-09-08 13:41:45,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:41:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 427813 states and 706031 transitions. [2019-09-08 13:41:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-09-08 13:41:45,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:41:45,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:45,786 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:41:45,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:41:45,786 INFO L82 PathProgramCache]: Analyzing trace with hash 586524213, now seen corresponding path program 1 times [2019-09-08 13:41:45,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:41:45,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:41:45,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:45,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:41:45,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:41:47,638 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 13:41:47,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:41:47,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:41:47,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:41:47,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:41:47,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:41:47,640 INFO L87 Difference]: Start difference. First operand 427813 states and 706031 transitions. Second operand 4 states. [2019-09-08 13:42:34,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:42:34,171 INFO L93 Difference]: Finished difference Result 1272473 states and 2107267 transitions. [2019-09-08 13:42:34,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:42:34,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-09-08 13:42:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:42:35,447 INFO L225 Difference]: With dead ends: 1272473 [2019-09-08 13:42:35,447 INFO L226 Difference]: Without dead ends: 845366 [2019-09-08 13:42:35,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:42:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845366 states. [2019-09-08 13:43:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845366 to 705994. [2019-09-08 13:43:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705994 states. [2019-09-08 13:43:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705994 states to 705994 states and 1165461 transitions. [2019-09-08 13:43:25,684 INFO L78 Accepts]: Start accepts. Automaton has 705994 states and 1165461 transitions. Word has length 433 [2019-09-08 13:43:25,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:43:25,685 INFO L475 AbstractCegarLoop]: Abstraction has 705994 states and 1165461 transitions. [2019-09-08 13:43:25,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:43:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand 705994 states and 1165461 transitions. [2019-09-08 13:43:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-09-08 13:43:26,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:43:26,214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:43:26,214 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:43:26,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:43:26,214 INFO L82 PathProgramCache]: Analyzing trace with hash -713679510, now seen corresponding path program 1 times [2019-09-08 13:43:26,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:43:26,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:43:26,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:43:26,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:43:26,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:43:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:43:26,518 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 13:43:26,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:43:26,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:43:26,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:43:26,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:43:26,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:43:26,520 INFO L87 Difference]: Start difference. First operand 705994 states and 1165461 transitions. Second operand 4 states. [2019-09-08 13:44:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:44:43,475 INFO L93 Difference]: Finished difference Result 2091797 states and 3457188 transitions. [2019-09-08 13:44:43,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:44:43,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2019-09-08 13:44:43,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:44:46,446 INFO L225 Difference]: With dead ends: 2091797 [2019-09-08 13:44:46,447 INFO L226 Difference]: Without dead ends: 1386509 [2019-09-08 13:44:46,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:44:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386509 states. [2019-09-08 13:46:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386509 to 1160205. [2019-09-08 13:46:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160205 states. [2019-09-08 13:46:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160205 states to 1160205 states and 1910569 transitions. [2019-09-08 13:46:26,548 INFO L78 Accepts]: Start accepts. Automaton has 1160205 states and 1910569 transitions. Word has length 434 [2019-09-08 13:46:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:46:26,549 INFO L475 AbstractCegarLoop]: Abstraction has 1160205 states and 1910569 transitions. [2019-09-08 13:46:26,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:46:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1160205 states and 1910569 transitions. [2019-09-08 13:46:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-09-08 13:46:27,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:46:27,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:46:27,594 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:46:27,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:46:27,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1872307236, now seen corresponding path program 1 times [2019-09-08 13:46:27,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:46:27,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:46:27,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:46:27,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:46:27,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:46:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:46:28,194 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 13:46:28,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:46:28,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:46:28,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:46:28,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:46:28,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:46:28,198 INFO L87 Difference]: Start difference. First operand 1160205 states and 1910569 transitions. Second operand 4 states.