/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:12:08,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:12:08,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:12:08,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:12:08,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:12:08,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:12:08,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:12:08,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:12:08,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:12:08,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:12:08,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:12:08,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:12:08,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:12:08,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:12:08,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:12:08,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:12:08,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:12:08,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:12:08,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:12:08,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:12:08,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:12:08,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:12:08,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:12:08,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:12:08,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:12:08,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:12:08,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:12:08,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:12:08,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:12:08,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:12:08,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:12:08,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:12:08,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:12:08,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:12:08,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:12:08,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:12:08,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:12:08,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:12:08,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:12:08,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:12:08,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:12:08,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 22:12:08,946 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:12:08,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:12:08,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:12:08,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:12:08,951 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:12:08,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:12:08,952 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:12:08,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:12:08,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:12:08,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:12:08,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:12:08,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:12:08,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:12:08,953 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:12:08,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:12:08,953 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:12:08,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:12:08,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:12:08,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:12:08,955 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:12:08,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:12:08,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:12:08,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:12:08,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:12:08,957 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:12:08,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:12:08,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:12:08,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:12:08,957 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:12:09,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:12:09,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:12:09,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:12:09,282 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:12:09,283 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:12:09,284 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-06 22:12:09,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/694f333fe/317660a75f8c4e13a2042756738d364d/FLAGa7c9c10a5 [2019-11-06 22:12:09,928 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:12:09,929 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-06 22:12:09,949 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/694f333fe/317660a75f8c4e13a2042756738d364d/FLAGa7c9c10a5 [2019-11-06 22:12:10,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/694f333fe/317660a75f8c4e13a2042756738d364d [2019-11-06 22:12:10,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:12:10,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:12:10,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:12:10,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:12:10,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:12:10,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:10" (1/1) ... [2019-11-06 22:12:10,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1882f447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:10, skipping insertion in model container [2019-11-06 22:12:10,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:10" (1/1) ... [2019-11-06 22:12:10,279 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:12:10,339 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:12:10,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:12:10,940 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:12:11,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:12:11,458 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:12:11,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:11 WrapperNode [2019-11-06 22:12:11,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:12:11,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:12:11,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:12:11,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:12:11,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:11" (1/1) ... [2019-11-06 22:12:11,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:11" (1/1) ... [2019-11-06 22:12:11,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:11" (1/1) ... [2019-11-06 22:12:11,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:11" (1/1) ... [2019-11-06 22:12:11,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:11" (1/1) ... [2019-11-06 22:12:11,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:11" (1/1) ... [2019-11-06 22:12:11,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:11" (1/1) ... [2019-11-06 22:12:11,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:12:11,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:12:11,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:12:11,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:12:11,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:12:11,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:12:11,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:12:11,653 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:12:11,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:12:11,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:12:11,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-06 22:12:11,654 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-06 22:12:11,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:12:11,655 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-06 22:12:11,655 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-06 22:12:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-06 22:12:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-06 22:12:11,657 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-06 22:12:11,657 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-06 22:12:11,658 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 22:12:11,658 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:12:11,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:12:11,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:12:13,475 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:12:13,475 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 22:12:13,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:13 BoogieIcfgContainer [2019-11-06 22:12:13,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:12:13,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:12:13,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:12:13,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:12:13,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:12:10" (1/3) ... [2019-11-06 22:12:13,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc9fab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:13, skipping insertion in model container [2019-11-06 22:12:13,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:11" (2/3) ... [2019-11-06 22:12:13,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc9fab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:13, skipping insertion in model container [2019-11-06 22:12:13,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:13" (3/3) ... [2019-11-06 22:12:13,494 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-06 22:12:13,506 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:12:13,530 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-06 22:12:13,542 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-06 22:12:13,586 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:12:13,587 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:12:13,587 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:12:13,587 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:12:13,587 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:12:13,587 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:12:13,588 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:12:13,588 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:12:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states. [2019-11-06 22:12:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-06 22:12:13,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:13,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:12:13,672 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:13,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash 566032510, now seen corresponding path program 1 times [2019-11-06 22:12:13,690 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:13,691 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024389868] [2019-11-06 22:12:13,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:14,628 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:12:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:14,734 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024389868] [2019-11-06 22:12:14,734 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:14,735 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:12:14,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468042647] [2019-11-06 22:12:14,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:12:14,742 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:14,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:12:14,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:14,759 INFO L87 Difference]: Start difference. First operand 376 states. Second operand 4 states. [2019-11-06 22:12:15,101 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2019-11-06 22:12:17,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:17,564 INFO L93 Difference]: Finished difference Result 683 states and 1210 transitions. [2019-11-06 22:12:17,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:12:17,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-11-06 22:12:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:17,601 INFO L225 Difference]: With dead ends: 683 [2019-11-06 22:12:17,601 INFO L226 Difference]: Without dead ends: 536 [2019-11-06 22:12:17,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:17,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-06 22:12:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 534. [2019-11-06 22:12:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-11-06 22:12:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 783 transitions. [2019-11-06 22:12:17,719 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 783 transitions. Word has length 137 [2019-11-06 22:12:17,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:17,720 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 783 transitions. [2019-11-06 22:12:17,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:12:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 783 transitions. [2019-11-06 22:12:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-06 22:12:17,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:17,723 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:12:17,724 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:17,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:17,724 INFO L82 PathProgramCache]: Analyzing trace with hash 227617534, now seen corresponding path program 1 times [2019-11-06 22:12:17,725 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:17,725 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735825001] [2019-11-06 22:12:17,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:18,190 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:12:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:18,234 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735825001] [2019-11-06 22:12:18,234 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:18,234 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:12:18,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720676172] [2019-11-06 22:12:18,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:12:18,236 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:18,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:12:18,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:18,237 INFO L87 Difference]: Start difference. First operand 534 states and 783 transitions. Second operand 4 states. [2019-11-06 22:12:18,492 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2019-11-06 22:12:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:20,419 INFO L93 Difference]: Finished difference Result 1069 states and 1620 transitions. [2019-11-06 22:12:20,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:12:20,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-11-06 22:12:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:20,425 INFO L225 Difference]: With dead ends: 1069 [2019-11-06 22:12:20,426 INFO L226 Difference]: Without dead ends: 878 [2019-11-06 22:12:20,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-11-06 22:12:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 876. [2019-11-06 22:12:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-11-06 22:12:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1307 transitions. [2019-11-06 22:12:20,486 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1307 transitions. Word has length 137 [2019-11-06 22:12:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:20,487 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1307 transitions. [2019-11-06 22:12:20,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:12:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1307 transitions. [2019-11-06 22:12:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-06 22:12:20,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:20,493 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:12:20,494 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:20,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:20,494 INFO L82 PathProgramCache]: Analyzing trace with hash 227278910, now seen corresponding path program 1 times [2019-11-06 22:12:20,494 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:20,495 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776523572] [2019-11-06 22:12:20,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:21,234 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:12:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:21,314 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776523572] [2019-11-06 22:12:21,314 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:21,315 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:21,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583182708] [2019-11-06 22:12:21,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:21,323 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:21,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:21,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:21,332 INFO L87 Difference]: Start difference. First operand 876 states and 1307 transitions. Second operand 5 states. [2019-11-06 22:12:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:24,338 INFO L93 Difference]: Finished difference Result 2559 states and 3814 transitions. [2019-11-06 22:12:24,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:12:24,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-11-06 22:12:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:24,349 INFO L225 Difference]: With dead ends: 2559 [2019-11-06 22:12:24,349 INFO L226 Difference]: Without dead ends: 1696 [2019-11-06 22:12:24,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:12:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2019-11-06 22:12:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1660. [2019-11-06 22:12:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-11-06 22:12:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2465 transitions. [2019-11-06 22:12:24,427 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2465 transitions. Word has length 137 [2019-11-06 22:12:24,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:24,428 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 2465 transitions. [2019-11-06 22:12:24,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:12:24,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2465 transitions. [2019-11-06 22:12:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-06 22:12:24,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:24,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:12:24,432 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:24,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:24,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1550747192, now seen corresponding path program 1 times [2019-11-06 22:12:24,432 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:24,433 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635881903] [2019-11-06 22:12:24,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:24,803 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:12:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:24,836 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635881903] [2019-11-06 22:12:24,837 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:24,837 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:12:24,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885789116] [2019-11-06 22:12:24,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:12:24,838 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:24,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:12:24,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:24,839 INFO L87 Difference]: Start difference. First operand 1660 states and 2465 transitions. Second operand 4 states. [2019-11-06 22:12:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:26,674 INFO L93 Difference]: Finished difference Result 4934 states and 7325 transitions. [2019-11-06 22:12:26,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:12:26,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-11-06 22:12:26,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:26,695 INFO L225 Difference]: With dead ends: 4934 [2019-11-06 22:12:26,695 INFO L226 Difference]: Without dead ends: 3306 [2019-11-06 22:12:26,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2019-11-06 22:12:26,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 1662. [2019-11-06 22:12:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1662 states. [2019-11-06 22:12:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2467 transitions. [2019-11-06 22:12:26,821 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2467 transitions. Word has length 138 [2019-11-06 22:12:26,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:26,821 INFO L462 AbstractCegarLoop]: Abstraction has 1662 states and 2467 transitions. [2019-11-06 22:12:26,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:12:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2467 transitions. [2019-11-06 22:12:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-06 22:12:26,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:26,826 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:12:26,826 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:26,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:26,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2121179683, now seen corresponding path program 1 times [2019-11-06 22:12:26,827 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:26,827 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162976790] [2019-11-06 22:12:26,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:27,269 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:12:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:27,344 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162976790] [2019-11-06 22:12:27,345 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:27,345 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:27,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690201707] [2019-11-06 22:12:27,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:27,346 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:27,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:27,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:27,348 INFO L87 Difference]: Start difference. First operand 1662 states and 2467 transitions. Second operand 5 states. [2019-11-06 22:12:30,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:30,188 INFO L93 Difference]: Finished difference Result 4830 states and 7153 transitions. [2019-11-06 22:12:30,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:12:30,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-11-06 22:12:30,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:30,205 INFO L225 Difference]: With dead ends: 4830 [2019-11-06 22:12:30,205 INFO L226 Difference]: Without dead ends: 3202 [2019-11-06 22:12:30,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:12:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2019-11-06 22:12:30,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 3166. [2019-11-06 22:12:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3166 states. [2019-11-06 22:12:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3166 states to 3166 states and 4659 transitions. [2019-11-06 22:12:30,348 INFO L78 Accepts]: Start accepts. Automaton has 3166 states and 4659 transitions. Word has length 139 [2019-11-06 22:12:30,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:30,348 INFO L462 AbstractCegarLoop]: Abstraction has 3166 states and 4659 transitions. [2019-11-06 22:12:30,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:12:30,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3166 states and 4659 transitions. [2019-11-06 22:12:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-06 22:12:30,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:30,354 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:12:30,355 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:30,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:30,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1901470855, now seen corresponding path program 1 times [2019-11-06 22:12:30,355 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:30,356 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413659965] [2019-11-06 22:12:30,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:30,679 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:12:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:30,712 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413659965] [2019-11-06 22:12:30,713 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:30,714 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:12:30,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195025701] [2019-11-06 22:12:30,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:12:30,715 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:30,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:12:30,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:30,715 INFO L87 Difference]: Start difference. First operand 3166 states and 4659 transitions. Second operand 4 states. [2019-11-06 22:12:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:33,582 INFO L93 Difference]: Finished difference Result 9414 states and 13849 transitions. [2019-11-06 22:12:33,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:12:33,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-06 22:12:33,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:33,612 INFO L225 Difference]: With dead ends: 9414 [2019-11-06 22:12:33,612 INFO L226 Difference]: Without dead ends: 6296 [2019-11-06 22:12:33,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:33,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6296 states. [2019-11-06 22:12:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6296 to 3170. [2019-11-06 22:12:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3170 states. [2019-11-06 22:12:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 4663 transitions. [2019-11-06 22:12:33,801 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 4663 transitions. Word has length 140 [2019-11-06 22:12:33,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:33,802 INFO L462 AbstractCegarLoop]: Abstraction has 3170 states and 4663 transitions. [2019-11-06 22:12:33,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:12:33,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 4663 transitions. [2019-11-06 22:12:33,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-06 22:12:33,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:33,808 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:12:33,808 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:33,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:33,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1097233700, now seen corresponding path program 1 times [2019-11-06 22:12:33,809 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:33,809 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559860458] [2019-11-06 22:12:33,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:34,121 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:12:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:34,160 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559860458] [2019-11-06 22:12:34,160 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:34,160 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:12:34,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676662142] [2019-11-06 22:12:34,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:12:34,161 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:34,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:12:34,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:34,162 INFO L87 Difference]: Start difference. First operand 3170 states and 4663 transitions. Second operand 4 states. [2019-11-06 22:12:36,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:36,526 INFO L93 Difference]: Finished difference Result 8343 states and 12276 transitions. [2019-11-06 22:12:36,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:12:36,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-06 22:12:36,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:36,547 INFO L225 Difference]: With dead ends: 8343 [2019-11-06 22:12:36,547 INFO L226 Difference]: Without dead ends: 5461 [2019-11-06 22:12:36,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:36,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5461 states. [2019-11-06 22:12:36,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5461 to 5425. [2019-11-06 22:12:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5425 states. [2019-11-06 22:12:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5425 states to 5425 states and 7876 transitions. [2019-11-06 22:12:36,794 INFO L78 Accepts]: Start accepts. Automaton has 5425 states and 7876 transitions. Word has length 141 [2019-11-06 22:12:36,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:36,794 INFO L462 AbstractCegarLoop]: Abstraction has 5425 states and 7876 transitions. [2019-11-06 22:12:36,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:12:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5425 states and 7876 transitions. [2019-11-06 22:12:36,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-06 22:12:36,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:36,803 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:12:36,803 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:36,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:36,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1702008345, now seen corresponding path program 1 times [2019-11-06 22:12:36,804 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:36,804 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917516705] [2019-11-06 22:12:36,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:37,272 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:12:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:37,307 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917516705] [2019-11-06 22:12:37,307 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:37,308 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:37,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253008691] [2019-11-06 22:12:37,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:37,310 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:37,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:37,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:37,311 INFO L87 Difference]: Start difference. First operand 5425 states and 7876 transitions. Second operand 5 states. [2019-11-06 22:12:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:39,183 INFO L93 Difference]: Finished difference Result 11218 states and 16169 transitions. [2019-11-06 22:12:39,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:12:39,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-11-06 22:12:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:39,208 INFO L225 Difference]: With dead ends: 11218 [2019-11-06 22:12:39,208 INFO L226 Difference]: Without dead ends: 5673 [2019-11-06 22:12:39,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2019-11-06 22:12:39,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 5637. [2019-11-06 22:12:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5637 states. [2019-11-06 22:12:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 8064 transitions. [2019-11-06 22:12:39,524 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 8064 transitions. Word has length 141 [2019-11-06 22:12:39,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:39,524 INFO L462 AbstractCegarLoop]: Abstraction has 5637 states and 8064 transitions. [2019-11-06 22:12:39,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:12:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 8064 transitions. [2019-11-06 22:12:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-06 22:12:39,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:39,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:12:39,533 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:39,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash 680281852, now seen corresponding path program 1 times [2019-11-06 22:12:39,534 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:39,534 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585231520] [2019-11-06 22:12:39,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:39,920 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:12:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:39,962 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585231520] [2019-11-06 22:12:39,963 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:39,963 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:12:39,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957991655] [2019-11-06 22:12:39,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:12:39,964 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:39,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:12:39,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:12:39,964 INFO L87 Difference]: Start difference. First operand 5637 states and 8064 transitions. Second operand 5 states. [2019-11-06 22:12:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:42,695 INFO L93 Difference]: Finished difference Result 7924 states and 11307 transitions. [2019-11-06 22:12:42,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:12:42,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-11-06 22:12:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:42,707 INFO L225 Difference]: With dead ends: 7924 [2019-11-06 22:12:42,707 INFO L226 Difference]: Without dead ends: 5673 [2019-11-06 22:12:42,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:12:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2019-11-06 22:12:42,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 5425. [2019-11-06 22:12:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5425 states. [2019-11-06 22:12:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5425 states to 5425 states and 7802 transitions. [2019-11-06 22:12:42,920 INFO L78 Accepts]: Start accepts. Automaton has 5425 states and 7802 transitions. Word has length 141 [2019-11-06 22:12:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:42,920 INFO L462 AbstractCegarLoop]: Abstraction has 5425 states and 7802 transitions. [2019-11-06 22:12:42,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:12:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 5425 states and 7802 transitions. [2019-11-06 22:12:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-06 22:12:42,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:42,929 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:12:42,930 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:42,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:42,930 INFO L82 PathProgramCache]: Analyzing trace with hash -341992133, now seen corresponding path program 1 times [2019-11-06 22:12:42,930 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:42,931 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680289249] [2019-11-06 22:12:42,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:43,190 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-11-06 22:12:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:43,220 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680289249] [2019-11-06 22:12:43,220 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:43,220 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:12:43,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57088784] [2019-11-06 22:12:43,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:12:43,222 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:43,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:12:43,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:43,223 INFO L87 Difference]: Start difference. First operand 5425 states and 7802 transitions. Second operand 4 states. [2019-11-06 22:12:45,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:12:45,538 INFO L93 Difference]: Finished difference Result 12993 states and 18652 transitions. [2019-11-06 22:12:45,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:12:45,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-06 22:12:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:12:45,561 INFO L225 Difference]: With dead ends: 12993 [2019-11-06 22:12:45,561 INFO L226 Difference]: Without dead ends: 10742 [2019-11-06 22:12:45,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:45,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10742 states. [2019-11-06 22:12:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10742 to 5433. [2019-11-06 22:12:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5433 states. [2019-11-06 22:12:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5433 states to 5433 states and 7810 transitions. [2019-11-06 22:12:45,969 INFO L78 Accepts]: Start accepts. Automaton has 5433 states and 7810 transitions. Word has length 142 [2019-11-06 22:12:45,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:12:45,969 INFO L462 AbstractCegarLoop]: Abstraction has 5433 states and 7810 transitions. [2019-11-06 22:12:45,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:12:45,969 INFO L276 IsEmpty]: Start isEmpty. Operand 5433 states and 7810 transitions. [2019-11-06 22:12:45,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-06 22:12:45,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:45,976 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:12:45,977 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:45,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:45,977 INFO L82 PathProgramCache]: Analyzing trace with hash -560885818, now seen corresponding path program 1 times [2019-11-06 22:12:45,977 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:45,977 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009912100] [2019-11-06 22:12:45,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat