java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:17:37,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:17:38,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:17:38,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:17:38,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:17:38,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:17:38,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:17:38,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:17:38,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:17:38,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:17:38,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:17:38,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:17:38,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:17:38,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:17:38,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:17:38,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:17:38,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:17:38,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:17:38,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:17:38,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:17:38,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:17:38,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:17:38,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:17:38,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:17:38,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:17:38,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:17:38,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:17:38,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:17:38,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:17:38,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:17:38,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:17:38,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:17:38,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:17:38,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:17:38,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:17:38,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:17:38,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:17:38,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:17:38,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:17:38,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:17:38,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:17:38,046 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:17:38,060 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:17:38,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:17:38,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:17:38,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:17:38,062 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:17:38,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:17:38,062 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:17:38,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:17:38,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:17:38,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:17:38,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:17:38,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:17:38,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:17:38,064 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:17:38,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:17:38,064 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:17:38,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:17:38,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:17:38,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:17:38,065 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:17:38,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:17:38,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:17:38,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:17:38,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:17:38,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:17:38,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:17:38,066 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:17:38,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:17:38,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:17:38,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:17:38,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:17:38,113 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:17:38,115 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:17:38,115 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:17:38,116 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c [2019-09-08 12:17:38,193 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a471d1382/dcf7e22d77bc44df8bcfd9a3451b3da7/FLAG53ee17297 [2019-09-08 12:17:38,984 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:17:38,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c [2019-09-08 12:17:39,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a471d1382/dcf7e22d77bc44df8bcfd9a3451b3da7/FLAG53ee17297 [2019-09-08 12:17:39,519 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a471d1382/dcf7e22d77bc44df8bcfd9a3451b3da7 [2019-09-08 12:17:39,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:17:39,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:17:39,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:17:39,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:17:39,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:17:39,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:17:39" (1/1) ... [2019-09-08 12:17:39,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52660538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:17:39, skipping insertion in model container [2019-09-08 12:17:39,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:17:39" (1/1) ... [2019-09-08 12:17:39,551 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:17:39,735 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:17:41,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:17:41,321 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:17:41,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:17:41,948 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:17:41,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:17:41 WrapperNode [2019-09-08 12:17:41,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:17:41,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:17:41,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:17:41,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:17:41,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:17:41" (1/1) ... [2019-09-08 12:17:41,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:17:41" (1/1) ... [2019-09-08 12:17:42,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:17:41" (1/1) ... [2019-09-08 12:17:42,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:17:41" (1/1) ... [2019-09-08 12:17:42,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:17:41" (1/1) ... [2019-09-08 12:17:42,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:17:41" (1/1) ... [2019-09-08 12:17:42,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:17:41" (1/1) ... [2019-09-08 12:17:42,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:17:42,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:17:42,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:17:42,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:17:42,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:17:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:17:42,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:17:42,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:17:42,292 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:17:42,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:17:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:17:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:17:42,294 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:17:42,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:17:42,294 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:17:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:17:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:17:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:17:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:17:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:17:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:17:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:17:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:17:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:17:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:17:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:17:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:17:45,843 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:17:45,844 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:17:45,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:17:45 BoogieIcfgContainer [2019-09-08 12:17:45,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:17:45,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:17:45,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:17:45,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:17:45,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:17:39" (1/3) ... [2019-09-08 12:17:45,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42514a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:17:45, skipping insertion in model container [2019-09-08 12:17:45,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:17:41" (2/3) ... [2019-09-08 12:17:45,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42514a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:17:45, skipping insertion in model container [2019-09-08 12:17:45,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:17:45" (3/3) ... [2019-09-08 12:17:45,856 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c [2019-09-08 12:17:45,868 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:17:45,879 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-08 12:17:45,898 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-08 12:17:45,942 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:17:45,943 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:17:45,943 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:17:45,944 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:17:45,944 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:17:45,944 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:17:45,944 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:17:45,944 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:17:45,944 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:17:45,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states. [2019-09-08 12:17:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:17:46,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:46,016 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] [2019-09-08 12:17:46,018 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:46,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:46,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2055427449, now seen corresponding path program 1 times [2019-09-08 12:17:46,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:46,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:46,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:46,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:46,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:46,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:46,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:17:46,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:17:46,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:17:46,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:17:46,899 INFO L87 Difference]: Start difference. First operand 1136 states. Second operand 5 states. [2019-09-08 12:17:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:48,311 INFO L93 Difference]: Finished difference Result 2071 states and 3590 transitions. [2019-09-08 12:17:48,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:17:48,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-08 12:17:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:48,341 INFO L225 Difference]: With dead ends: 2071 [2019-09-08 12:17:48,341 INFO L226 Difference]: Without dead ends: 1227 [2019-09-08 12:17:48,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:17:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2019-09-08 12:17:48,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1147. [2019-09-08 12:17:48,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-09-08 12:17:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1534 transitions. [2019-09-08 12:17:48,511 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1534 transitions. Word has length 90 [2019-09-08 12:17:48,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:48,512 INFO L475 AbstractCegarLoop]: Abstraction has 1147 states and 1534 transitions. [2019-09-08 12:17:48,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:17:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1534 transitions. [2019-09-08 12:17:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:17:48,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:48,522 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] [2019-09-08 12:17:48,523 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:48,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1438447416, now seen corresponding path program 1 times [2019-09-08 12:17:48,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:48,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:48,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:48,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:48,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:48,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:48,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:17:48,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:17:48,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:17:48,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:17:48,922 INFO L87 Difference]: Start difference. First operand 1147 states and 1534 transitions. Second operand 5 states. [2019-09-08 12:17:49,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:49,578 INFO L93 Difference]: Finished difference Result 1990 states and 2733 transitions. [2019-09-08 12:17:49,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:17:49,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-08 12:17:49,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:49,586 INFO L225 Difference]: With dead ends: 1990 [2019-09-08 12:17:49,587 INFO L226 Difference]: Without dead ends: 1022 [2019-09-08 12:17:49,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:17:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2019-09-08 12:17:49,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2019-09-08 12:17:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2019-09-08 12:17:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1391 transitions. [2019-09-08 12:17:49,655 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1391 transitions. Word has length 91 [2019-09-08 12:17:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:49,655 INFO L475 AbstractCegarLoop]: Abstraction has 1022 states and 1391 transitions. [2019-09-08 12:17:49,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:17:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1391 transitions. [2019-09-08 12:17:49,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:17:49,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:49,659 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] [2019-09-08 12:17:49,660 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:49,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:49,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1744743141, now seen corresponding path program 1 times [2019-09-08 12:17:49,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:49,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:49,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:49,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:49,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:49,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:49,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:17:49,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:17:49,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:17:49,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:17:49,818 INFO L87 Difference]: Start difference. First operand 1022 states and 1391 transitions. Second operand 5 states. [2019-09-08 12:17:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:50,469 INFO L93 Difference]: Finished difference Result 1865 states and 2588 transitions. [2019-09-08 12:17:50,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:17:50,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-08 12:17:50,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:50,475 INFO L225 Difference]: With dead ends: 1865 [2019-09-08 12:17:50,475 INFO L226 Difference]: Without dead ends: 964 [2019-09-08 12:17:50,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:17:50,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-09-08 12:17:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2019-09-08 12:17:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-09-08 12:17:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1323 transitions. [2019-09-08 12:17:50,523 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1323 transitions. Word has length 92 [2019-09-08 12:17:50,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:50,524 INFO L475 AbstractCegarLoop]: Abstraction has 964 states and 1323 transitions. [2019-09-08 12:17:50,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:17:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1323 transitions. [2019-09-08 12:17:50,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:17:50,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:50,528 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] [2019-09-08 12:17:50,528 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:50,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:50,529 INFO L82 PathProgramCache]: Analyzing trace with hash 986983178, now seen corresponding path program 1 times [2019-09-08 12:17:50,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:50,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:50,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:50,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:50,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:50,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:50,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:17:50,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:17:50,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:17:50,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:17:50,675 INFO L87 Difference]: Start difference. First operand 964 states and 1323 transitions. Second operand 5 states. [2019-09-08 12:17:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:51,392 INFO L93 Difference]: Finished difference Result 1807 states and 2518 transitions. [2019-09-08 12:17:51,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:17:51,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 12:17:51,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:51,398 INFO L225 Difference]: With dead ends: 1807 [2019-09-08 12:17:51,398 INFO L226 Difference]: Without dead ends: 938 [2019-09-08 12:17:51,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:17:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-09-08 12:17:51,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2019-09-08 12:17:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2019-09-08 12:17:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1291 transitions. [2019-09-08 12:17:51,450 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1291 transitions. Word has length 93 [2019-09-08 12:17:51,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:51,451 INFO L475 AbstractCegarLoop]: Abstraction has 938 states and 1291 transitions. [2019-09-08 12:17:51,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:17:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1291 transitions. [2019-09-08 12:17:51,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:17:51,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:51,455 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] [2019-09-08 12:17:51,456 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:51,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:51,457 INFO L82 PathProgramCache]: Analyzing trace with hash 925768771, now seen corresponding path program 1 times [2019-09-08 12:17:51,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:51,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:51,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:51,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:51,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:51,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:51,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:17:51,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:17:51,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:17:51,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:17:51,643 INFO L87 Difference]: Start difference. First operand 938 states and 1291 transitions. Second operand 5 states. [2019-09-08 12:17:52,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:52,317 INFO L93 Difference]: Finished difference Result 1781 states and 2484 transitions. [2019-09-08 12:17:52,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:17:52,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-08 12:17:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:52,326 INFO L225 Difference]: With dead ends: 1781 [2019-09-08 12:17:52,326 INFO L226 Difference]: Without dead ends: 919 [2019-09-08 12:17:52,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:17:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-09-08 12:17:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 919. [2019-09-08 12:17:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-09-08 12:17:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1268 transitions. [2019-09-08 12:17:52,384 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1268 transitions. Word has length 94 [2019-09-08 12:17:52,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:52,386 INFO L475 AbstractCegarLoop]: Abstraction has 919 states and 1268 transitions. [2019-09-08 12:17:52,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:17:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1268 transitions. [2019-09-08 12:17:52,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:17:52,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:52,390 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] [2019-09-08 12:17:52,391 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:52,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:52,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2129638404, now seen corresponding path program 1 times [2019-09-08 12:17:52,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:52,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:52,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:52,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:52,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:52,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:52,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:17:52,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:17:52,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:17:52,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:17:52,594 INFO L87 Difference]: Start difference. First operand 919 states and 1268 transitions. Second operand 5 states. [2019-09-08 12:17:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:53,334 INFO L93 Difference]: Finished difference Result 1762 states and 2459 transitions. [2019-09-08 12:17:53,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:17:53,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-08 12:17:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:53,347 INFO L225 Difference]: With dead ends: 1762 [2019-09-08 12:17:53,347 INFO L226 Difference]: Without dead ends: 914 [2019-09-08 12:17:53,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:17:53,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-08 12:17:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2019-09-08 12:17:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:17:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1260 transitions. [2019-09-08 12:17:53,423 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1260 transitions. Word has length 95 [2019-09-08 12:17:53,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:53,425 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1260 transitions. [2019-09-08 12:17:53,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:17:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1260 transitions. [2019-09-08 12:17:53,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:17:53,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:53,431 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] [2019-09-08 12:17:53,432 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:53,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:53,437 INFO L82 PathProgramCache]: Analyzing trace with hash -631577471, now seen corresponding path program 1 times [2019-09-08 12:17:53,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:53,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:53,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:53,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:53,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:53,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:53,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:17:53,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:17:53,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:17:53,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:17:53,909 INFO L87 Difference]: Start difference. First operand 914 states and 1260 transitions. Second operand 8 states. [2019-09-08 12:17:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:55,836 INFO L93 Difference]: Finished difference Result 1663 states and 2231 transitions. [2019-09-08 12:17:55,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:17:55,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-09-08 12:17:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:55,844 INFO L225 Difference]: With dead ends: 1663 [2019-09-08 12:17:55,844 INFO L226 Difference]: Without dead ends: 1243 [2019-09-08 12:17:55,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:17:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2019-09-08 12:17:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 914. [2019-09-08 12:17:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:17:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1259 transitions. [2019-09-08 12:17:55,911 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1259 transitions. Word has length 96 [2019-09-08 12:17:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:55,911 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1259 transitions. [2019-09-08 12:17:55,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:17:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1259 transitions. [2019-09-08 12:17:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:17:55,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:55,914 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] [2019-09-08 12:17:55,915 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:55,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:55,915 INFO L82 PathProgramCache]: Analyzing trace with hash -938716295, now seen corresponding path program 1 times [2019-09-08 12:17:55,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:55,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:55,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:55,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:55,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:56,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:56,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:56,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:17:56,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:17:56,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:17:56,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:17:56,220 INFO L87 Difference]: Start difference. First operand 914 states and 1259 transitions. Second operand 9 states. [2019-09-08 12:17:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:58,565 INFO L93 Difference]: Finished difference Result 1563 states and 2203 transitions. [2019-09-08 12:17:58,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:17:58,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:17:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:58,573 INFO L225 Difference]: With dead ends: 1563 [2019-09-08 12:17:58,573 INFO L226 Difference]: Without dead ends: 1296 [2019-09-08 12:17:58,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:17:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2019-09-08 12:17:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 914. [2019-09-08 12:17:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:17:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1258 transitions. [2019-09-08 12:17:58,637 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1258 transitions. Word has length 96 [2019-09-08 12:17:58,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:58,637 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1258 transitions. [2019-09-08 12:17:58,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:17:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1258 transitions. [2019-09-08 12:17:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:17:58,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:58,641 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] [2019-09-08 12:17:58,641 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:58,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:58,642 INFO L82 PathProgramCache]: Analyzing trace with hash 727798889, now seen corresponding path program 1 times [2019-09-08 12:17:58,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:58,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:58,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:58,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:58,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:58,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:58,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:17:58,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:17:58,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:17:58,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:17:58,896 INFO L87 Difference]: Start difference. First operand 914 states and 1258 transitions. Second operand 9 states. [2019-09-08 12:18:01,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:01,439 INFO L93 Difference]: Finished difference Result 1940 states and 2728 transitions. [2019-09-08 12:18:01,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:01,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:18:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:01,449 INFO L225 Difference]: With dead ends: 1940 [2019-09-08 12:18:01,449 INFO L226 Difference]: Without dead ends: 1742 [2019-09-08 12:18:01,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-09-08 12:18:01,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 914. [2019-09-08 12:18:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1257 transitions. [2019-09-08 12:18:01,512 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1257 transitions. Word has length 96 [2019-09-08 12:18:01,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:01,513 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1257 transitions. [2019-09-08 12:18:01,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1257 transitions. [2019-09-08 12:18:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:18:01,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:01,516 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] [2019-09-08 12:18:01,516 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:01,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:01,517 INFO L82 PathProgramCache]: Analyzing trace with hash 215751310, now seen corresponding path program 1 times [2019-09-08 12:18:01,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:01,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:01,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:01,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:01,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:01,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:01,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:01,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:01,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:01,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:01,759 INFO L87 Difference]: Start difference. First operand 914 states and 1257 transitions. Second operand 9 states. [2019-09-08 12:18:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:03,741 INFO L93 Difference]: Finished difference Result 1856 states and 2591 transitions. [2019-09-08 12:18:03,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:03,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:18:03,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:03,750 INFO L225 Difference]: With dead ends: 1856 [2019-09-08 12:18:03,751 INFO L226 Difference]: Without dead ends: 1690 [2019-09-08 12:18:03,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:03,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-08 12:18:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-08 12:18:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1255 transitions. [2019-09-08 12:18:03,819 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1255 transitions. Word has length 98 [2019-09-08 12:18:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:03,820 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1255 transitions. [2019-09-08 12:18:03,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:03,820 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1255 transitions. [2019-09-08 12:18:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:18:03,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:03,823 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] [2019-09-08 12:18:03,823 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:03,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:03,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1134267655, now seen corresponding path program 1 times [2019-09-08 12:18:03,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:03,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:03,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:03,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:03,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:04,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:04,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:04,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:04,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:04,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:04,053 INFO L87 Difference]: Start difference. First operand 914 states and 1255 transitions. Second operand 9 states. [2019-09-08 12:18:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:06,184 INFO L93 Difference]: Finished difference Result 1988 states and 2786 transitions. [2019-09-08 12:18:06,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:06,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:18:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:06,193 INFO L225 Difference]: With dead ends: 1988 [2019-09-08 12:18:06,193 INFO L226 Difference]: Without dead ends: 1742 [2019-09-08 12:18:06,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-09-08 12:18:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 914. [2019-09-08 12:18:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:06,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1253 transitions. [2019-09-08 12:18:06,268 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1253 transitions. Word has length 98 [2019-09-08 12:18:06,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:06,268 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1253 transitions. [2019-09-08 12:18:06,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1253 transitions. [2019-09-08 12:18:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:18:06,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:06,272 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] [2019-09-08 12:18:06,273 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:06,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:06,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1180953076, now seen corresponding path program 1 times [2019-09-08 12:18:06,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:06,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:06,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:06,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:06,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:06,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:06,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:06,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:06,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:06,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:06,491 INFO L87 Difference]: Start difference. First operand 914 states and 1253 transitions. Second operand 9 states. [2019-09-08 12:18:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:08,908 INFO L93 Difference]: Finished difference Result 1906 states and 2665 transitions. [2019-09-08 12:18:08,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:08,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:18:08,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:08,919 INFO L225 Difference]: With dead ends: 1906 [2019-09-08 12:18:08,919 INFO L226 Difference]: Without dead ends: 1714 [2019-09-08 12:18:08,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-08 12:18:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-08 12:18:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1251 transitions. [2019-09-08 12:18:08,995 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1251 transitions. Word has length 98 [2019-09-08 12:18:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:08,995 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1251 transitions. [2019-09-08 12:18:08,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1251 transitions. [2019-09-08 12:18:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:18:08,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:08,998 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] [2019-09-08 12:18:08,999 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:08,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:08,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1576132324, now seen corresponding path program 1 times [2019-09-08 12:18:08,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:08,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:09,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:09,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:09,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:09,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:09,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:09,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:09,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:09,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:09,206 INFO L87 Difference]: Start difference. First operand 914 states and 1251 transitions. Second operand 9 states. [2019-09-08 12:18:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:11,322 INFO L93 Difference]: Finished difference Result 1698 states and 2378 transitions. [2019-09-08 12:18:11,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:18:11,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:18:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:11,330 INFO L225 Difference]: With dead ends: 1698 [2019-09-08 12:18:11,330 INFO L226 Difference]: Without dead ends: 1296 [2019-09-08 12:18:11,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:18:11,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2019-09-08 12:18:11,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 914. [2019-09-08 12:18:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1249 transitions. [2019-09-08 12:18:11,407 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1249 transitions. Word has length 98 [2019-09-08 12:18:11,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:11,407 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1249 transitions. [2019-09-08 12:18:11,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:11,407 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1249 transitions. [2019-09-08 12:18:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:18:11,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:11,410 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] [2019-09-08 12:18:11,410 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:11,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:11,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1300093119, now seen corresponding path program 1 times [2019-09-08 12:18:11,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:11,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:11,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:11,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:11,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:11,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:11,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:11,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:11,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:11,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:11,618 INFO L87 Difference]: Start difference. First operand 914 states and 1249 transitions. Second operand 9 states. [2019-09-08 12:18:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:14,104 INFO L93 Difference]: Finished difference Result 1887 states and 2634 transitions. [2019-09-08 12:18:14,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:14,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:18:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:14,115 INFO L225 Difference]: With dead ends: 1887 [2019-09-08 12:18:14,115 INFO L226 Difference]: Without dead ends: 1714 [2019-09-08 12:18:14,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:14,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-08 12:18:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-08 12:18:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1248 transitions. [2019-09-08 12:18:14,201 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1248 transitions. Word has length 98 [2019-09-08 12:18:14,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:14,201 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1248 transitions. [2019-09-08 12:18:14,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1248 transitions. [2019-09-08 12:18:14,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:18:14,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:14,204 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] [2019-09-08 12:18:14,205 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:14,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:14,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1810473432, now seen corresponding path program 1 times [2019-09-08 12:18:14,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:14,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:14,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:14,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:14,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:14,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:14,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:14,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:14,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:14,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:14,435 INFO L87 Difference]: Start difference. First operand 914 states and 1248 transitions. Second operand 9 states. [2019-09-08 12:18:16,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:16,534 INFO L93 Difference]: Finished difference Result 1850 states and 2574 transitions. [2019-09-08 12:18:16,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:16,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:18:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:16,540 INFO L225 Difference]: With dead ends: 1850 [2019-09-08 12:18:16,541 INFO L226 Difference]: Without dead ends: 1690 [2019-09-08 12:18:16,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:16,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-08 12:18:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-08 12:18:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1247 transitions. [2019-09-08 12:18:16,622 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1247 transitions. Word has length 98 [2019-09-08 12:18:16,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:16,623 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1247 transitions. [2019-09-08 12:18:16,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1247 transitions. [2019-09-08 12:18:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:18:16,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:16,626 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] [2019-09-08 12:18:16,626 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:16,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:16,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1939924177, now seen corresponding path program 1 times [2019-09-08 12:18:16,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:16,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:16,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:16,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:16,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:16,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:16,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:16,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:16,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:16,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:16,838 INFO L87 Difference]: Start difference. First operand 914 states and 1247 transitions. Second operand 9 states. [2019-09-08 12:18:18,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:18,793 INFO L93 Difference]: Finished difference Result 1855 states and 2577 transitions. [2019-09-08 12:18:18,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:18,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:18:18,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:18,800 INFO L225 Difference]: With dead ends: 1855 [2019-09-08 12:18:18,800 INFO L226 Difference]: Without dead ends: 1690 [2019-09-08 12:18:18,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-08 12:18:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-08 12:18:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1246 transitions. [2019-09-08 12:18:18,883 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1246 transitions. Word has length 98 [2019-09-08 12:18:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:18,883 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1246 transitions. [2019-09-08 12:18:18,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1246 transitions. [2019-09-08 12:18:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:18:18,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:18,886 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] [2019-09-08 12:18:18,887 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:18,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:18,888 INFO L82 PathProgramCache]: Analyzing trace with hash 425886607, now seen corresponding path program 1 times [2019-09-08 12:18:18,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:18,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:18,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:18,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:18,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:19,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:19,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:19,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:19,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:19,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:19,094 INFO L87 Difference]: Start difference. First operand 914 states and 1246 transitions. Second operand 9 states. [2019-09-08 12:18:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:21,713 INFO L93 Difference]: Finished difference Result 1954 states and 2725 transitions. [2019-09-08 12:18:21,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:21,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:18:21,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:21,723 INFO L225 Difference]: With dead ends: 1954 [2019-09-08 12:18:21,723 INFO L226 Difference]: Without dead ends: 1742 [2019-09-08 12:18:21,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:21,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-09-08 12:18:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 914. [2019-09-08 12:18:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1245 transitions. [2019-09-08 12:18:21,812 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1245 transitions. Word has length 98 [2019-09-08 12:18:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:21,813 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1245 transitions. [2019-09-08 12:18:21,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1245 transitions. [2019-09-08 12:18:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:18:21,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:21,815 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] [2019-09-08 12:18:21,816 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:21,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:21,816 INFO L82 PathProgramCache]: Analyzing trace with hash -341357961, now seen corresponding path program 1 times [2019-09-08 12:18:21,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:21,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:21,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:21,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:21,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:22,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:22,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:22,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:22,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:22,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:22,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:22,067 INFO L87 Difference]: Start difference. First operand 914 states and 1245 transitions. Second operand 9 states. [2019-09-08 12:18:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:24,113 INFO L93 Difference]: Finished difference Result 1846 states and 2566 transitions. [2019-09-08 12:18:24,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:24,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:18:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:24,122 INFO L225 Difference]: With dead ends: 1846 [2019-09-08 12:18:24,123 INFO L226 Difference]: Without dead ends: 1690 [2019-09-08 12:18:24,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:24,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-08 12:18:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-08 12:18:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1244 transitions. [2019-09-08 12:18:24,226 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1244 transitions. Word has length 98 [2019-09-08 12:18:24,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:24,226 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1244 transitions. [2019-09-08 12:18:24,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:24,226 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1244 transitions. [2019-09-08 12:18:24,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:18:24,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:24,229 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] [2019-09-08 12:18:24,230 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:24,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash -976253424, now seen corresponding path program 1 times [2019-09-08 12:18:24,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:24,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:24,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:24,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:24,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:24,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:24,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:24,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:24,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:24,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:24,417 INFO L87 Difference]: Start difference. First operand 914 states and 1244 transitions. Second operand 9 states. [2019-09-08 12:18:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:27,008 INFO L93 Difference]: Finished difference Result 1887 states and 2626 transitions. [2019-09-08 12:18:27,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:27,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:18:27,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:27,017 INFO L225 Difference]: With dead ends: 1887 [2019-09-08 12:18:27,017 INFO L226 Difference]: Without dead ends: 1714 [2019-09-08 12:18:27,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:27,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-08 12:18:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-08 12:18:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1243 transitions. [2019-09-08 12:18:27,095 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1243 transitions. Word has length 98 [2019-09-08 12:18:27,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:27,096 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1243 transitions. [2019-09-08 12:18:27,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:27,096 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1243 transitions. [2019-09-08 12:18:27,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:27,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:27,099 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] [2019-09-08 12:18:27,099 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:27,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:27,100 INFO L82 PathProgramCache]: Analyzing trace with hash 130488343, now seen corresponding path program 1 times [2019-09-08 12:18:27,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:27,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:27,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:27,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:27,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:27,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:27,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:27,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:27,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:27,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:27,290 INFO L87 Difference]: Start difference. First operand 914 states and 1243 transitions. Second operand 9 states. [2019-09-08 12:18:29,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:29,481 INFO L93 Difference]: Finished difference Result 1860 states and 2581 transitions. [2019-09-08 12:18:29,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:29,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:18:29,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:29,486 INFO L225 Difference]: With dead ends: 1860 [2019-09-08 12:18:29,486 INFO L226 Difference]: Without dead ends: 1690 [2019-09-08 12:18:29,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:29,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-08 12:18:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-08 12:18:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1241 transitions. [2019-09-08 12:18:29,565 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1241 transitions. Word has length 100 [2019-09-08 12:18:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:29,565 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1241 transitions. [2019-09-08 12:18:29,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1241 transitions. [2019-09-08 12:18:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:29,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:29,568 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] [2019-09-08 12:18:29,569 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:29,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:29,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1037598, now seen corresponding path program 1 times [2019-09-08 12:18:29,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:29,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:29,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:29,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:29,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:29,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:29,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:29,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:29,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:29,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:29,757 INFO L87 Difference]: Start difference. First operand 914 states and 1241 transitions. Second operand 9 states. [2019-09-08 12:18:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:32,173 INFO L93 Difference]: Finished difference Result 1918 states and 2664 transitions. [2019-09-08 12:18:32,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:32,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:18:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:32,177 INFO L225 Difference]: With dead ends: 1918 [2019-09-08 12:18:32,178 INFO L226 Difference]: Without dead ends: 1714 [2019-09-08 12:18:32,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:32,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-08 12:18:32,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-08 12:18:32,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1239 transitions. [2019-09-08 12:18:32,251 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1239 transitions. Word has length 100 [2019-09-08 12:18:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:32,251 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1239 transitions. [2019-09-08 12:18:32,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1239 transitions. [2019-09-08 12:18:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:32,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:32,253 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] [2019-09-08 12:18:32,254 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:32,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:32,254 INFO L82 PathProgramCache]: Analyzing trace with hash -597494101, now seen corresponding path program 1 times [2019-09-08 12:18:32,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:32,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:32,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:32,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:32,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:32,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:32,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:32,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:32,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:32,455 INFO L87 Difference]: Start difference. First operand 914 states and 1239 transitions. Second operand 9 states. [2019-09-08 12:18:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:35,094 INFO L93 Difference]: Finished difference Result 2020 states and 2803 transitions. [2019-09-08 12:18:35,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:35,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:18:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:35,100 INFO L225 Difference]: With dead ends: 2020 [2019-09-08 12:18:35,100 INFO L226 Difference]: Without dead ends: 1742 [2019-09-08 12:18:35,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:35,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-09-08 12:18:35,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 914. [2019-09-08 12:18:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1237 transitions. [2019-09-08 12:18:35,183 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1237 transitions. Word has length 100 [2019-09-08 12:18:35,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:35,183 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1237 transitions. [2019-09-08 12:18:35,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1237 transitions. [2019-09-08 12:18:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:35,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:35,186 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] [2019-09-08 12:18:35,186 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:35,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:35,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1634882529, now seen corresponding path program 1 times [2019-09-08 12:18:35,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:35,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:35,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:35,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:35,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:35,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:35,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:35,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:35,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:35,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:35,402 INFO L87 Difference]: Start difference. First operand 914 states and 1237 transitions. Second operand 9 states. [2019-09-08 12:18:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:37,441 INFO L93 Difference]: Finished difference Result 1794 states and 2468 transitions. [2019-09-08 12:18:37,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:37,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:18:37,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:37,445 INFO L225 Difference]: With dead ends: 1794 [2019-09-08 12:18:37,445 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:18:37,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:18:37,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:18:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1235 transitions. [2019-09-08 12:18:37,563 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1235 transitions. Word has length 100 [2019-09-08 12:18:37,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:37,564 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1235 transitions. [2019-09-08 12:18:37,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1235 transitions. [2019-09-08 12:18:37,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:37,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:37,566 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] [2019-09-08 12:18:37,566 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:37,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:37,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2100423903, now seen corresponding path program 1 times [2019-09-08 12:18:37,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:37,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:37,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:37,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:37,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:37,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:37,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:37,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:37,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:37,791 INFO L87 Difference]: Start difference. First operand 914 states and 1235 transitions. Second operand 9 states. [2019-09-08 12:18:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:40,087 INFO L93 Difference]: Finished difference Result 1856 states and 2567 transitions. [2019-09-08 12:18:40,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:40,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:18:40,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:40,095 INFO L225 Difference]: With dead ends: 1856 [2019-09-08 12:18:40,095 INFO L226 Difference]: Without dead ends: 1690 [2019-09-08 12:18:40,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-08 12:18:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-08 12:18:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1233 transitions. [2019-09-08 12:18:40,208 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1233 transitions. Word has length 100 [2019-09-08 12:18:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:40,209 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1233 transitions. [2019-09-08 12:18:40,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:40,209 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1233 transitions. [2019-09-08 12:18:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:40,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:40,211 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] [2019-09-08 12:18:40,211 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:40,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:40,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2035564676, now seen corresponding path program 1 times [2019-09-08 12:18:40,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:40,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:40,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:40,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:40,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:40,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:40,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:40,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:40,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:40,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:40,432 INFO L87 Difference]: Start difference. First operand 914 states and 1233 transitions. Second operand 9 states. [2019-09-08 12:18:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:42,860 INFO L93 Difference]: Finished difference Result 1906 states and 2637 transitions. [2019-09-08 12:18:42,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:42,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:18:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:42,866 INFO L225 Difference]: With dead ends: 1906 [2019-09-08 12:18:42,866 INFO L226 Difference]: Without dead ends: 1714 [2019-09-08 12:18:42,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-08 12:18:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-08 12:18:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1231 transitions. [2019-09-08 12:18:42,997 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1231 transitions. Word has length 100 [2019-09-08 12:18:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:42,998 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1231 transitions. [2019-09-08 12:18:42,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1231 transitions. [2019-09-08 12:18:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:43,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:43,000 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] [2019-09-08 12:18:43,001 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:43,001 INFO L82 PathProgramCache]: Analyzing trace with hash 232149422, now seen corresponding path program 1 times [2019-09-08 12:18:43,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:43,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:43,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:43,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:43,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:43,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:43,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:43,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:43,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:43,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:43,202 INFO L87 Difference]: Start difference. First operand 914 states and 1231 transitions. Second operand 9 states. [2019-09-08 12:18:45,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:45,795 INFO L93 Difference]: Finished difference Result 1896 states and 2618 transitions. [2019-09-08 12:18:45,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:45,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:18:45,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:45,799 INFO L225 Difference]: With dead ends: 1896 [2019-09-08 12:18:45,800 INFO L226 Difference]: Without dead ends: 1714 [2019-09-08 12:18:45,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:45,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-08 12:18:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-08 12:18:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1230 transitions. [2019-09-08 12:18:45,938 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1230 transitions. Word has length 100 [2019-09-08 12:18:45,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:45,939 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1230 transitions. [2019-09-08 12:18:45,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1230 transitions. [2019-09-08 12:18:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:45,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:45,941 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] [2019-09-08 12:18:45,941 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:45,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:45,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1574304686, now seen corresponding path program 1 times [2019-09-08 12:18:45,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:45,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:45,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:45,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:45,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:46,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:46,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:46,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:46,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:46,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:46,149 INFO L87 Difference]: Start difference. First operand 914 states and 1230 transitions. Second operand 9 states. [2019-09-08 12:18:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:48,544 INFO L93 Difference]: Finished difference Result 1846 states and 2548 transitions. [2019-09-08 12:18:48,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:48,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:18:48,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:48,548 INFO L225 Difference]: With dead ends: 1846 [2019-09-08 12:18:48,548 INFO L226 Difference]: Without dead ends: 1690 [2019-09-08 12:18:48,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-08 12:18:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-08 12:18:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:48,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1229 transitions. [2019-09-08 12:18:48,673 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1229 transitions. Word has length 100 [2019-09-08 12:18:48,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:48,674 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1229 transitions. [2019-09-08 12:18:48,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:48,674 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1229 transitions. [2019-09-08 12:18:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:48,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:48,676 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] [2019-09-08 12:18:48,676 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:48,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:48,677 INFO L82 PathProgramCache]: Analyzing trace with hash 622153299, now seen corresponding path program 1 times [2019-09-08 12:18:48,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:48,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:48,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:48,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:48,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:48,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:48,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:48,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:48,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:48,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:48,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:48,856 INFO L87 Difference]: Start difference. First operand 914 states and 1229 transitions. Second operand 9 states. [2019-09-08 12:18:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:51,191 INFO L93 Difference]: Finished difference Result 1850 states and 2551 transitions. [2019-09-08 12:18:51,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:51,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:18:51,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:51,194 INFO L225 Difference]: With dead ends: 1850 [2019-09-08 12:18:51,194 INFO L226 Difference]: Without dead ends: 1690 [2019-09-08 12:18:51,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:51,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-08 12:18:51,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-08 12:18:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1228 transitions. [2019-09-08 12:18:51,345 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1228 transitions. Word has length 100 [2019-09-08 12:18:51,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:51,346 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1228 transitions. [2019-09-08 12:18:51,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:51,346 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1228 transitions. [2019-09-08 12:18:51,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:51,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:51,348 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] [2019-09-08 12:18:51,349 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:51,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:51,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1503778103, now seen corresponding path program 1 times [2019-09-08 12:18:51,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:51,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:51,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:51,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:51,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:51,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:51,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:51,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:51,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:51,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:51,562 INFO L87 Difference]: Start difference. First operand 914 states and 1228 transitions. Second operand 9 states. [2019-09-08 12:18:53,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:53,895 INFO L93 Difference]: Finished difference Result 1882 states and 2601 transitions. [2019-09-08 12:18:53,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:53,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:18:53,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:53,898 INFO L225 Difference]: With dead ends: 1882 [2019-09-08 12:18:53,898 INFO L226 Difference]: Without dead ends: 1714 [2019-09-08 12:18:53,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-08 12:18:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-08 12:18:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1227 transitions. [2019-09-08 12:18:53,982 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1227 transitions. Word has length 100 [2019-09-08 12:18:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:53,983 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1227 transitions. [2019-09-08 12:18:53,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1227 transitions. [2019-09-08 12:18:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:53,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:53,985 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] [2019-09-08 12:18:53,985 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:53,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:53,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1753298871, now seen corresponding path program 1 times [2019-09-08 12:18:53,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:53,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:53,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:53,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:53,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:54,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:54,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:54,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:54,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:54,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:54,180 INFO L87 Difference]: Start difference. First operand 914 states and 1227 transitions. Second operand 9 states. [2019-09-08 12:18:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:56,880 INFO L93 Difference]: Finished difference Result 1845 states and 2543 transitions. [2019-09-08 12:18:56,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:56,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:18:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:56,888 INFO L225 Difference]: With dead ends: 1845 [2019-09-08 12:18:56,888 INFO L226 Difference]: Without dead ends: 1690 [2019-09-08 12:18:56,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:56,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-08 12:18:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-08 12:18:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1226 transitions. [2019-09-08 12:18:57,025 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1226 transitions. Word has length 100 [2019-09-08 12:18:57,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:57,025 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1226 transitions. [2019-09-08 12:18:57,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1226 transitions. [2019-09-08 12:18:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:57,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:57,027 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] [2019-09-08 12:18:57,028 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:57,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1248314787, now seen corresponding path program 1 times [2019-09-08 12:18:57,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:57,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:57,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:57,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:57,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:57,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:57,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:57,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:57,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:57,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:57,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:57,239 INFO L87 Difference]: Start difference. First operand 914 states and 1226 transitions. Second operand 9 states. [2019-09-08 12:18:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:59,810 INFO L93 Difference]: Finished difference Result 1850 states and 2546 transitions. [2019-09-08 12:18:59,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:59,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:18:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:59,814 INFO L225 Difference]: With dead ends: 1850 [2019-09-08 12:18:59,814 INFO L226 Difference]: Without dead ends: 1690 [2019-09-08 12:18:59,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:59,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-08 12:18:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-08 12:18:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:18:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1225 transitions. [2019-09-08 12:18:59,985 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1225 transitions. Word has length 100 [2019-09-08 12:18:59,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:59,985 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1225 transitions. [2019-09-08 12:18:59,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:59,985 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1225 transitions. [2019-09-08 12:18:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:59,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:59,987 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] [2019-09-08 12:18:59,988 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:59,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:59,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1807326229, now seen corresponding path program 1 times [2019-09-08 12:18:59,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:59,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:59,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:59,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:59,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:00,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:00,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:00,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:00,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:00,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:00,208 INFO L87 Difference]: Start difference. First operand 914 states and 1225 transitions. Second operand 9 states. [2019-09-08 12:19:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:02,283 INFO L93 Difference]: Finished difference Result 1792 states and 2452 transitions. [2019-09-08 12:19:02,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:02,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:19:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:02,286 INFO L225 Difference]: With dead ends: 1792 [2019-09-08 12:19:02,286 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:02,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:02,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:02,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1224 transitions. [2019-09-08 12:19:02,373 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1224 transitions. Word has length 100 [2019-09-08 12:19:02,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:02,373 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1224 transitions. [2019-09-08 12:19:02,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1224 transitions. [2019-09-08 12:19:02,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:02,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:02,374 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] [2019-09-08 12:19:02,375 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:02,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:02,375 INFO L82 PathProgramCache]: Analyzing trace with hash -347748653, now seen corresponding path program 1 times [2019-09-08 12:19:02,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:02,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:02,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:02,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:02,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:02,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:02,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:02,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:02,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:02,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:02,563 INFO L87 Difference]: Start difference. First operand 914 states and 1224 transitions. Second operand 9 states. [2019-09-08 12:19:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:05,106 INFO L93 Difference]: Finished difference Result 1926 states and 2648 transitions. [2019-09-08 12:19:05,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:05,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:05,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:05,109 INFO L225 Difference]: With dead ends: 1926 [2019-09-08 12:19:05,109 INFO L226 Difference]: Without dead ends: 1714 [2019-09-08 12:19:05,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-08 12:19:05,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-08 12:19:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1222 transitions. [2019-09-08 12:19:05,199 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1222 transitions. Word has length 102 [2019-09-08 12:19:05,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:05,199 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1222 transitions. [2019-09-08 12:19:05,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1222 transitions. [2019-09-08 12:19:05,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:05,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:05,201 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] [2019-09-08 12:19:05,201 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:05,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:05,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1867430125, now seen corresponding path program 1 times [2019-09-08 12:19:05,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:05,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:05,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:05,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:05,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:05,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:05,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:05,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:05,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:05,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:05,376 INFO L87 Difference]: Start difference. First operand 914 states and 1222 transitions. Second operand 9 states. [2019-09-08 12:19:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:07,705 INFO L93 Difference]: Finished difference Result 1798 states and 2455 transitions. [2019-09-08 12:19:07,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:07,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:07,707 INFO L225 Difference]: With dead ends: 1798 [2019-09-08 12:19:07,707 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:07,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:07,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1220 transitions. [2019-09-08 12:19:07,819 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1220 transitions. Word has length 102 [2019-09-08 12:19:07,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:07,819 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1220 transitions. [2019-09-08 12:19:07,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:07,819 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1220 transitions. [2019-09-08 12:19:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:07,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:07,821 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] [2019-09-08 12:19:07,821 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:07,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:07,822 INFO L82 PathProgramCache]: Analyzing trace with hash -498380659, now seen corresponding path program 1 times [2019-09-08 12:19:07,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:07,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:07,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:07,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:07,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:07,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:07,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:07,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:07,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:07,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:07,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:07,991 INFO L87 Difference]: Start difference. First operand 914 states and 1220 transitions. Second operand 9 states. [2019-09-08 12:19:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:10,548 INFO L93 Difference]: Finished difference Result 1862 states and 2555 transitions. [2019-09-08 12:19:10,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:10,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:10,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:10,550 INFO L225 Difference]: With dead ends: 1862 [2019-09-08 12:19:10,551 INFO L226 Difference]: Without dead ends: 1690 [2019-09-08 12:19:10,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-08 12:19:10,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-08 12:19:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1218 transitions. [2019-09-08 12:19:10,642 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1218 transitions. Word has length 102 [2019-09-08 12:19:10,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:10,642 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1218 transitions. [2019-09-08 12:19:10,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:10,642 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1218 transitions. [2019-09-08 12:19:10,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:10,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:10,643 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] [2019-09-08 12:19:10,644 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:10,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:10,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1161693327, now seen corresponding path program 1 times [2019-09-08 12:19:10,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:10,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:10,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:10,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:10,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:10,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:10,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:10,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:10,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:10,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:10,801 INFO L87 Difference]: Start difference. First operand 914 states and 1218 transitions. Second operand 9 states. [2019-09-08 12:19:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:13,113 INFO L93 Difference]: Finished difference Result 1862 states and 2553 transitions. [2019-09-08 12:19:13,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:13,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:13,115 INFO L225 Difference]: With dead ends: 1862 [2019-09-08 12:19:13,115 INFO L226 Difference]: Without dead ends: 1690 [2019-09-08 12:19:13,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:13,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-08 12:19:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-08 12:19:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1216 transitions. [2019-09-08 12:19:13,209 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1216 transitions. Word has length 102 [2019-09-08 12:19:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:13,209 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1216 transitions. [2019-09-08 12:19:13,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1216 transitions. [2019-09-08 12:19:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:13,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:13,211 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] [2019-09-08 12:19:13,211 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:13,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:13,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1204117457, now seen corresponding path program 1 times [2019-09-08 12:19:13,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:13,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:13,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:13,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:13,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:13,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:13,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:13,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:13,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:13,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:13,370 INFO L87 Difference]: Start difference. First operand 914 states and 1216 transitions. Second operand 9 states. [2019-09-08 12:19:15,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:15,910 INFO L93 Difference]: Finished difference Result 1798 states and 2449 transitions. [2019-09-08 12:19:15,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:15,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:15,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:15,912 INFO L225 Difference]: With dead ends: 1798 [2019-09-08 12:19:15,912 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:15,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:15,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:16,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1214 transitions. [2019-09-08 12:19:16,010 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1214 transitions. Word has length 102 [2019-09-08 12:19:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:16,011 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1214 transitions. [2019-09-08 12:19:16,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:16,011 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1214 transitions. [2019-09-08 12:19:16,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:16,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:16,013 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] [2019-09-08 12:19:16,013 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:16,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:16,014 INFO L82 PathProgramCache]: Analyzing trace with hash 42902853, now seen corresponding path program 1 times [2019-09-08 12:19:16,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:16,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:16,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:16,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:16,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:16,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:16,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:16,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:16,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:16,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:16,181 INFO L87 Difference]: Start difference. First operand 914 states and 1214 transitions. Second operand 9 states. [2019-09-08 12:19:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:18,694 INFO L93 Difference]: Finished difference Result 1798 states and 2447 transitions. [2019-09-08 12:19:18,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:18,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:18,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:18,697 INFO L225 Difference]: With dead ends: 1798 [2019-09-08 12:19:18,697 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:18,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1212 transitions. [2019-09-08 12:19:18,795 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1212 transitions. Word has length 102 [2019-09-08 12:19:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:18,795 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1212 transitions. [2019-09-08 12:19:18,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1212 transitions. [2019-09-08 12:19:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:18,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:18,796 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] [2019-09-08 12:19:18,797 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:18,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:18,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2126723695, now seen corresponding path program 1 times [2019-09-08 12:19:18,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:18,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:18,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:18,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:18,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:18,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:18,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:18,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:18,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:18,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:18,961 INFO L87 Difference]: Start difference. First operand 914 states and 1212 transitions. Second operand 9 states. [2019-09-08 12:19:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:21,418 INFO L93 Difference]: Finished difference Result 1794 states and 2438 transitions. [2019-09-08 12:19:21,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:21,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:21,420 INFO L225 Difference]: With dead ends: 1794 [2019-09-08 12:19:21,421 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:21,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:21,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1210 transitions. [2019-09-08 12:19:21,522 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1210 transitions. Word has length 102 [2019-09-08 12:19:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:21,522 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1210 transitions. [2019-09-08 12:19:21,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1210 transitions. [2019-09-08 12:19:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:21,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:21,524 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] [2019-09-08 12:19:21,524 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:21,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1199777118, now seen corresponding path program 1 times [2019-09-08 12:19:21,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:21,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:21,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:21,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:21,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:21,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:21,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:21,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:21,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:21,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:21,677 INFO L87 Difference]: Start difference. First operand 914 states and 1210 transitions. Second operand 9 states. [2019-09-08 12:19:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:23,960 INFO L93 Difference]: Finished difference Result 1790 states and 2432 transitions. [2019-09-08 12:19:23,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:23,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:23,962 INFO L225 Difference]: With dead ends: 1790 [2019-09-08 12:19:23,962 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:23,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1208 transitions. [2019-09-08 12:19:24,063 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1208 transitions. Word has length 102 [2019-09-08 12:19:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:24,063 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1208 transitions. [2019-09-08 12:19:24,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:24,063 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1208 transitions. [2019-09-08 12:19:24,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:24,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:24,065 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] [2019-09-08 12:19:24,065 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:24,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:24,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1851680593, now seen corresponding path program 1 times [2019-09-08 12:19:24,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:24,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:24,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:24,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:24,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:24,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:24,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:24,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:24,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:24,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:24,224 INFO L87 Difference]: Start difference. First operand 914 states and 1208 transitions. Second operand 9 states. [2019-09-08 12:19:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:26,858 INFO L93 Difference]: Finished difference Result 1854 states and 2529 transitions. [2019-09-08 12:19:26,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:26,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:26,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:26,861 INFO L225 Difference]: With dead ends: 1854 [2019-09-08 12:19:26,861 INFO L226 Difference]: Without dead ends: 1690 [2019-09-08 12:19:26,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:26,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-08 12:19:26,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-08 12:19:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1206 transitions. [2019-09-08 12:19:26,965 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1206 transitions. Word has length 102 [2019-09-08 12:19:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:26,965 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1206 transitions. [2019-09-08 12:19:26,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1206 transitions. [2019-09-08 12:19:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:26,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:26,967 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] [2019-09-08 12:19:26,967 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:26,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:26,967 INFO L82 PathProgramCache]: Analyzing trace with hash -239523668, now seen corresponding path program 1 times [2019-09-08 12:19:26,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:26,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:26,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:26,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:26,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:27,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:27,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:27,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:27,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:27,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:27,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:27,202 INFO L87 Difference]: Start difference. First operand 914 states and 1206 transitions. Second operand 9 states. [2019-09-08 12:19:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:29,727 INFO L93 Difference]: Finished difference Result 1647 states and 2212 transitions. [2019-09-08 12:19:29,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:29,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:29,729 INFO L225 Difference]: With dead ends: 1647 [2019-09-08 12:19:29,729 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:29,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:29,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1204 transitions. [2019-09-08 12:19:29,834 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1204 transitions. Word has length 102 [2019-09-08 12:19:29,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:29,834 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1204 transitions. [2019-09-08 12:19:29,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1204 transitions. [2019-09-08 12:19:29,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:29,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:29,835 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] [2019-09-08 12:19:29,835 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:29,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:29,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1033951035, now seen corresponding path program 1 times [2019-09-08 12:19:29,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:29,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:29,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:29,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:29,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:29,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:29,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:29,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:29,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:29,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:29,996 INFO L87 Difference]: Start difference. First operand 914 states and 1204 transitions. Second operand 9 states. [2019-09-08 12:19:32,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:32,494 INFO L93 Difference]: Finished difference Result 1794 states and 2428 transitions. [2019-09-08 12:19:32,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:32,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:32,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:32,498 INFO L225 Difference]: With dead ends: 1794 [2019-09-08 12:19:32,498 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:32,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:32,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:32,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1202 transitions. [2019-09-08 12:19:32,629 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1202 transitions. Word has length 102 [2019-09-08 12:19:32,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:32,629 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1202 transitions. [2019-09-08 12:19:32,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1202 transitions. [2019-09-08 12:19:32,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:32,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:32,631 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] [2019-09-08 12:19:32,631 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:32,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:32,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1606100660, now seen corresponding path program 1 times [2019-09-08 12:19:32,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:32,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:32,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:32,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:32,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:32,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:32,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:32,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:32,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:32,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:32,774 INFO L87 Difference]: Start difference. First operand 914 states and 1202 transitions. Second operand 9 states. [2019-09-08 12:19:35,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:35,162 INFO L93 Difference]: Finished difference Result 1647 states and 2206 transitions. [2019-09-08 12:19:35,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:35,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:35,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:35,164 INFO L225 Difference]: With dead ends: 1647 [2019-09-08 12:19:35,164 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:35,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:35,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1200 transitions. [2019-09-08 12:19:35,300 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1200 transitions. Word has length 102 [2019-09-08 12:19:35,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:35,300 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1200 transitions. [2019-09-08 12:19:35,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1200 transitions. [2019-09-08 12:19:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:35,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:35,302 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] [2019-09-08 12:19:35,303 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:35,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1991148821, now seen corresponding path program 1 times [2019-09-08 12:19:35,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:35,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:35,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:35,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:35,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:35,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:35,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:35,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:35,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:35,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:35,507 INFO L87 Difference]: Start difference. First operand 914 states and 1200 transitions. Second operand 9 states. [2019-09-08 12:19:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:38,773 INFO L93 Difference]: Finished difference Result 1707 states and 2293 transitions. [2019-09-08 12:19:38,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:38,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:38,776 INFO L225 Difference]: With dead ends: 1707 [2019-09-08 12:19:38,776 INFO L226 Difference]: Without dead ends: 1690 [2019-09-08 12:19:38,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-08 12:19:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-08 12:19:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1198 transitions. [2019-09-08 12:19:38,885 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1198 transitions. Word has length 102 [2019-09-08 12:19:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:38,885 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1198 transitions. [2019-09-08 12:19:38,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:38,885 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1198 transitions. [2019-09-08 12:19:38,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:38,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:38,887 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] [2019-09-08 12:19:38,887 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:38,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:38,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1791700802, now seen corresponding path program 1 times [2019-09-08 12:19:38,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:38,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:38,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:38,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:38,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:39,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:39,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:39,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:39,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:39,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:39,031 INFO L87 Difference]: Start difference. First operand 914 states and 1198 transitions. Second operand 9 states. [2019-09-08 12:19:41,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:41,566 INFO L93 Difference]: Finished difference Result 1647 states and 2202 transitions. [2019-09-08 12:19:41,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:41,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:41,568 INFO L225 Difference]: With dead ends: 1647 [2019-09-08 12:19:41,568 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:41,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1196 transitions. [2019-09-08 12:19:41,729 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1196 transitions. Word has length 102 [2019-09-08 12:19:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:41,729 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1196 transitions. [2019-09-08 12:19:41,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1196 transitions. [2019-09-08 12:19:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:41,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:41,731 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] [2019-09-08 12:19:41,731 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:41,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:41,731 INFO L82 PathProgramCache]: Analyzing trace with hash -518117862, now seen corresponding path program 1 times [2019-09-08 12:19:41,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:41,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:41,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:41,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:41,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:41,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:41,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:41,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:41,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:41,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:41,887 INFO L87 Difference]: Start difference. First operand 914 states and 1196 transitions. Second operand 9 states. [2019-09-08 12:19:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:44,331 INFO L93 Difference]: Finished difference Result 1794 states and 2418 transitions. [2019-09-08 12:19:44,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:44,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:44,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:44,333 INFO L225 Difference]: With dead ends: 1794 [2019-09-08 12:19:44,333 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:44,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:44,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1194 transitions. [2019-09-08 12:19:44,446 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1194 transitions. Word has length 102 [2019-09-08 12:19:44,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:44,446 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1194 transitions. [2019-09-08 12:19:44,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:44,446 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1194 transitions. [2019-09-08 12:19:44,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:44,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:44,447 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] [2019-09-08 12:19:44,447 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:44,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:44,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1542160895, now seen corresponding path program 1 times [2019-09-08 12:19:44,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:44,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:44,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:44,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:44,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:44,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:44,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:44,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:44,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:44,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:44,657 INFO L87 Difference]: Start difference. First operand 914 states and 1194 transitions. Second operand 9 states. [2019-09-08 12:19:47,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:47,403 INFO L93 Difference]: Finished difference Result 1795 states and 2417 transitions. [2019-09-08 12:19:47,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:47,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:47,406 INFO L225 Difference]: With dead ends: 1795 [2019-09-08 12:19:47,406 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:47,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:47,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:47,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1193 transitions. [2019-09-08 12:19:47,524 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1193 transitions. Word has length 102 [2019-09-08 12:19:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:47,524 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1193 transitions. [2019-09-08 12:19:47,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1193 transitions. [2019-09-08 12:19:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:47,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:47,526 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] [2019-09-08 12:19:47,526 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:47,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:47,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1591591797, now seen corresponding path program 1 times [2019-09-08 12:19:47,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:47,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:47,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:47,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:47,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:47,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:47,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:47,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:47,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:47,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:47,682 INFO L87 Difference]: Start difference. First operand 914 states and 1193 transitions. Second operand 9 states. [2019-09-08 12:19:50,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:50,276 INFO L93 Difference]: Finished difference Result 1795 states and 2416 transitions. [2019-09-08 12:19:50,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:50,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:50,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:50,279 INFO L225 Difference]: With dead ends: 1795 [2019-09-08 12:19:50,279 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:50,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1192 transitions. [2019-09-08 12:19:50,399 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1192 transitions. Word has length 102 [2019-09-08 12:19:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:50,399 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1192 transitions. [2019-09-08 12:19:50,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1192 transitions. [2019-09-08 12:19:50,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:50,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:50,401 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] [2019-09-08 12:19:50,401 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:50,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:50,401 INFO L82 PathProgramCache]: Analyzing trace with hash -578717935, now seen corresponding path program 1 times [2019-09-08 12:19:50,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:50,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:50,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:50,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:50,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:50,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:50,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:50,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:50,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:50,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:50,545 INFO L87 Difference]: Start difference. First operand 914 states and 1192 transitions. Second operand 9 states. [2019-09-08 12:19:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:53,113 INFO L93 Difference]: Finished difference Result 1792 states and 2411 transitions. [2019-09-08 12:19:53,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:53,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:53,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:53,116 INFO L225 Difference]: With dead ends: 1792 [2019-09-08 12:19:53,116 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:53,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:53,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:53,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1191 transitions. [2019-09-08 12:19:53,282 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1191 transitions. Word has length 102 [2019-09-08 12:19:53,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:53,282 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1191 transitions. [2019-09-08 12:19:53,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1191 transitions. [2019-09-08 12:19:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:53,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:53,283 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] [2019-09-08 12:19:53,284 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:53,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:53,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1766002162, now seen corresponding path program 1 times [2019-09-08 12:19:53,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:53,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:53,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:53,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:53,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:53,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:53,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:53,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:53,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:53,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:53,456 INFO L87 Difference]: Start difference. First operand 914 states and 1191 transitions. Second operand 9 states. [2019-09-08 12:19:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:56,239 INFO L93 Difference]: Finished difference Result 1792 states and 2410 transitions. [2019-09-08 12:19:56,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:56,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:56,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:56,242 INFO L225 Difference]: With dead ends: 1792 [2019-09-08 12:19:56,242 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:56,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1190 transitions. [2019-09-08 12:19:56,393 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1190 transitions. Word has length 102 [2019-09-08 12:19:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:56,393 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1190 transitions. [2019-09-08 12:19:56,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1190 transitions. [2019-09-08 12:19:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:56,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:56,395 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] [2019-09-08 12:19:56,396 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:56,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:56,396 INFO L82 PathProgramCache]: Analyzing trace with hash 86548545, now seen corresponding path program 1 times [2019-09-08 12:19:56,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:56,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:56,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:56,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:56,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:56,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:56,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:56,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:56,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:56,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:56,542 INFO L87 Difference]: Start difference. First operand 914 states and 1190 transitions. Second operand 9 states. [2019-09-08 12:19:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:59,195 INFO L93 Difference]: Finished difference Result 1795 states and 2411 transitions. [2019-09-08 12:19:59,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:59,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:59,198 INFO L225 Difference]: With dead ends: 1795 [2019-09-08 12:19:59,198 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:19:59,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:59,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:19:59,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:19:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:19:59,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1189 transitions. [2019-09-08 12:19:59,323 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1189 transitions. Word has length 102 [2019-09-08 12:19:59,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:59,323 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1189 transitions. [2019-09-08 12:19:59,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:59,323 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1189 transitions. [2019-09-08 12:19:59,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:59,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:59,324 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] [2019-09-08 12:19:59,325 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:59,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:59,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2083870417, now seen corresponding path program 1 times [2019-09-08 12:19:59,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:59,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:59,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:59,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:59,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:59,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:59,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:59,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:59,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:59,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:59,471 INFO L87 Difference]: Start difference. First operand 914 states and 1189 transitions. Second operand 9 states. [2019-09-08 12:20:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:02,076 INFO L93 Difference]: Finished difference Result 1792 states and 2406 transitions. [2019-09-08 12:20:02,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:02,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:20:02,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:02,079 INFO L225 Difference]: With dead ends: 1792 [2019-09-08 12:20:02,079 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:20:02,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:20:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:20:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:20:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:20:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1188 transitions. [2019-09-08 12:20:02,203 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1188 transitions. Word has length 102 [2019-09-08 12:20:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:02,204 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1188 transitions. [2019-09-08 12:20:02,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1188 transitions. [2019-09-08 12:20:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:20:02,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:02,205 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] [2019-09-08 12:20:02,205 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:02,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:02,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1805478129, now seen corresponding path program 1 times [2019-09-08 12:20:02,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:02,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:02,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:02,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:02,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:02,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:02,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:02,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:02,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:02,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:02,353 INFO L87 Difference]: Start difference. First operand 914 states and 1188 transitions. Second operand 9 states. [2019-09-08 12:20:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:05,011 INFO L93 Difference]: Finished difference Result 1790 states and 2403 transitions. [2019-09-08 12:20:05,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:05,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:20:05,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:05,013 INFO L225 Difference]: With dead ends: 1790 [2019-09-08 12:20:05,013 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:20:05,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:20:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:20:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:20:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:20:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1187 transitions. [2019-09-08 12:20:05,139 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1187 transitions. Word has length 102 [2019-09-08 12:20:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:05,139 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1187 transitions. [2019-09-08 12:20:05,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1187 transitions. [2019-09-08 12:20:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:20:05,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:05,140 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] [2019-09-08 12:20:05,141 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:05,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:05,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1564380239, now seen corresponding path program 1 times [2019-09-08 12:20:05,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:05,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:05,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:05,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:05,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:05,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:05,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:05,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:05,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:05,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:05,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:05,266 INFO L87 Difference]: Start difference. First operand 914 states and 1187 transitions. Second operand 9 states. [2019-09-08 12:20:07,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:07,475 INFO L93 Difference]: Finished difference Result 1792 states and 2403 transitions. [2019-09-08 12:20:07,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:07,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:20:07,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:07,478 INFO L225 Difference]: With dead ends: 1792 [2019-09-08 12:20:07,478 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:20:07,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:20:07,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:20:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:20:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:20:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1186 transitions. [2019-09-08 12:20:07,612 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1186 transitions. Word has length 102 [2019-09-08 12:20:07,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:07,612 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1186 transitions. [2019-09-08 12:20:07,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1186 transitions. [2019-09-08 12:20:07,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:20:07,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:07,614 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] [2019-09-08 12:20:07,614 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:07,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:07,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1861566370, now seen corresponding path program 1 times [2019-09-08 12:20:07,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:07,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:07,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:07,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:07,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:07,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:07,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:07,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:07,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:07,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:07,749 INFO L87 Difference]: Start difference. First operand 914 states and 1186 transitions. Second operand 9 states. [2019-09-08 12:20:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:10,199 INFO L93 Difference]: Finished difference Result 1790 states and 2399 transitions. [2019-09-08 12:20:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:10,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:20:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:10,202 INFO L225 Difference]: With dead ends: 1790 [2019-09-08 12:20:10,202 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:20:10,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:20:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:20:10,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:20:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:20:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1185 transitions. [2019-09-08 12:20:10,339 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1185 transitions. Word has length 102 [2019-09-08 12:20:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:10,340 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1185 transitions. [2019-09-08 12:20:10,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1185 transitions. [2019-09-08 12:20:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:20:10,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:10,342 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] [2019-09-08 12:20:10,342 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:10,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:10,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1799751695, now seen corresponding path program 1 times [2019-09-08 12:20:10,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:10,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:10,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:10,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:10,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:10,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:10,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:10,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:10,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:10,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:10,499 INFO L87 Difference]: Start difference. First operand 914 states and 1185 transitions. Second operand 9 states. [2019-09-08 12:20:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:12,794 INFO L93 Difference]: Finished difference Result 1792 states and 2400 transitions. [2019-09-08 12:20:12,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:12,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:20:12,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:12,797 INFO L225 Difference]: With dead ends: 1792 [2019-09-08 12:20:12,797 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:20:12,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:20:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:20:12,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:20:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:20:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1184 transitions. [2019-09-08 12:20:12,942 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1184 transitions. Word has length 102 [2019-09-08 12:20:12,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:12,942 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1184 transitions. [2019-09-08 12:20:12,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1184 transitions. [2019-09-08 12:20:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:20:12,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:12,943 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] [2019-09-08 12:20:12,944 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:12,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:12,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1222390320, now seen corresponding path program 1 times [2019-09-08 12:20:12,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:12,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:12,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:12,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:12,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:13,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:13,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:13,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:13,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:13,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:13,079 INFO L87 Difference]: Start difference. First operand 914 states and 1184 transitions. Second operand 9 states. [2019-09-08 12:20:15,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:15,640 INFO L93 Difference]: Finished difference Result 1647 states and 2181 transitions. [2019-09-08 12:20:15,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:15,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:20:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:15,643 INFO L225 Difference]: With dead ends: 1647 [2019-09-08 12:20:15,643 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:20:15,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:20:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:20:15,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:20:15,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:20:15,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1183 transitions. [2019-09-08 12:20:15,778 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1183 transitions. Word has length 102 [2019-09-08 12:20:15,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:15,778 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1183 transitions. [2019-09-08 12:20:15,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:15,779 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1183 transitions. [2019-09-08 12:20:15,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:20:15,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:15,780 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] [2019-09-08 12:20:15,780 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:15,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:15,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1905574170, now seen corresponding path program 1 times [2019-09-08 12:20:15,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:15,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:15,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:15,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:15,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:15,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:15,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:15,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:15,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:15,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:15,956 INFO L87 Difference]: Start difference. First operand 914 states and 1183 transitions. Second operand 9 states. [2019-09-08 12:20:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:18,392 INFO L93 Difference]: Finished difference Result 1790 states and 2395 transitions. [2019-09-08 12:20:18,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:18,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:20:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:18,395 INFO L225 Difference]: With dead ends: 1790 [2019-09-08 12:20:18,396 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:20:18,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:20:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:20:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:20:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:20:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1182 transitions. [2019-09-08 12:20:18,537 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1182 transitions. Word has length 102 [2019-09-08 12:20:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:18,537 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1182 transitions. [2019-09-08 12:20:18,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1182 transitions. [2019-09-08 12:20:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:20:18,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:18,538 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] [2019-09-08 12:20:18,539 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:18,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:18,539 INFO L82 PathProgramCache]: Analyzing trace with hash -982022137, now seen corresponding path program 1 times [2019-09-08 12:20:18,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:18,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:18,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:18,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:18,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:18,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:18,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:18,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:18,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:18,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:18,693 INFO L87 Difference]: Start difference. First operand 914 states and 1182 transitions. Second operand 9 states. [2019-09-08 12:20:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:21,133 INFO L93 Difference]: Finished difference Result 1846 states and 2478 transitions. [2019-09-08 12:20:21,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:21,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:20:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:21,137 INFO L225 Difference]: With dead ends: 1846 [2019-09-08 12:20:21,137 INFO L226 Difference]: Without dead ends: 1690 [2019-09-08 12:20:21,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:20:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-08 12:20:21,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-08 12:20:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:20:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1181 transitions. [2019-09-08 12:20:21,288 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1181 transitions. Word has length 102 [2019-09-08 12:20:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:21,288 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1181 transitions. [2019-09-08 12:20:21,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1181 transitions. [2019-09-08 12:20:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:20:21,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:21,290 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] [2019-09-08 12:20:21,290 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:21,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:21,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1000695491, now seen corresponding path program 1 times [2019-09-08 12:20:21,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:21,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:21,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:21,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:21,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:21,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:21,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:21,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:21,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:21,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:21,430 INFO L87 Difference]: Start difference. First operand 914 states and 1181 transitions. Second operand 9 states. [2019-09-08 12:20:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:23,687 INFO L93 Difference]: Finished difference Result 1791 states and 2394 transitions. [2019-09-08 12:20:23,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:23,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:20:23,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:23,689 INFO L225 Difference]: With dead ends: 1791 [2019-09-08 12:20:23,690 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 12:20:23,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:20:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 12:20:23,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-08 12:20:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:20:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1180 transitions. [2019-09-08 12:20:23,854 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1180 transitions. Word has length 103 [2019-09-08 12:20:23,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:23,855 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1180 transitions. [2019-09-08 12:20:23,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1180 transitions. [2019-09-08 12:20:23,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:20:23,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:23,856 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] [2019-09-08 12:20:23,856 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:23,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:23,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1973611710, now seen corresponding path program 1 times [2019-09-08 12:20:23,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:23,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:23,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:23,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:23,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:25,120 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 12:20:25,281 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:20:25,454 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 12:20:25,621 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 12:20:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:27,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:27,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:20:27,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:20:27,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:20:27,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:20:27,175 INFO L87 Difference]: Start difference. First operand 914 states and 1180 transitions. Second operand 31 states. [2019-09-08 12:20:27,403 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-09-08 12:20:28,678 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-08 12:20:28,878 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-09-08 12:20:29,433 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-09-08 12:20:29,774 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-09-08 12:20:30,155 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 64 [2019-09-08 12:20:30,626 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 73 [2019-09-08 12:20:31,192 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2019-09-08 12:20:31,526 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2019-09-08 12:20:31,884 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2019-09-08 12:20:32,081 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 12:20:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:45,995 INFO L93 Difference]: Finished difference Result 1394 states and 1828 transitions. [2019-09-08 12:20:45,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:20:45,996 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 104 [2019-09-08 12:20:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:45,998 INFO L225 Difference]: With dead ends: 1394 [2019-09-08 12:20:45,998 INFO L226 Difference]: Without dead ends: 1242 [2019-09-08 12:20:45,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=445, Invalid=2417, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 12:20:46,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2019-09-08 12:20:46,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 934. [2019-09-08 12:20:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2019-09-08 12:20:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1207 transitions. [2019-09-08 12:20:46,148 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1207 transitions. Word has length 104 [2019-09-08 12:20:46,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:46,148 INFO L475 AbstractCegarLoop]: Abstraction has 934 states and 1207 transitions. [2019-09-08 12:20:46,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:20:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1207 transitions. [2019-09-08 12:20:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:20:46,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:46,149 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] [2019-09-08 12:20:46,149 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:46,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:46,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1671531983, now seen corresponding path program 1 times [2019-09-08 12:20:46,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:46,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:46,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:46,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:46,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:47,340 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 12:20:47,515 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:20:47,748 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 12:20:47,920 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-08 12:20:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:49,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:49,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:20:49,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:20:49,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:20:49,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:20:49,147 INFO L87 Difference]: Start difference. First operand 934 states and 1207 transitions. Second operand 31 states. [2019-09-08 12:20:49,338 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-09-08 12:20:50,474 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2019-09-08 12:20:50,923 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2019-09-08 12:20:51,269 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 75 [2019-09-08 12:20:51,658 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 94 [2019-09-08 12:20:52,189 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 114 [2019-09-08 12:20:53,941 WARN L188 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 181 DAG size of output: 138 [2019-09-08 12:20:54,243 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2019-09-08 12:20:54,531 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2019-09-08 12:20:54,767 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-08 12:20:55,263 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 12:21:13,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:13,819 INFO L93 Difference]: Finished difference Result 2434 states and 3239 transitions. [2019-09-08 12:21:13,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 12:21:13,819 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 104 [2019-09-08 12:21:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:13,821 INFO L225 Difference]: With dead ends: 2434 [2019-09-08 12:21:13,822 INFO L226 Difference]: Without dead ends: 2279 [2019-09-08 12:21:13,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=519, Invalid=3141, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 12:21:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2019-09-08 12:21:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 943. [2019-09-08 12:21:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-09-08 12:21:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1219 transitions. [2019-09-08 12:21:14,034 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1219 transitions. Word has length 104 [2019-09-08 12:21:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:14,034 INFO L475 AbstractCegarLoop]: Abstraction has 943 states and 1219 transitions. [2019-09-08 12:21:14,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:21:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1219 transitions. [2019-09-08 12:21:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:21:14,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:14,037 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] [2019-09-08 12:21:14,038 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:14,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1056682376, now seen corresponding path program 1 times [2019-09-08 12:21:14,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:14,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:14,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:14,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:14,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:14,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:14,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:21:14,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:21:14,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:21:14,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:21:14,973 INFO L87 Difference]: Start difference. First operand 943 states and 1219 transitions. Second operand 17 states. [2019-09-08 12:21:15,575 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:21:15,723 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:21:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:19,197 INFO L93 Difference]: Finished difference Result 2046 states and 2735 transitions. [2019-09-08 12:21:19,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:21:19,197 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-08 12:21:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:19,200 INFO L225 Difference]: With dead ends: 2046 [2019-09-08 12:21:19,200 INFO L226 Difference]: Without dead ends: 1848 [2019-09-08 12:21:19,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:21:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2019-09-08 12:21:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 914. [2019-09-08 12:21:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-08 12:21:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1178 transitions. [2019-09-08 12:21:19,389 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1178 transitions. Word has length 104 [2019-09-08 12:21:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:19,389 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1178 transitions. [2019-09-08 12:21:19,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:21:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1178 transitions. [2019-09-08 12:21:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:21:19,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:19,391 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] [2019-09-08 12:21:19,391 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:19,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:19,392 INFO L82 PathProgramCache]: Analyzing trace with hash -731627508, now seen corresponding path program 1 times [2019-09-08 12:21:19,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:19,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:19,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:19,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:19,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:20,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:20,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:21:20,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:21:20,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:21:20,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:21:20,617 INFO L87 Difference]: Start difference. First operand 914 states and 1178 transitions. Second operand 22 states. [2019-09-08 12:21:21,663 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 12:21:21,916 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-08 12:21:22,301 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-08 12:21:22,449 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 12:21:22,809 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 12:21:23,141 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:21:23,553 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 12:21:27,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:27,364 INFO L93 Difference]: Finished difference Result 2017 states and 2664 transitions. [2019-09-08 12:21:27,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:21:27,364 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 104 [2019-09-08 12:21:27,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:27,367 INFO L225 Difference]: With dead ends: 2017 [2019-09-08 12:21:27,367 INFO L226 Difference]: Without dead ends: 1823 [2019-09-08 12:21:27,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:21:27,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2019-09-08 12:21:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 926. [2019-09-08 12:21:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-09-08 12:21:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1190 transitions. [2019-09-08 12:21:27,582 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1190 transitions. Word has length 104 [2019-09-08 12:21:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:27,582 INFO L475 AbstractCegarLoop]: Abstraction has 926 states and 1190 transitions. [2019-09-08 12:21:27,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:21:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1190 transitions. [2019-09-08 12:21:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:21:27,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:27,584 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] [2019-09-08 12:21:27,584 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:27,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:27,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1599389865, now seen corresponding path program 1 times [2019-09-08 12:21:27,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:27,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:27,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:27,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:27,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:28,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:28,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:21:28,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:21:28,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:21:28,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:21:28,319 INFO L87 Difference]: Start difference. First operand 926 states and 1190 transitions. Second operand 17 states. [2019-09-08 12:21:28,927 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:21:29,069 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:21:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:32,397 INFO L93 Difference]: Finished difference Result 1989 states and 2652 transitions. [2019-09-08 12:21:32,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:21:32,402 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-08 12:21:32,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:32,405 INFO L225 Difference]: With dead ends: 1989 [2019-09-08 12:21:32,405 INFO L226 Difference]: Without dead ends: 1803 [2019-09-08 12:21:32,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:21:32,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-09-08 12:21:32,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 912. [2019-09-08 12:21:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-09-08 12:21:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1168 transitions. [2019-09-08 12:21:32,599 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1168 transitions. Word has length 104 [2019-09-08 12:21:32,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:32,599 INFO L475 AbstractCegarLoop]: Abstraction has 912 states and 1168 transitions. [2019-09-08 12:21:32,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:21:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1168 transitions. [2019-09-08 12:21:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:21:32,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:32,602 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] [2019-09-08 12:21:32,602 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:32,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:32,602 INFO L82 PathProgramCache]: Analyzing trace with hash -356139567, now seen corresponding path program 1 times [2019-09-08 12:21:32,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:32,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:32,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:32,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:32,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:33,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:33,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:21:33,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:21:33,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:21:33,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:21:33,302 INFO L87 Difference]: Start difference. First operand 912 states and 1168 transitions. Second operand 17 states. [2019-09-08 12:21:33,848 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 12:21:33,984 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-08 12:21:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:37,143 INFO L93 Difference]: Finished difference Result 1969 states and 2623 transitions. [2019-09-08 12:21:37,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:21:37,143 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-08 12:21:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:37,145 INFO L225 Difference]: With dead ends: 1969 [2019-09-08 12:21:37,145 INFO L226 Difference]: Without dead ends: 1791 [2019-09-08 12:21:37,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:21:37,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2019-09-08 12:21:37,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 900. [2019-09-08 12:21:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-09-08 12:21:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1148 transitions. [2019-09-08 12:21:37,341 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1148 transitions. Word has length 104 [2019-09-08 12:21:37,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:37,342 INFO L475 AbstractCegarLoop]: Abstraction has 900 states and 1148 transitions. [2019-09-08 12:21:37,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:21:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1148 transitions. [2019-09-08 12:21:37,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:21:37,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:37,343 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] [2019-09-08 12:21:37,343 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:37,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:37,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2101815838, now seen corresponding path program 1 times [2019-09-08 12:21:37,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:37,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:37,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:37,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:37,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:38,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:38,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:21:38,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:21:38,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:21:38,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:21:38,177 INFO L87 Difference]: Start difference. First operand 900 states and 1148 transitions. Second operand 16 states. [2019-09-08 12:21:38,897 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:21:39,055 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:21:39,209 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:21:39,404 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:21:39,577 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:21:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:43,471 INFO L93 Difference]: Finished difference Result 1503 states and 1925 transitions. [2019-09-08 12:21:43,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:21:43,471 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2019-09-08 12:21:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:43,473 INFO L225 Difference]: With dead ends: 1503 [2019-09-08 12:21:43,473 INFO L226 Difference]: Without dead ends: 1354 [2019-09-08 12:21:43,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:21:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-08 12:21:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 899. [2019-09-08 12:21:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-09-08 12:21:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1146 transitions. [2019-09-08 12:21:43,683 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1146 transitions. Word has length 104 [2019-09-08 12:21:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:43,683 INFO L475 AbstractCegarLoop]: Abstraction has 899 states and 1146 transitions. [2019-09-08 12:21:43,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:21:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1146 transitions. [2019-09-08 12:21:43,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:21:43,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:43,684 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] [2019-09-08 12:21:43,685 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:43,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:43,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1657957713, now seen corresponding path program 1 times [2019-09-08 12:21:43,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:43,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:43,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:43,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:43,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:44,855 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:21:44,995 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:21:46,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:46,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:46,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:21:46,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:21:46,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:21:46,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:21:46,323 INFO L87 Difference]: Start difference. First operand 899 states and 1146 transitions. Second operand 31 states. [2019-09-08 12:21:46,532 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-08 12:21:47,515 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-08 12:21:47,680 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 12:21:47,854 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-08 12:21:48,176 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-08 12:21:48,668 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-08 12:21:49,057 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-09-08 12:21:49,501 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-09-08 12:21:50,082 WARN L188 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 120 [2019-09-08 12:21:50,375 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-09-08 12:21:50,663 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-09-08 12:21:51,053 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-09-08 12:21:51,677 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-08 12:21:52,096 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-08 12:21:52,540 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-08 12:21:52,947 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-08 12:21:53,704 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-08 12:22:05,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:05,865 INFO L93 Difference]: Finished difference Result 1939 states and 2461 transitions. [2019-09-08 12:22:05,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 12:22:05,865 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 104 [2019-09-08 12:22:05,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:05,867 INFO L225 Difference]: With dead ends: 1939 [2019-09-08 12:22:05,867 INFO L226 Difference]: Without dead ends: 1933 [2019-09-08 12:22:05,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=644, Invalid=2436, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 12:22:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-09-08 12:22:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 909. [2019-09-08 12:22:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:22:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1157 transitions. [2019-09-08 12:22:06,529 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1157 transitions. Word has length 104 [2019-09-08 12:22:06,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:06,529 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1157 transitions. [2019-09-08 12:22:06,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:22:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1157 transitions. [2019-09-08 12:22:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:22:06,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:06,531 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] [2019-09-08 12:22:06,531 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:06,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:06,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1837373011, now seen corresponding path program 1 times [2019-09-08 12:22:06,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:06,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:06,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:06,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:06,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:07,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:07,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:22:07,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:22:07,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:22:07,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:22:07,286 INFO L87 Difference]: Start difference. First operand 909 states and 1157 transitions. Second operand 17 states. [2019-09-08 12:22:07,916 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:22:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:10,681 INFO L93 Difference]: Finished difference Result 2041 states and 2707 transitions. [2019-09-08 12:22:10,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:22:10,681 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-08 12:22:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:10,683 INFO L225 Difference]: With dead ends: 2041 [2019-09-08 12:22:10,684 INFO L226 Difference]: Without dead ends: 1817 [2019-09-08 12:22:10,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:22:10,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2019-09-08 12:22:10,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 873. [2019-09-08 12:22:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-09-08 12:22:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1112 transitions. [2019-09-08 12:22:10,928 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1112 transitions. Word has length 104 [2019-09-08 12:22:10,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:10,929 INFO L475 AbstractCegarLoop]: Abstraction has 873 states and 1112 transitions. [2019-09-08 12:22:10,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:22:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1112 transitions. [2019-09-08 12:22:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:22:10,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:10,930 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] [2019-09-08 12:22:10,930 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:10,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:10,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1726632168, now seen corresponding path program 1 times [2019-09-08 12:22:10,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:10,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:10,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:10,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:10,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:11,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:11,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:22:11,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:22:11,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:22:11,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:22:11,953 INFO L87 Difference]: Start difference. First operand 873 states and 1112 transitions. Second operand 16 states. [2019-09-08 12:22:12,732 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:22:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:16,552 INFO L93 Difference]: Finished difference Result 1350 states and 1693 transitions. [2019-09-08 12:22:16,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:22:16,553 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2019-09-08 12:22:16,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:16,554 INFO L225 Difference]: With dead ends: 1350 [2019-09-08 12:22:16,554 INFO L226 Difference]: Without dead ends: 1346 [2019-09-08 12:22:16,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:22:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2019-09-08 12:22:16,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 879. [2019-09-08 12:22:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-09-08 12:22:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1120 transitions. [2019-09-08 12:22:16,800 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1120 transitions. Word has length 104 [2019-09-08 12:22:16,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:16,800 INFO L475 AbstractCegarLoop]: Abstraction has 879 states and 1120 transitions. [2019-09-08 12:22:16,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:22:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1120 transitions. [2019-09-08 12:22:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:22:16,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:16,802 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] [2019-09-08 12:22:16,802 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:16,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:16,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1213486746, now seen corresponding path program 1 times [2019-09-08 12:22:16,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:16,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:16,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:16,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:16,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:17,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:17,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:22:17,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:22:17,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:22:17,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:22:17,527 INFO L87 Difference]: Start difference. First operand 879 states and 1120 transitions. Second operand 16 states. [2019-09-08 12:22:18,196 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 12:22:18,328 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 12:22:18,463 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 12:22:18,589 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-08 12:22:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:21,892 INFO L93 Difference]: Finished difference Result 1470 states and 1887 transitions. [2019-09-08 12:22:21,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:22:21,893 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2019-09-08 12:22:21,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:21,894 INFO L225 Difference]: With dead ends: 1470 [2019-09-08 12:22:21,894 INFO L226 Difference]: Without dead ends: 1321 [2019-09-08 12:22:21,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:22:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-09-08 12:22:22,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 878. [2019-09-08 12:22:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-09-08 12:22:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1118 transitions. [2019-09-08 12:22:22,130 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1118 transitions. Word has length 104 [2019-09-08 12:22:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:22,130 INFO L475 AbstractCegarLoop]: Abstraction has 878 states and 1118 transitions. [2019-09-08 12:22:22,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:22:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1118 transitions. [2019-09-08 12:22:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:22:22,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:22,131 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] [2019-09-08 12:22:22,131 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:22,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:22,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1657511695, now seen corresponding path program 1 times [2019-09-08 12:22:22,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:22,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:22,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:22,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:22,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:23,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:23,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:23,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:22:23,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:22:23,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:22:23,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:22:23,518 INFO L87 Difference]: Start difference. First operand 878 states and 1118 transitions. Second operand 22 states. [2019-09-08 12:22:24,545 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-08 12:22:24,807 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-08 12:22:25,105 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-08 12:22:25,285 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 12:22:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:28,464 INFO L93 Difference]: Finished difference Result 1579 states and 2075 transitions. [2019-09-08 12:22:28,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:22:28,464 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 104 [2019-09-08 12:22:28,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:28,466 INFO L225 Difference]: With dead ends: 1579 [2019-09-08 12:22:28,466 INFO L226 Difference]: Without dead ends: 1338 [2019-09-08 12:22:28,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:22:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2019-09-08 12:22:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 890. [2019-09-08 12:22:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-09-08 12:22:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1130 transitions. [2019-09-08 12:22:28,703 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1130 transitions. Word has length 104 [2019-09-08 12:22:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:28,703 INFO L475 AbstractCegarLoop]: Abstraction has 890 states and 1130 transitions. [2019-09-08 12:22:28,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:22:28,704 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1130 transitions. [2019-09-08 12:22:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:22:28,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:28,705 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] [2019-09-08 12:22:28,705 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:28,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:28,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1499785276, now seen corresponding path program 1 times [2019-09-08 12:22:28,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:28,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:28,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:28,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:28,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:29,187 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-09-08 12:22:29,752 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-08 12:22:30,050 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:22:30,219 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 12:22:30,390 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 12:22:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:31,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:31,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-08 12:22:31,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 12:22:31,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 12:22:31,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:22:31,497 INFO L87 Difference]: Start difference. First operand 890 states and 1130 transitions. Second operand 30 states. [2019-09-08 12:22:31,707 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2019-09-08 12:22:32,701 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2019-09-08 12:22:32,882 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 35 [2019-09-08 12:22:33,165 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2019-09-08 12:22:33,631 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 73 [2019-09-08 12:22:34,040 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 87 [2019-09-08 12:22:34,582 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 101 [2019-09-08 12:22:35,176 WARN L188 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 114 [2019-09-08 12:22:35,523 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 78 [2019-09-08 12:22:35,835 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 78 [2019-09-08 12:22:36,147 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 73 [2019-09-08 12:22:36,408 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 67 [2019-09-08 12:22:36,694 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 67 [2019-09-08 12:22:37,118 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2019-09-08 12:22:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:47,620 INFO L93 Difference]: Finished difference Result 1653 states and 2165 transitions. [2019-09-08 12:22:47,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 12:22:47,621 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 104 [2019-09-08 12:22:47,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:47,622 INFO L225 Difference]: With dead ends: 1653 [2019-09-08 12:22:47,623 INFO L226 Difference]: Without dead ends: 1476 [2019-09-08 12:22:47,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=550, Invalid=2000, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:22:47,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2019-09-08 12:22:47,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 906. [2019-09-08 12:22:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-08 12:22:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1148 transitions. [2019-09-08 12:22:47,916 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1148 transitions. Word has length 104 [2019-09-08 12:22:47,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:47,916 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1148 transitions. [2019-09-08 12:22:47,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 12:22:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1148 transitions. [2019-09-08 12:22:47,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:22:47,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:47,917 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] [2019-09-08 12:22:47,918 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:47,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:47,918 INFO L82 PathProgramCache]: Analyzing trace with hash -464164647, now seen corresponding path program 1 times [2019-09-08 12:22:47,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:47,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:47,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:47,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:47,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:48,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:48,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 12:22:48,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:22:48,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:22:48,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:22:48,997 INFO L87 Difference]: Start difference. First operand 906 states and 1148 transitions. Second operand 20 states. [2019-09-08 12:22:49,944 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-09-08 12:22:50,204 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-09-08 12:22:50,408 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-08 12:22:50,601 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-08 12:22:50,786 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-08 12:22:50,927 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-08 12:22:51,080 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-08 12:22:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:54,977 INFO L93 Difference]: Finished difference Result 1586 states and 2083 transitions. [2019-09-08 12:22:54,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:22:54,978 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 104 [2019-09-08 12:22:54,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:54,979 INFO L225 Difference]: With dead ends: 1586 [2019-09-08 12:22:54,979 INFO L226 Difference]: Without dead ends: 1318 [2019-09-08 12:22:54,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:22:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2019-09-08 12:22:55,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 896. [2019-09-08 12:22:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-09-08 12:22:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1136 transitions. [2019-09-08 12:22:55,250 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1136 transitions. Word has length 104 [2019-09-08 12:22:55,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:55,251 INFO L475 AbstractCegarLoop]: Abstraction has 896 states and 1136 transitions. [2019-09-08 12:22:55,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:22:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1136 transitions. [2019-09-08 12:22:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:22:55,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:55,252 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] [2019-09-08 12:22:55,252 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:55,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:55,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1008248256, now seen corresponding path program 1 times [2019-09-08 12:22:55,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:55,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:55,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:55,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:55,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:55,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:55,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:22:55,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:22:55,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:22:55,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:22:55,986 INFO L87 Difference]: Start difference. First operand 896 states and 1136 transitions. Second operand 17 states. [2019-09-08 12:22:56,639 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:23:01,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:01,013 INFO L93 Difference]: Finished difference Result 1818 states and 2414 transitions. [2019-09-08 12:23:01,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:23:01,014 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-08 12:23:01,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:01,016 INFO L225 Difference]: With dead ends: 1818 [2019-09-08 12:23:01,016 INFO L226 Difference]: Without dead ends: 1669 [2019-09-08 12:23:01,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:23:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-09-08 12:23:01,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 896. [2019-09-08 12:23:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-09-08 12:23:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1134 transitions. [2019-09-08 12:23:01,294 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1134 transitions. Word has length 104 [2019-09-08 12:23:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:01,294 INFO L475 AbstractCegarLoop]: Abstraction has 896 states and 1134 transitions. [2019-09-08 12:23:01,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:23:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1134 transitions. [2019-09-08 12:23:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:23:01,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:01,296 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] [2019-09-08 12:23:01,296 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:01,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:01,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1599888547, now seen corresponding path program 1 times [2019-09-08 12:23:01,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:01,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:01,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:01,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:01,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:02,358 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 12:23:03,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:03,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:03,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-08 12:23:03,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 12:23:03,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 12:23:03,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:23:03,196 INFO L87 Difference]: Start difference. First operand 896 states and 1134 transitions. Second operand 27 states. [2019-09-08 12:23:03,347 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-08 12:23:04,318 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-08 12:23:04,888 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-08 12:23:05,213 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 12:23:05,605 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-08 12:23:06,239 WARN L188 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-08 12:23:06,465 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 12:23:06,808 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-08 12:23:07,083 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-08 12:23:07,393 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:23:07,715 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:23:08,238 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:23:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:17,147 INFO L93 Difference]: Finished difference Result 1842 states and 2409 transitions. [2019-09-08 12:23:17,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 12:23:17,147 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 104 [2019-09-08 12:23:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:17,149 INFO L225 Difference]: With dead ends: 1842 [2019-09-08 12:23:17,149 INFO L226 Difference]: Without dead ends: 1691 [2019-09-08 12:23:17,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=433, Invalid=1547, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 12:23:17,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2019-09-08 12:23:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 907. [2019-09-08 12:23:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-09-08 12:23:17,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1146 transitions. [2019-09-08 12:23:17,432 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1146 transitions. Word has length 104 [2019-09-08 12:23:17,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:17,432 INFO L475 AbstractCegarLoop]: Abstraction has 907 states and 1146 transitions. [2019-09-08 12:23:17,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 12:23:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1146 transitions. [2019-09-08 12:23:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:23:17,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:17,434 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] [2019-09-08 12:23:17,434 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:17,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1392964829, now seen corresponding path program 1 times [2019-09-08 12:23:17,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:17,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:17,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:17,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:17,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:18,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:18,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:23:18,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:23:18,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:23:18,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:23:18,160 INFO L87 Difference]: Start difference. First operand 907 states and 1146 transitions. Second operand 17 states. [2019-09-08 12:23:18,818 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:23:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:23,419 INFO L93 Difference]: Finished difference Result 1829 states and 2423 transitions. [2019-09-08 12:23:23,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:23:23,420 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-08 12:23:23,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:23,422 INFO L225 Difference]: With dead ends: 1829 [2019-09-08 12:23:23,422 INFO L226 Difference]: Without dead ends: 1678 [2019-09-08 12:23:23,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:23:23,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-09-08 12:23:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 907. [2019-09-08 12:23:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-09-08 12:23:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1144 transitions. [2019-09-08 12:23:23,702 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1144 transitions. Word has length 104 [2019-09-08 12:23:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:23,703 INFO L475 AbstractCegarLoop]: Abstraction has 907 states and 1144 transitions. [2019-09-08 12:23:23,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:23:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1144 transitions. [2019-09-08 12:23:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:23:23,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:23,704 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] [2019-09-08 12:23:23,705 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:23,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:23,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1748743276, now seen corresponding path program 1 times [2019-09-08 12:23:23,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:23,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:23,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:23,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:23,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:24,757 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:23:25,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:25,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:25,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-08 12:23:25,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 12:23:25,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 12:23:25,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:23:25,664 INFO L87 Difference]: Start difference. First operand 907 states and 1144 transitions. Second operand 27 states. [2019-09-08 12:23:25,814 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-08 12:23:26,686 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-08 12:23:27,221 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-09-08 12:23:27,553 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-08 12:23:27,933 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-09-08 12:23:28,377 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2019-09-08 12:23:28,589 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-08 12:23:28,866 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-08 12:23:29,119 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-08 12:23:29,330 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-08 12:23:29,562 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-08 12:23:29,885 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-08 12:23:34,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:34,935 INFO L93 Difference]: Finished difference Result 1478 states and 1934 transitions. [2019-09-08 12:23:34,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 12:23:34,936 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 104 [2019-09-08 12:23:34,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:34,938 INFO L225 Difference]: With dead ends: 1478 [2019-09-08 12:23:34,938 INFO L226 Difference]: Without dead ends: 1310 [2019-09-08 12:23:34,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=433, Invalid=1547, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 12:23:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2019-09-08 12:23:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 918. [2019-09-08 12:23:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-09-08 12:23:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1156 transitions. [2019-09-08 12:23:35,224 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1156 transitions. Word has length 104 [2019-09-08 12:23:35,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:35,225 INFO L475 AbstractCegarLoop]: Abstraction has 918 states and 1156 transitions. [2019-09-08 12:23:35,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 12:23:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1156 transitions. [2019-09-08 12:23:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:23:35,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:35,226 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] [2019-09-08 12:23:35,226 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:35,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:35,227 INFO L82 PathProgramCache]: Analyzing trace with hash 88268615, now seen corresponding path program 1 times [2019-09-08 12:23:35,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:35,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:35,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:35,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:35,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:35,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:35,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:23:35,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:23:35,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:23:35,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:23:35,937 INFO L87 Difference]: Start difference. First operand 918 states and 1156 transitions. Second operand 17 states. [2019-09-08 12:23:36,539 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:23:36,682 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 12:23:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:38,430 INFO L93 Difference]: Finished difference Result 1475 states and 1951 transitions. [2019-09-08 12:23:38,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:23:38,430 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-08 12:23:38,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:38,432 INFO L225 Difference]: With dead ends: 1475 [2019-09-08 12:23:38,432 INFO L226 Difference]: Without dead ends: 1217 [2019-09-08 12:23:38,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:23:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-09-08 12:23:38,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 854. [2019-09-08 12:23:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-09-08 12:23:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1076 transitions. [2019-09-08 12:23:38,709 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1076 transitions. Word has length 104 [2019-09-08 12:23:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:38,709 INFO L475 AbstractCegarLoop]: Abstraction has 854 states and 1076 transitions. [2019-09-08 12:23:38,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:23:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1076 transitions. [2019-09-08 12:23:38,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:23:38,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:38,710 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] [2019-09-08 12:23:38,710 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:38,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:38,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1710464, now seen corresponding path program 1 times [2019-09-08 12:23:38,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:38,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:38,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:38,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:38,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:38,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:38,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:38,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:38,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:38,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:38,842 INFO L87 Difference]: Start difference. First operand 854 states and 1076 transitions. Second operand 9 states. [2019-09-08 12:23:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:41,383 INFO L93 Difference]: Finished difference Result 1509 states and 1976 transitions. [2019-09-08 12:23:41,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:41,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:23:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:41,385 INFO L225 Difference]: With dead ends: 1509 [2019-09-08 12:23:41,385 INFO L226 Difference]: Without dead ends: 1502 [2019-09-08 12:23:41,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:23:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-09-08 12:23:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 854. [2019-09-08 12:23:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-09-08 12:23:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1073 transitions. [2019-09-08 12:23:41,655 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1073 transitions. Word has length 105 [2019-09-08 12:23:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:41,655 INFO L475 AbstractCegarLoop]: Abstraction has 854 states and 1073 transitions. [2019-09-08 12:23:41,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1073 transitions. [2019-09-08 12:23:41,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:23:41,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:41,657 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] [2019-09-08 12:23:41,657 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:41,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:41,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1026369323, now seen corresponding path program 1 times [2019-09-08 12:23:41,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:41,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:41,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:41,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:41,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:41,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:41,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:41,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:41,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:41,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:41,795 INFO L87 Difference]: Start difference. First operand 854 states and 1073 transitions. Second operand 9 states. [2019-09-08 12:23:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:44,013 INFO L93 Difference]: Finished difference Result 1714 states and 2271 transitions. [2019-09-08 12:23:44,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:44,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:23:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:44,015 INFO L225 Difference]: With dead ends: 1714 [2019-09-08 12:23:44,015 INFO L226 Difference]: Without dead ends: 1536 [2019-09-08 12:23:44,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:23:44,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2019-09-08 12:23:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 854. [2019-09-08 12:23:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-09-08 12:23:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1070 transitions. [2019-09-08 12:23:44,286 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1070 transitions. Word has length 105 [2019-09-08 12:23:44,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:44,287 INFO L475 AbstractCegarLoop]: Abstraction has 854 states and 1070 transitions. [2019-09-08 12:23:44,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1070 transitions. [2019-09-08 12:23:44,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:23:44,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:44,288 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] [2019-09-08 12:23:44,289 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:44,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:44,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1566388671, now seen corresponding path program 1 times [2019-09-08 12:23:44,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:44,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:44,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:44,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:44,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:44,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:44,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:23:44,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:23:44,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:23:44,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:23:44,715 INFO L87 Difference]: Start difference. First operand 854 states and 1070 transitions. Second operand 12 states. [2019-09-08 12:23:45,197 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-08 12:23:45,342 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-08 12:23:45,625 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-09-08 12:23:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:47,226 INFO L93 Difference]: Finished difference Result 2068 states and 2782 transitions. [2019-09-08 12:23:47,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:23:47,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2019-09-08 12:23:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:47,228 INFO L225 Difference]: With dead ends: 2068 [2019-09-08 12:23:47,228 INFO L226 Difference]: Without dead ends: 1886 [2019-09-08 12:23:47,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:23:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2019-09-08 12:23:47,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 820. [2019-09-08 12:23:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2019-09-08 12:23:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1028 transitions. [2019-09-08 12:23:47,497 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1028 transitions. Word has length 105 [2019-09-08 12:23:47,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:47,497 INFO L475 AbstractCegarLoop]: Abstraction has 820 states and 1028 transitions. [2019-09-08 12:23:47,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:23:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1028 transitions. [2019-09-08 12:23:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:23:47,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:47,498 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] [2019-09-08 12:23:47,499 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:47,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:47,499 INFO L82 PathProgramCache]: Analyzing trace with hash 426480591, now seen corresponding path program 1 times [2019-09-08 12:23:47,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:47,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:47,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:47,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:47,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:47,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:47,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:23:47,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:23:47,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:23:47,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:23:47,840 INFO L87 Difference]: Start difference. First operand 820 states and 1028 transitions. Second operand 11 states. [2019-09-08 12:23:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:50,648 INFO L93 Difference]: Finished difference Result 2424 states and 3329 transitions. [2019-09-08 12:23:50,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:50,648 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-09-08 12:23:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:50,650 INFO L225 Difference]: With dead ends: 2424 [2019-09-08 12:23:50,650 INFO L226 Difference]: Without dead ends: 2250 [2019-09-08 12:23:50,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:23:50,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2019-09-08 12:23:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 778. [2019-09-08 12:23:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-09-08 12:23:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 975 transitions. [2019-09-08 12:23:50,920 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 975 transitions. Word has length 105 [2019-09-08 12:23:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:50,920 INFO L475 AbstractCegarLoop]: Abstraction has 778 states and 975 transitions. [2019-09-08 12:23:50,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:23:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 975 transitions. [2019-09-08 12:23:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:23:50,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:50,922 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] [2019-09-08 12:23:50,922 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:50,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:50,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1169420094, now seen corresponding path program 1 times [2019-09-08 12:23:50,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:50,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:50,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:50,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:50,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:51,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:51,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:23:51,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:23:51,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:23:51,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:23:51,242 INFO L87 Difference]: Start difference. First operand 778 states and 975 transitions. Second operand 11 states. [2019-09-08 12:23:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:53,244 INFO L93 Difference]: Finished difference Result 1428 states and 1868 transitions. [2019-09-08 12:23:53,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:23:53,244 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-09-08 12:23:53,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:53,245 INFO L225 Difference]: With dead ends: 1428 [2019-09-08 12:23:53,246 INFO L226 Difference]: Without dead ends: 1274 [2019-09-08 12:23:53,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:23:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-09-08 12:23:53,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 760. [2019-09-08 12:23:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-09-08 12:23:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 952 transitions. [2019-09-08 12:23:53,534 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 952 transitions. Word has length 105 [2019-09-08 12:23:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:53,535 INFO L475 AbstractCegarLoop]: Abstraction has 760 states and 952 transitions. [2019-09-08 12:23:53,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:23:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 952 transitions. [2019-09-08 12:23:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:23:53,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:53,536 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] [2019-09-08 12:23:53,536 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:53,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:53,537 INFO L82 PathProgramCache]: Analyzing trace with hash 556450702, now seen corresponding path program 1 times [2019-09-08 12:23:53,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:53,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:53,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:53,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:53,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:53,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:53,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:23:53,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:23:53,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:23:53,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:23:53,873 INFO L87 Difference]: Start difference. First operand 760 states and 952 transitions. Second operand 11 states. [2019-09-08 12:23:55,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:55,559 INFO L93 Difference]: Finished difference Result 1414 states and 1855 transitions. [2019-09-08 12:23:55,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:23:55,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-09-08 12:23:55,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:55,561 INFO L225 Difference]: With dead ends: 1414 [2019-09-08 12:23:55,561 INFO L226 Difference]: Without dead ends: 1246 [2019-09-08 12:23:55,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:23:55,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2019-09-08 12:23:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 733. [2019-09-08 12:23:55,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-09-08 12:23:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 917 transitions. [2019-09-08 12:23:55,838 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 917 transitions. Word has length 105 [2019-09-08 12:23:55,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:55,838 INFO L475 AbstractCegarLoop]: Abstraction has 733 states and 917 transitions. [2019-09-08 12:23:55,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:23:55,838 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 917 transitions. [2019-09-08 12:23:55,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:23:55,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:55,839 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] [2019-09-08 12:23:55,840 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:55,840 INFO L82 PathProgramCache]: Analyzing trace with hash -871173262, now seen corresponding path program 1 times [2019-09-08 12:23:55,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:55,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:55,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:55,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:55,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:56,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:56,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:23:56,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:23:56,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:23:56,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:23:56,252 INFO L87 Difference]: Start difference. First operand 733 states and 917 transitions. Second operand 12 states. [2019-09-08 12:23:58,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:58,596 INFO L93 Difference]: Finished difference Result 1866 states and 2527 transitions. [2019-09-08 12:23:58,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:23:58,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2019-09-08 12:23:58,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:58,598 INFO L225 Difference]: With dead ends: 1866 [2019-09-08 12:23:58,599 INFO L226 Difference]: Without dead ends: 1653 [2019-09-08 12:23:58,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:23:58,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2019-09-08 12:23:58,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 668. [2019-09-08 12:23:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-08 12:23:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 839 transitions. [2019-09-08 12:23:58,862 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 839 transitions. Word has length 105 [2019-09-08 12:23:58,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:58,862 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 839 transitions. [2019-09-08 12:23:58,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:23:58,862 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 839 transitions. [2019-09-08 12:23:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:23:58,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:58,863 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] [2019-09-08 12:23:58,863 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:58,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:58,863 INFO L82 PathProgramCache]: Analyzing trace with hash 593307121, now seen corresponding path program 1 times [2019-09-08 12:23:58,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:58,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:58,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:58,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:58,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:59,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:59,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:59,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:23:59,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:23:59,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:23:59,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:23:59,970 INFO L87 Difference]: Start difference. First operand 668 states and 839 transitions. Second operand 21 states. [2019-09-08 12:24:00,983 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 12:24:01,266 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-08 12:24:01,443 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 12:24:01,605 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 12:24:01,759 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 12:24:02,317 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 12:24:06,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:06,449 INFO L93 Difference]: Finished difference Result 1337 states and 1685 transitions. [2019-09-08 12:24:06,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:24:06,450 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-09-08 12:24:06,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:06,451 INFO L225 Difference]: With dead ends: 1337 [2019-09-08 12:24:06,451 INFO L226 Difference]: Without dead ends: 1331 [2019-09-08 12:24:06,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:24:06,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-09-08 12:24:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 668. [2019-09-08 12:24:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-08 12:24:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 838 transitions. [2019-09-08 12:24:06,719 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 838 transitions. Word has length 105 [2019-09-08 12:24:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:06,719 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 838 transitions. [2019-09-08 12:24:06,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:24:06,719 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 838 transitions. [2019-09-08 12:24:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:24:06,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:06,720 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] [2019-09-08 12:24:06,720 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:06,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:06,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1230801955, now seen corresponding path program 1 times [2019-09-08 12:24:06,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:06,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:06,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:06,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:06,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:07,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:07,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:24:07,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:24:07,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:24:07,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:24:07,467 INFO L87 Difference]: Start difference. First operand 668 states and 838 transitions. Second operand 16 states. [2019-09-08 12:24:08,172 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:24:08,332 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:24:08,486 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:24:08,674 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:24:08,847 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:24:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:11,970 INFO L93 Difference]: Finished difference Result 1179 states and 1514 transitions. [2019-09-08 12:24:11,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:24:11,970 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2019-09-08 12:24:11,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:11,971 INFO L225 Difference]: With dead ends: 1179 [2019-09-08 12:24:11,971 INFO L226 Difference]: Without dead ends: 1030 [2019-09-08 12:24:11,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:24:11,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-09-08 12:24:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 667. [2019-09-08 12:24:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-09-08 12:24:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 836 transitions. [2019-09-08 12:24:12,233 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 836 transitions. Word has length 105 [2019-09-08 12:24:12,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:12,233 INFO L475 AbstractCegarLoop]: Abstraction has 667 states and 836 transitions. [2019-09-08 12:24:12,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:24:12,233 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 836 transitions. [2019-09-08 12:24:12,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:24:12,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:12,234 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] [2019-09-08 12:24:12,234 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:12,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:12,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1674768317, now seen corresponding path program 1 times [2019-09-08 12:24:12,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:12,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:12,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:12,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:12,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:12,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:12,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:12,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:24:12,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:24:12,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:24:12,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:24:12,787 INFO L87 Difference]: Start difference. First operand 667 states and 836 transitions. Second operand 13 states. [2019-09-08 12:24:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:16,256 INFO L93 Difference]: Finished difference Result 2580 states and 3543 transitions. [2019-09-08 12:24:16,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:24:16,256 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 105 [2019-09-08 12:24:16,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:16,259 INFO L225 Difference]: With dead ends: 2580 [2019-09-08 12:24:16,259 INFO L226 Difference]: Without dead ends: 2391 [2019-09-08 12:24:16,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:24:16,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2019-09-08 12:24:16,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 624. [2019-09-08 12:24:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-09-08 12:24:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 781 transitions. [2019-09-08 12:24:16,531 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 781 transitions. Word has length 105 [2019-09-08 12:24:16,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:16,531 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 781 transitions. [2019-09-08 12:24:16,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:24:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 781 transitions. [2019-09-08 12:24:16,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:24:16,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:16,532 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] [2019-09-08 12:24:16,532 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:16,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:16,532 INFO L82 PathProgramCache]: Analyzing trace with hash 390784349, now seen corresponding path program 1 times [2019-09-08 12:24:16,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:16,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:16,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:16,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:16,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:16,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:16,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:24:17,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:24:17,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:24:17,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:24:17,002 INFO L87 Difference]: Start difference. First operand 624 states and 781 transitions. Second operand 12 states. [2019-09-08 12:24:18,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:18,365 INFO L93 Difference]: Finished difference Result 1211 states and 1630 transitions. [2019-09-08 12:24:18,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:24:18,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2019-09-08 12:24:18,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:18,367 INFO L225 Difference]: With dead ends: 1211 [2019-09-08 12:24:18,367 INFO L226 Difference]: Without dead ends: 929 [2019-09-08 12:24:18,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:24:18,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-09-08 12:24:18,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 490. [2019-09-08 12:24:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-08 12:24:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 621 transitions. [2019-09-08 12:24:18,606 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 621 transitions. Word has length 105 [2019-09-08 12:24:18,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:18,606 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 621 transitions. [2019-09-08 12:24:18,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:24:18,606 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 621 transitions. [2019-09-08 12:24:18,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:24:18,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:18,607 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] [2019-09-08 12:24:18,607 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:18,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:18,608 INFO L82 PathProgramCache]: Analyzing trace with hash 238920912, now seen corresponding path program 1 times [2019-09-08 12:24:18,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:18,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:18,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:18,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:18,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:19,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 12:24:19,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:19,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:24:19,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:24:19,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:24:19,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:24:19,196 INFO L87 Difference]: Start difference. First operand 490 states and 621 transitions. Second operand 15 states. [2019-09-08 12:24:19,742 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:24:19,874 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:24:21,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:21,469 INFO L93 Difference]: Finished difference Result 1038 states and 1396 transitions. [2019-09-08 12:24:21,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:24:21,470 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 105 [2019-09-08 12:24:21,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:21,471 INFO L225 Difference]: With dead ends: 1038 [2019-09-08 12:24:21,471 INFO L226 Difference]: Without dead ends: 764 [2019-09-08 12:24:21,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:24:21,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-08 12:24:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 429. [2019-09-08 12:24:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-09-08 12:24:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 547 transitions. [2019-09-08 12:24:21,692 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 547 transitions. Word has length 105 [2019-09-08 12:24:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:21,692 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 547 transitions. [2019-09-08 12:24:21,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:24:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 547 transitions. [2019-09-08 12:24:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:24:21,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:21,693 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] [2019-09-08 12:24:21,693 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:21,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:21,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1983508514, now seen corresponding path program 1 times [2019-09-08 12:24:21,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:21,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:21,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:21,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:21,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:22,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:22,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:24:22,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:24:22,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:24:22,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:24:22,079 INFO L87 Difference]: Start difference. First operand 429 states and 547 transitions. Second operand 10 states. [2019-09-08 12:24:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:23,295 INFO L93 Difference]: Finished difference Result 1041 states and 1446 transitions. [2019-09-08 12:24:23,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:24:23,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-09-08 12:24:23,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:23,297 INFO L225 Difference]: With dead ends: 1041 [2019-09-08 12:24:23,297 INFO L226 Difference]: Without dead ends: 769 [2019-09-08 12:24:23,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:24:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-09-08 12:24:23,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 305. [2019-09-08 12:24:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-08 12:24:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 391 transitions. [2019-09-08 12:24:23,479 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 391 transitions. Word has length 105 [2019-09-08 12:24:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:23,480 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 391 transitions. [2019-09-08 12:24:23,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:24:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 391 transitions. [2019-09-08 12:24:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:24:23,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:23,480 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] [2019-09-08 12:24:23,481 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:23,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1740537637, now seen corresponding path program 1 times [2019-09-08 12:24:23,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:23,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:23,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:23,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:23,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:24,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:24,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-08 12:24:24,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 12:24:24,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 12:24:24,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:24:24,802 INFO L87 Difference]: Start difference. First operand 305 states and 391 transitions. Second operand 33 states. [2019-09-08 12:24:25,219 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 105 [2019-09-08 12:24:26,201 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:24:26,639 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 12:24:26,885 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-08 12:24:27,198 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-08 12:24:27,554 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-08 12:24:27,949 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-08 12:24:28,175 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-08 12:24:28,394 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-08 12:24:31,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:31,913 INFO L93 Difference]: Finished difference Result 1118 states and 1569 transitions. [2019-09-08 12:24:31,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 12:24:31,913 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 107 [2019-09-08 12:24:31,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:31,915 INFO L225 Difference]: With dead ends: 1118 [2019-09-08 12:24:31,915 INFO L226 Difference]: Without dead ends: 1112 [2019-09-08 12:24:31,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=597, Invalid=3185, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 12:24:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2019-09-08 12:24:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 326. [2019-09-08 12:24:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-08 12:24:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 417 transitions. [2019-09-08 12:24:32,113 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 417 transitions. Word has length 107 [2019-09-08 12:24:32,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:32,114 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 417 transitions. [2019-09-08 12:24:32,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 12:24:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 417 transitions. [2019-09-08 12:24:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:24:32,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:32,114 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] [2019-09-08 12:24:32,115 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:32,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:32,115 INFO L82 PathProgramCache]: Analyzing trace with hash -412004435, now seen corresponding path program 1 times [2019-09-08 12:24:32,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:32,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:32,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:32,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:32,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:32,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:32,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:24:32,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:24:32,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:24:32,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:24:32,770 INFO L87 Difference]: Start difference. First operand 326 states and 417 transitions. Second operand 16 states. [2019-09-08 12:24:33,456 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 12:24:33,984 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 12:24:35,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:35,894 INFO L93 Difference]: Finished difference Result 1014 states and 1406 transitions. [2019-09-08 12:24:35,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:24:35,895 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2019-09-08 12:24:35,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:35,896 INFO L225 Difference]: With dead ends: 1014 [2019-09-08 12:24:35,896 INFO L226 Difference]: Without dead ends: 1008 [2019-09-08 12:24:35,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:24:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-09-08 12:24:36,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 332. [2019-09-08 12:24:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-08 12:24:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 425 transitions. [2019-09-08 12:24:36,097 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 425 transitions. Word has length 108 [2019-09-08 12:24:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:36,097 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 425 transitions. [2019-09-08 12:24:36,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:24:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 425 transitions. [2019-09-08 12:24:36,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:24:36,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:36,098 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] [2019-09-08 12:24:36,098 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:36,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:36,098 INFO L82 PathProgramCache]: Analyzing trace with hash 451424884, now seen corresponding path program 1 times [2019-09-08 12:24:36,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:36,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:36,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:36,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:36,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:37,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:37,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:24:37,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:24:37,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:24:37,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:24:37,965 INFO L87 Difference]: Start difference. First operand 332 states and 425 transitions. Second operand 26 states. [2019-09-08 12:24:38,132 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-09-08 12:24:39,333 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-08 12:24:39,601 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-08 12:24:39,917 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-09-08 12:24:40,335 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 90 [2019-09-08 12:24:40,578 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-08 12:24:40,814 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-08 12:24:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:42,938 INFO L93 Difference]: Finished difference Result 691 states and 935 transitions. [2019-09-08 12:24:42,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:24:42,938 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 108 [2019-09-08 12:24:42,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:42,940 INFO L225 Difference]: With dead ends: 691 [2019-09-08 12:24:42,940 INFO L226 Difference]: Without dead ends: 685 [2019-09-08 12:24:42,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=321, Invalid=1319, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 12:24:42,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-09-08 12:24:43,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 333. [2019-09-08 12:24:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-08 12:24:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 426 transitions. [2019-09-08 12:24:43,139 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 426 transitions. Word has length 108 [2019-09-08 12:24:43,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:43,140 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 426 transitions. [2019-09-08 12:24:43,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:24:43,140 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 426 transitions. [2019-09-08 12:24:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:24:43,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:43,141 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] [2019-09-08 12:24:43,141 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:43,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:43,141 INFO L82 PathProgramCache]: Analyzing trace with hash -488774045, now seen corresponding path program 1 times [2019-09-08 12:24:43,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:43,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:43,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:43,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:43,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:44,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:44,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:24:44,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:24:44,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:24:44,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:44,307 INFO L87 Difference]: Start difference. First operand 333 states and 426 transitions. Second operand 21 states. [2019-09-08 12:24:45,365 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:24:45,626 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-08 12:24:45,802 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:24:45,965 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:24:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:47,515 INFO L93 Difference]: Finished difference Result 679 states and 922 transitions. [2019-09-08 12:24:47,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:24:47,516 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 108 [2019-09-08 12:24:47,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:47,517 INFO L225 Difference]: With dead ends: 679 [2019-09-08 12:24:47,517 INFO L226 Difference]: Without dead ends: 673 [2019-09-08 12:24:47,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:24:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-09-08 12:24:47,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 334. [2019-09-08 12:24:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-08 12:24:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 427 transitions. [2019-09-08 12:24:47,719 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 427 transitions. Word has length 108 [2019-09-08 12:24:47,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:47,719 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 427 transitions. [2019-09-08 12:24:47,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:24:47,719 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 427 transitions. [2019-09-08 12:24:47,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:24:47,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:47,720 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] [2019-09-08 12:24:47,720 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:47,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:47,720 INFO L82 PathProgramCache]: Analyzing trace with hash -755651892, now seen corresponding path program 1 times [2019-09-08 12:24:47,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:47,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:47,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:47,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:47,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:48,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:48,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:24:48,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:24:48,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:24:48,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:24:48,411 INFO L87 Difference]: Start difference. First operand 334 states and 427 transitions. Second operand 16 states. [2019-09-08 12:24:49,086 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:24:49,221 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:24:49,352 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:24:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:51,541 INFO L93 Difference]: Finished difference Result 1125 states and 1579 transitions. [2019-09-08 12:24:51,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:24:51,542 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2019-09-08 12:24:51,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:51,543 INFO L225 Difference]: With dead ends: 1125 [2019-09-08 12:24:51,543 INFO L226 Difference]: Without dead ends: 1119 [2019-09-08 12:24:51,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:24:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-09-08 12:24:51,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 311. [2019-09-08 12:24:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-08 12:24:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 398 transitions. [2019-09-08 12:24:51,750 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 398 transitions. Word has length 108 [2019-09-08 12:24:51,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:51,750 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 398 transitions. [2019-09-08 12:24:51,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:24:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 398 transitions. [2019-09-08 12:24:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:24:51,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:51,750 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] [2019-09-08 12:24:51,751 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:51,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:51,751 INFO L82 PathProgramCache]: Analyzing trace with hash -398163250, now seen corresponding path program 1 times [2019-09-08 12:24:51,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:51,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:51,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:52,404 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-09-08 12:24:52,525 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-08 12:24:52,651 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-08 12:24:52,803 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-08 12:24:52,964 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-08 12:24:53,325 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-08 12:24:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:55,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:55,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-08 12:24:55,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 12:24:55,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 12:24:55,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:24:55,307 INFO L87 Difference]: Start difference. First operand 311 states and 398 transitions. Second operand 33 states. [2019-09-08 12:24:55,619 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2019-09-08 12:24:56,410 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-09-08 12:24:56,607 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-09-08 12:24:56,839 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-08 12:24:57,127 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-08 12:24:57,457 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-08 12:24:57,794 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-08 12:24:58,368 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2019-09-08 12:24:58,706 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2019-09-08 12:24:59,070 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2019-09-08 12:24:59,475 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 80 [2019-09-08 12:24:59,947 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 91 [2019-09-08 12:25:00,519 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 107 [2019-09-08 12:25:00,891 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2019-09-08 12:25:01,246 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2019-09-08 12:25:01,603 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 81 [2019-09-08 12:25:01,970 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 88 [2019-09-08 12:25:02,337 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2019-09-08 12:25:02,589 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-09-08 12:25:02,919 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 79 [2019-09-08 12:25:03,253 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 12:25:04,416 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-08 12:25:05,039 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-08 12:25:05,490 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-08 12:25:06,408 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-09-08 12:25:06,929 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-08 12:25:07,272 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-09-08 12:25:09,474 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2019-09-08 12:25:11,335 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-09-08 12:25:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:23,168 INFO L93 Difference]: Finished difference Result 2760 states and 3919 transitions. [2019-09-08 12:25:23,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 12:25:23,168 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 108 [2019-09-08 12:25:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:23,171 INFO L225 Difference]: With dead ends: 2760 [2019-09-08 12:25:23,171 INFO L226 Difference]: Without dead ends: 2754 [2019-09-08 12:25:23,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=832, Invalid=4570, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 12:25:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2019-09-08 12:25:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 326. [2019-09-08 12:25:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-08 12:25:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 416 transitions. [2019-09-08 12:25:23,403 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 416 transitions. Word has length 108 [2019-09-08 12:25:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:23,403 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 416 transitions. [2019-09-08 12:25:23,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 12:25:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 416 transitions. [2019-09-08 12:25:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:25:23,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:23,404 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] [2019-09-08 12:25:23,404 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:23,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:23,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1423793173, now seen corresponding path program 1 times [2019-09-08 12:25:23,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:23,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:23,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:23,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:23,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:24,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:24,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:24,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:25:24,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:25:24,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:25:24,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:25:24,051 INFO L87 Difference]: Start difference. First operand 326 states and 416 transitions. Second operand 14 states. [2019-09-08 12:25:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:26,373 INFO L93 Difference]: Finished difference Result 1058 states and 1480 transitions. [2019-09-08 12:25:26,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:25:26,374 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2019-09-08 12:25:26,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:26,375 INFO L225 Difference]: With dead ends: 1058 [2019-09-08 12:25:26,375 INFO L226 Difference]: Without dead ends: 1052 [2019-09-08 12:25:26,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:25:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-09-08 12:25:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 299. [2019-09-08 12:25:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-09-08 12:25:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 384 transitions. [2019-09-08 12:25:26,582 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 384 transitions. Word has length 109 [2019-09-08 12:25:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:26,582 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 384 transitions. [2019-09-08 12:25:26,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:25:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 384 transitions. [2019-09-08 12:25:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:25:26,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:26,583 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] [2019-09-08 12:25:26,584 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:26,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:26,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1928476296, now seen corresponding path program 1 times [2019-09-08 12:25:26,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:26,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:26,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:26,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:26,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:26,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:26,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:25:26,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:25:26,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:25:26,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:26,674 INFO L87 Difference]: Start difference. First operand 299 states and 384 transitions. Second operand 3 states. [2019-09-08 12:25:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:27,101 INFO L93 Difference]: Finished difference Result 587 states and 808 transitions. [2019-09-08 12:25:27,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:25:27,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-08 12:25:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:27,103 INFO L225 Difference]: With dead ends: 587 [2019-09-08 12:25:27,103 INFO L226 Difference]: Without dead ends: 439 [2019-09-08 12:25:27,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-09-08 12:25:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2019-09-08 12:25:27,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-09-08 12:25:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 585 transitions. [2019-09-08 12:25:27,470 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 585 transitions. Word has length 139 [2019-09-08 12:25:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:27,470 INFO L475 AbstractCegarLoop]: Abstraction has 437 states and 585 transitions. [2019-09-08 12:25:27,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:25:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 585 transitions. [2019-09-08 12:25:27,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:25:27,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:27,471 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] [2019-09-08 12:25:27,472 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:27,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:27,472 INFO L82 PathProgramCache]: Analyzing trace with hash -458142361, now seen corresponding path program 1 times [2019-09-08 12:25:27,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:27,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:27,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:27,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:27,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:27,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:27,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:25:27,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:25:27,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:25:27,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:25:27,581 INFO L87 Difference]: Start difference. First operand 437 states and 585 transitions. Second operand 7 states. [2019-09-08 12:25:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:29,938 INFO L93 Difference]: Finished difference Result 1933 states and 2781 transitions. [2019-09-08 12:25:29,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:25:29,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-08 12:25:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:29,941 INFO L225 Difference]: With dead ends: 1933 [2019-09-08 12:25:29,941 INFO L226 Difference]: Without dead ends: 1647 [2019-09-08 12:25:29,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:25:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2019-09-08 12:25:30,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 761. [2019-09-08 12:25:30,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-09-08 12:25:30,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1061 transitions. [2019-09-08 12:25:30,710 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1061 transitions. Word has length 141 [2019-09-08 12:25:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:30,711 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 1061 transitions. [2019-09-08 12:25:30,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:25:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1061 transitions. [2019-09-08 12:25:30,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:25:30,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:30,712 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] [2019-09-08 12:25:30,712 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:30,712 INFO L82 PathProgramCache]: Analyzing trace with hash 569314779, now seen corresponding path program 1 times [2019-09-08 12:25:30,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:30,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:30,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:30,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:30,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:30,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:30,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:25:30,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:25:30,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:25:30,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:25:30,816 INFO L87 Difference]: Start difference. First operand 761 states and 1061 transitions. Second operand 7 states. [2019-09-08 12:25:34,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:34,766 INFO L93 Difference]: Finished difference Result 3585 states and 5193 transitions. [2019-09-08 12:25:34,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:25:34,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-08 12:25:34,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:34,769 INFO L225 Difference]: With dead ends: 3585 [2019-09-08 12:25:34,769 INFO L226 Difference]: Without dead ends: 2975 [2019-09-08 12:25:34,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:25:34,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2019-09-08 12:25:36,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1449. [2019-09-08 12:25:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2019-09-08 12:25:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2069 transitions. [2019-09-08 12:25:36,259 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2069 transitions. Word has length 141 [2019-09-08 12:25:36,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:36,260 INFO L475 AbstractCegarLoop]: Abstraction has 1449 states and 2069 transitions. [2019-09-08 12:25:36,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:25:36,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2069 transitions. [2019-09-08 12:25:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:25:36,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:36,261 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] [2019-09-08 12:25:36,261 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:36,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:36,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1954899243, now seen corresponding path program 1 times [2019-09-08 12:25:36,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:36,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:36,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:36,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:36,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:36,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:36,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:25:36,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:25:36,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:25:36,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:25:36,376 INFO L87 Difference]: Start difference. First operand 1449 states and 2069 transitions. Second operand 7 states. [2019-09-08 12:25:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:43,571 INFO L93 Difference]: Finished difference Result 7089 states and 10297 transitions. [2019-09-08 12:25:43,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:25:43,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-08 12:25:43,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:43,577 INFO L225 Difference]: With dead ends: 7089 [2019-09-08 12:25:43,577 INFO L226 Difference]: Without dead ends: 5791 [2019-09-08 12:25:43,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:25:43,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5791 states. [2019-09-08 12:25:46,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5791 to 2905. [2019-09-08 12:25:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2905 states. [2019-09-08 12:25:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 4197 transitions. [2019-09-08 12:25:46,679 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 4197 transitions. Word has length 141 [2019-09-08 12:25:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:46,680 INFO L475 AbstractCegarLoop]: Abstraction has 2905 states and 4197 transitions. [2019-09-08 12:25:46,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:25:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 4197 transitions. [2019-09-08 12:25:46,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:25:46,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:46,681 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] [2019-09-08 12:25:46,681 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:46,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1726425210, now seen corresponding path program 1 times [2019-09-08 12:25:46,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:46,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:46,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:46,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:46,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:46,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:46,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:25:46,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:25:46,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:25:46,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:46,762 INFO L87 Difference]: Start difference. First operand 2905 states and 4197 transitions. Second operand 3 states. [2019-09-08 12:25:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:51,462 INFO L93 Difference]: Finished difference Result 7069 states and 10303 transitions. [2019-09-08 12:25:51,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:25:51,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-08 12:25:51,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:51,466 INFO L225 Difference]: With dead ends: 7069 [2019-09-08 12:25:51,466 INFO L226 Difference]: Without dead ends: 4315 [2019-09-08 12:25:51,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4315 states. [2019-09-08 12:25:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4315 to 4313. [2019-09-08 12:25:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4313 states. [2019-09-08 12:25:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 6237 transitions. [2019-09-08 12:25:56,205 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 6237 transitions. Word has length 141 [2019-09-08 12:25:56,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:56,205 INFO L475 AbstractCegarLoop]: Abstraction has 4313 states and 6237 transitions. [2019-09-08 12:25:56,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:25:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 6237 transitions. [2019-09-08 12:25:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:25:56,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:56,207 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] [2019-09-08 12:25:56,207 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:56,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:56,207 INFO L82 PathProgramCache]: Analyzing trace with hash 986684889, now seen corresponding path program 1 times [2019-09-08 12:25:56,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:56,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:56,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:56,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:56,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:56,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:56,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:25:56,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:25:56,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:25:56,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:56,269 INFO L87 Difference]: Start difference. First operand 4313 states and 6237 transitions. Second operand 3 states. [2019-09-08 12:26:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:03,530 INFO L93 Difference]: Finished difference Result 10565 states and 15307 transitions. [2019-09-08 12:26:03,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:26:03,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-08 12:26:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:03,537 INFO L225 Difference]: With dead ends: 10565 [2019-09-08 12:26:03,537 INFO L226 Difference]: Without dead ends: 6403 [2019-09-08 12:26:03,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:26:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6403 states. [2019-09-08 12:26:10,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6403 to 6401. [2019-09-08 12:26:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6401 states. [2019-09-08 12:26:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6401 states to 6401 states and 9185 transitions. [2019-09-08 12:26:10,806 INFO L78 Accepts]: Start accepts. Automaton has 6401 states and 9185 transitions. Word has length 141 [2019-09-08 12:26:10,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:10,807 INFO L475 AbstractCegarLoop]: Abstraction has 6401 states and 9185 transitions. [2019-09-08 12:26:10,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:26:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 6401 states and 9185 transitions. [2019-09-08 12:26:10,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:26:10,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:10,808 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] [2019-09-08 12:26:10,809 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:10,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:10,809 INFO L82 PathProgramCache]: Analyzing trace with hash 358346831, now seen corresponding path program 1 times [2019-09-08 12:26:10,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:10,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:10,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:10,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:10,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:10,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:10,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:26:10,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:26:10,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:26:10,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:26:10,919 INFO L87 Difference]: Start difference. First operand 6401 states and 9185 transitions. Second operand 7 states. [2019-09-08 12:26:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:42,263 INFO L93 Difference]: Finished difference Result 31977 states and 45845 transitions. [2019-09-08 12:26:42,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:26:42,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-08 12:26:42,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:42,290 INFO L225 Difference]: With dead ends: 31977 [2019-09-08 12:26:42,291 INFO L226 Difference]: Without dead ends: 25727 [2019-09-08 12:26:42,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:26:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25727 states. [2019-09-08 12:26:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25727 to 13369. [2019-09-08 12:26:58,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13369 states. [2019-09-08 12:26:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13369 states to 13369 states and 19213 transitions. [2019-09-08 12:26:58,110 INFO L78 Accepts]: Start accepts. Automaton has 13369 states and 19213 transitions. Word has length 141 [2019-09-08 12:26:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:58,111 INFO L475 AbstractCegarLoop]: Abstraction has 13369 states and 19213 transitions. [2019-09-08 12:26:58,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:26:58,111 INFO L276 IsEmpty]: Start isEmpty. Operand 13369 states and 19213 transitions. [2019-09-08 12:26:58,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:26:58,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:58,113 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] [2019-09-08 12:26:58,113 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:58,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:58,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1091090079, now seen corresponding path program 1 times [2019-09-08 12:26:58,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:58,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:58,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:58,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:58,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:58,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:58,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:58,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:26:58,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:26:58,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:26:58,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:26:58,221 INFO L87 Difference]: Start difference. First operand 13369 states and 19213 transitions. Second operand 7 states. [2019-09-08 12:27:52,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:52,549 INFO L93 Difference]: Finished difference Result 61521 states and 88601 transitions. [2019-09-08 12:27:52,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:27:52,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-08 12:27:52,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:52,603 INFO L225 Difference]: With dead ends: 61521 [2019-09-08 12:27:52,603 INFO L226 Difference]: Without dead ends: 48303 [2019-09-08 12:27:52,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:27:52,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48303 states. [2019-09-08 12:28:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48303 to 28025. [2019-09-08 12:28:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28025 states. [2019-09-08 12:28:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28025 states to 28025 states and 40277 transitions. [2019-09-08 12:28:25,741 INFO L78 Accepts]: Start accepts. Automaton has 28025 states and 40277 transitions. Word has length 141 [2019-09-08 12:28:25,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:25,741 INFO L475 AbstractCegarLoop]: Abstraction has 28025 states and 40277 transitions. [2019-09-08 12:28:25,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:28:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 28025 states and 40277 transitions. [2019-09-08 12:28:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:28:25,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:25,745 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] [2019-09-08 12:28:25,745 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:25,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:25,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1360730605, now seen corresponding path program 1 times [2019-09-08 12:28:25,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:25,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:25,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:25,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:25,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:25,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:25,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:28:25,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:28:25,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:28:25,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:28:25,846 INFO L87 Difference]: Start difference. First operand 28025 states and 40277 transitions. Second operand 7 states. [2019-09-08 12:29:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:36,471 INFO L93 Difference]: Finished difference Result 87809 states and 125241 transitions. [2019-09-08 12:29:36,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:29:36,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-08 12:29:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:36,535 INFO L225 Difference]: With dead ends: 87809 [2019-09-08 12:29:36,535 INFO L226 Difference]: Without dead ends: 59935 [2019-09-08 12:29:36,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:29:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59935 states. [2019-09-08 12:30:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59935 to 32665. [2019-09-08 12:30:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32665 states. [2019-09-08 12:30:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32665 states to 32665 states and 46229 transitions. [2019-09-08 12:30:16,434 INFO L78 Accepts]: Start accepts. Automaton has 32665 states and 46229 transitions. Word has length 141 [2019-09-08 12:30:16,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:16,435 INFO L475 AbstractCegarLoop]: Abstraction has 32665 states and 46229 transitions. [2019-09-08 12:30:16,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:30:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 32665 states and 46229 transitions. [2019-09-08 12:30:16,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:30:16,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:16,438 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] [2019-09-08 12:30:16,438 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:16,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:16,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1920406526, now seen corresponding path program 1 times [2019-09-08 12:30:16,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:16,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:16,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:16,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:16,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:16,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:16,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:30:16,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:30:16,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:30:16,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:30:16,545 INFO L87 Difference]: Start difference. First operand 32665 states and 46229 transitions. Second operand 6 states.