/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-b7b32d2 [2021-02-21 20:33:01,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-21 20:33:01,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-21 20:33:01,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-21 20:33:01,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-21 20:33:01,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-21 20:33:01,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-21 20:33:01,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-21 20:33:01,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-21 20:33:01,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-21 20:33:01,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-21 20:33:01,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-21 20:33:01,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-21 20:33:01,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-21 20:33:01,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-21 20:33:01,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-21 20:33:01,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-21 20:33:01,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-21 20:33:01,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-21 20:33:01,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-21 20:33:01,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-21 20:33:01,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-21 20:33:01,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-21 20:33:01,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-21 20:33:01,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-21 20:33:01,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-21 20:33:01,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-21 20:33:01,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-21 20:33:01,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-21 20:33:01,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-21 20:33:01,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-21 20:33:01,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-21 20:33:01,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-21 20:33:01,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-21 20:33:01,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-21 20:33:01,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-21 20:33:01,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-21 20:33:01,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-21 20:33:01,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-21 20:33:01,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-21 20:33:01,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-21 20:33:01,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-21 20:33:01,889 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-21 20:33:01,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-21 20:33:01,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-21 20:33:01,894 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-21 20:33:01,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-21 20:33:01,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-21 20:33:01,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-21 20:33:01,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-21 20:33:01,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-21 20:33:01,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-21 20:33:01,898 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-21 20:33:01,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-21 20:33:01,898 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-21 20:33:01,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-21 20:33:01,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-21 20:33:01,900 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-21 20:33:01,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-21 20:33:01,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-21 20:33:01,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-21 20:33:01,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-21 20:33:01,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-21 20:33:01,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-21 20:33:01,901 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-02-21 20:33:02,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-21 20:33:02,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-21 20:33:02,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-21 20:33:02,380 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-21 20:33:02,386 INFO L275 PluginConnector]: CDTParser initialized [2021-02-21 20:33:02,387 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2021-02-21 20:33:02,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d4f03c4/acbbedafee9844f3a6fe2d82d86c1dad/FLAGad0177a2d [2021-02-21 20:33:03,115 INFO L306 CDTParser]: Found 1 translation units. [2021-02-21 20:33:03,115 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2021-02-21 20:33:03,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d4f03c4/acbbedafee9844f3a6fe2d82d86c1dad/FLAGad0177a2d [2021-02-21 20:33:03,486 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d4f03c4/acbbedafee9844f3a6fe2d82d86c1dad [2021-02-21 20:33:03,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-21 20:33:03,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-21 20:33:03,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-21 20:33:03,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-21 20:33:03,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-21 20:33:03,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 08:33:03" (1/1) ... [2021-02-21 20:33:03,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db350c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:03, skipping insertion in model container [2021-02-21 20:33:03,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 08:33:03" (1/1) ... [2021-02-21 20:33:03,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-21 20:33:03,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-21 20:33:03,722 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c[2881,2894] [2021-02-21 20:33:03,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 20:33:03,739 INFO L203 MainTranslator]: Completed pre-run [2021-02-21 20:33:03,801 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c[2881,2894] [2021-02-21 20:33:03,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 20:33:03,829 INFO L208 MainTranslator]: Completed translation [2021-02-21 20:33:03,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:03 WrapperNode [2021-02-21 20:33:03,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-21 20:33:03,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-21 20:33:03,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-21 20:33:03,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-21 20:33:03,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:03" (1/1) ... [2021-02-21 20:33:03,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:03" (1/1) ... [2021-02-21 20:33:03,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:03" (1/1) ... [2021-02-21 20:33:03,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:03" (1/1) ... [2021-02-21 20:33:03,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:03" (1/1) ... [2021-02-21 20:33:03,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:03" (1/1) ... [2021-02-21 20:33:03,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:03" (1/1) ... [2021-02-21 20:33:03,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-21 20:33:03,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-21 20:33:03,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-21 20:33:03,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-21 20:33:03,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:03" (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 [2021-02-21 20:33:04,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-21 20:33:04,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-21 20:33:04,068 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-21 20:33:04,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-21 20:33:04,069 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-21 20:33:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-21 20:33:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-21 20:33:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-21 20:33:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-21 20:33:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-21 20:33:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-21 20:33:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-21 20:33:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-21 20:33:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-21 20:33:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-21 20:33:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-21 20:33:04,755 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-21 20:33:04,755 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-02-21 20:33:04,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 08:33:04 BoogieIcfgContainer [2021-02-21 20:33:04,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-21 20:33:04,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-21 20:33:04,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-21 20:33:04,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-21 20:33:04,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 08:33:03" (1/3) ... [2021-02-21 20:33:04,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c10571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 08:33:04, skipping insertion in model container [2021-02-21 20:33:04,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:03" (2/3) ... [2021-02-21 20:33:04,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c10571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 08:33:04, skipping insertion in model container [2021-02-21 20:33:04,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 08:33:04" (3/3) ... [2021-02-21 20:33:04,767 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2021-02-21 20:33:04,774 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-21 20:33:04,779 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-21 20:33:04,801 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-21 20:33:04,830 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-21 20:33:04,830 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-21 20:33:04,830 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-21 20:33:04,830 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-21 20:33:04,830 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-21 20:33:04,831 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-21 20:33:04,831 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-21 20:33:04,831 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-21 20:33:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2021-02-21 20:33:04,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-02-21 20:33:04,863 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:04,864 INFO L422 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] [2021-02-21 20:33:04,864 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:04,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:04,872 INFO L82 PathProgramCache]: Analyzing trace with hash -734651465, now seen corresponding path program 1 times [2021-02-21 20:33:04,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:04,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [664028865] [2021-02-21 20:33:04,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:04,971 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:05,257 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:05,259 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:05,261 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:05,263 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:05,282 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:05,283 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:05,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:05,422 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:05,424 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:33:05,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [664028865] [2021-02-21 20:33:05,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:05,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:05,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694602908] [2021-02-21 20:33:05,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:05,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:05,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:05,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:05,482 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 4 states. [2021-02-21 20:33:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:06,028 INFO L93 Difference]: Finished difference Result 200 states and 269 transitions. [2021-02-21 20:33:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:06,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2021-02-21 20:33:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:06,055 INFO L225 Difference]: With dead ends: 200 [2021-02-21 20:33:06,055 INFO L226 Difference]: Without dead ends: 136 [2021-02-21 20:33:06,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-02-21 20:33:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2021-02-21 20:33:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2021-02-21 20:33:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2021-02-21 20:33:06,155 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 63 [2021-02-21 20:33:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:06,156 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2021-02-21 20:33:06,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2021-02-21 20:33:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-02-21 20:33:06,159 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:06,159 INFO L422 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] [2021-02-21 20:33:06,160 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-21 20:33:06,160 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:06,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:06,161 INFO L82 PathProgramCache]: Analyzing trace with hash -106893304, now seen corresponding path program 1 times [2021-02-21 20:33:06,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:06,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1813508421] [2021-02-21 20:33:06,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:06,165 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:06,220 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:06,221 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:06,222 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:06,223 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:06,227 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:06,228 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:06,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:06,294 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:06,295 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:06,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:33:06,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1813508421] [2021-02-21 20:33:06,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:06,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:06,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492221652] [2021-02-21 20:33:06,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:06,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:06,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:06,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:06,311 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand 4 states. [2021-02-21 20:33:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:06,806 INFO L93 Difference]: Finished difference Result 162 states and 210 transitions. [2021-02-21 20:33:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:06,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-02-21 20:33:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:06,812 INFO L225 Difference]: With dead ends: 162 [2021-02-21 20:33:06,813 INFO L226 Difference]: Without dead ends: 160 [2021-02-21 20:33:06,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-02-21 20:33:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 134. [2021-02-21 20:33:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2021-02-21 20:33:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 171 transitions. [2021-02-21 20:33:06,902 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 171 transitions. Word has length 64 [2021-02-21 20:33:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:06,908 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 171 transitions. [2021-02-21 20:33:06,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:06,908 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 171 transitions. [2021-02-21 20:33:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-02-21 20:33:06,916 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:06,916 INFO L422 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] [2021-02-21 20:33:06,917 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-21 20:33:06,917 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:06,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:06,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1299113955, now seen corresponding path program 1 times [2021-02-21 20:33:06,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:06,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1150609024] [2021-02-21 20:33:06,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:06,925 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:07,037 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:07,040 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:07,042 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:07,043 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:07,047 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:07,048 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:07,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:07,099 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:07,100 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:33:07,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1150609024] [2021-02-21 20:33:07,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:07,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:07,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235293642] [2021-02-21 20:33:07,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:07,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:07,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:07,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:07,114 INFO L87 Difference]: Start difference. First operand 134 states and 171 transitions. Second operand 4 states. [2021-02-21 20:33:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:07,465 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2021-02-21 20:33:07,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:07,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-02-21 20:33:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:07,469 INFO L225 Difference]: With dead ends: 314 [2021-02-21 20:33:07,469 INFO L226 Difference]: Without dead ends: 221 [2021-02-21 20:33:07,470 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-02-21 20:33:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2021-02-21 20:33:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2021-02-21 20:33:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 288 transitions. [2021-02-21 20:33:07,519 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 288 transitions. Word has length 64 [2021-02-21 20:33:07,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:07,520 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 288 transitions. [2021-02-21 20:33:07,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 288 transitions. [2021-02-21 20:33:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-02-21 20:33:07,522 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:07,523 INFO L422 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] [2021-02-21 20:33:07,523 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-21 20:33:07,523 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:07,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:07,524 INFO L82 PathProgramCache]: Analyzing trace with hash -429978543, now seen corresponding path program 1 times [2021-02-21 20:33:07,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:07,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2083708087] [2021-02-21 20:33:07,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:07,527 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:07,576 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:07,577 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:07,578 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:07,578 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:07,582 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:07,583 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:07,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:07,616 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:07,617 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:07,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:33:07,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2083708087] [2021-02-21 20:33:07,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:07,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:07,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7024584] [2021-02-21 20:33:07,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:07,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:07,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:07,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:07,625 INFO L87 Difference]: Start difference. First operand 219 states and 288 transitions. Second operand 4 states. [2021-02-21 20:33:07,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:07,915 INFO L93 Difference]: Finished difference Result 267 states and 354 transitions. [2021-02-21 20:33:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:07,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-02-21 20:33:07,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:07,918 INFO L225 Difference]: With dead ends: 267 [2021-02-21 20:33:07,918 INFO L226 Difference]: Without dead ends: 265 [2021-02-21 20:33:07,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:07,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-02-21 20:33:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 219. [2021-02-21 20:33:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2021-02-21 20:33:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 286 transitions. [2021-02-21 20:33:07,962 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 286 transitions. Word has length 65 [2021-02-21 20:33:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:07,963 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 286 transitions. [2021-02-21 20:33:07,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 286 transitions. [2021-02-21 20:33:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-02-21 20:33:07,964 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:07,965 INFO L422 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] [2021-02-21 20:33:07,965 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-21 20:33:07,965 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:07,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:07,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1617581589, now seen corresponding path program 1 times [2021-02-21 20:33:07,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:07,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1087952124] [2021-02-21 20:33:07,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:07,968 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:08,000 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:08,001 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:08,001 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:08,002 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:08,005 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:08,006 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:08,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:08,037 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:08,038 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:33:08,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1087952124] [2021-02-21 20:33:08,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:08,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:08,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458979430] [2021-02-21 20:33:08,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:08,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:08,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:08,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:08,045 INFO L87 Difference]: Start difference. First operand 219 states and 286 transitions. Second operand 4 states. [2021-02-21 20:33:08,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:08,339 INFO L93 Difference]: Finished difference Result 563 states and 760 transitions. [2021-02-21 20:33:08,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:08,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-02-21 20:33:08,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:08,342 INFO L225 Difference]: With dead ends: 563 [2021-02-21 20:33:08,343 INFO L226 Difference]: Without dead ends: 385 [2021-02-21 20:33:08,345 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-02-21 20:33:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2021-02-21 20:33:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-02-21 20:33:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 506 transitions. [2021-02-21 20:33:08,435 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 506 transitions. Word has length 65 [2021-02-21 20:33:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:08,436 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 506 transitions. [2021-02-21 20:33:08,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 506 transitions. [2021-02-21 20:33:08,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-21 20:33:08,438 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:08,438 INFO L422 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] [2021-02-21 20:33:08,438 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-21 20:33:08,438 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:08,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:08,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1855685988, now seen corresponding path program 1 times [2021-02-21 20:33:08,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:08,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [522763449] [2021-02-21 20:33:08,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:08,442 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:08,472 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:08,472 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:08,473 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:08,474 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:08,477 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:08,477 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:08,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:08,508 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:08,509 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:33:08,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [522763449] [2021-02-21 20:33:08,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:08,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:08,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241895217] [2021-02-21 20:33:08,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:08,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:08,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:08,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:08,516 INFO L87 Difference]: Start difference. First operand 383 states and 506 transitions. Second operand 4 states. [2021-02-21 20:33:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:08,796 INFO L93 Difference]: Finished difference Result 467 states and 620 transitions. [2021-02-21 20:33:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:08,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-02-21 20:33:08,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:08,800 INFO L225 Difference]: With dead ends: 467 [2021-02-21 20:33:08,800 INFO L226 Difference]: Without dead ends: 465 [2021-02-21 20:33:08,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-02-21 20:33:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 383. [2021-02-21 20:33:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-02-21 20:33:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 502 transitions. [2021-02-21 20:33:08,881 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 502 transitions. Word has length 66 [2021-02-21 20:33:08,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:08,882 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 502 transitions. [2021-02-21 20:33:08,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 502 transitions. [2021-02-21 20:33:08,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-21 20:33:08,884 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:08,884 INFO L422 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] [2021-02-21 20:33:08,884 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-21 20:33:08,884 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:08,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:08,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1394824017, now seen corresponding path program 1 times [2021-02-21 20:33:08,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:08,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [878862013] [2021-02-21 20:33:08,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:08,888 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:08,919 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:08,920 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:08,922 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:08,923 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:08,926 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:08,927 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:08,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:08,978 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:08,978 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:08,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:33:08,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [878862013] [2021-02-21 20:33:08,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:08,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:08,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077258459] [2021-02-21 20:33:08,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:08,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:08,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:08,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:08,989 INFO L87 Difference]: Start difference. First operand 383 states and 502 transitions. Second operand 4 states. [2021-02-21 20:33:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:09,347 INFO L93 Difference]: Finished difference Result 1043 states and 1392 transitions. [2021-02-21 20:33:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:09,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-02-21 20:33:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:09,351 INFO L225 Difference]: With dead ends: 1043 [2021-02-21 20:33:09,352 INFO L226 Difference]: Without dead ends: 701 [2021-02-21 20:33:09,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-02-21 20:33:09,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 699. [2021-02-21 20:33:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2021-02-21 20:33:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 914 transitions. [2021-02-21 20:33:09,478 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 914 transitions. Word has length 66 [2021-02-21 20:33:09,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:09,479 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 914 transitions. [2021-02-21 20:33:09,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 914 transitions. [2021-02-21 20:33:09,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-02-21 20:33:09,481 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:09,481 INFO L422 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] [2021-02-21 20:33:09,481 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-21 20:33:09,481 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:09,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:09,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1192023845, now seen corresponding path program 1 times [2021-02-21 20:33:09,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:09,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1751112395] [2021-02-21 20:33:09,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:09,485 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:09,506 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:09,507 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:09,507 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:09,508 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:09,511 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:09,512 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:09,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:09,551 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:09,555 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:33:09,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1751112395] [2021-02-21 20:33:09,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:09,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:09,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133883108] [2021-02-21 20:33:09,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:09,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:09,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:09,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:09,565 INFO L87 Difference]: Start difference. First operand 699 states and 914 transitions. Second operand 4 states. [2021-02-21 20:33:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:09,897 INFO L93 Difference]: Finished difference Result 847 states and 1108 transitions. [2021-02-21 20:33:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:09,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-02-21 20:33:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:09,902 INFO L225 Difference]: With dead ends: 847 [2021-02-21 20:33:09,902 INFO L226 Difference]: Without dead ends: 845 [2021-02-21 20:33:09,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2021-02-21 20:33:10,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 699. [2021-02-21 20:33:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2021-02-21 20:33:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 906 transitions. [2021-02-21 20:33:10,015 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 906 transitions. Word has length 67 [2021-02-21 20:33:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:10,016 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 906 transitions. [2021-02-21 20:33:10,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 906 transitions. [2021-02-21 20:33:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-02-21 20:33:10,017 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:10,018 INFO L422 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] [2021-02-21 20:33:10,018 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-21 20:33:10,018 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:10,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash 290117663, now seen corresponding path program 1 times [2021-02-21 20:33:10,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:10,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1794623188] [2021-02-21 20:33:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:10,021 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:10,041 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:10,042 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:10,043 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:10,043 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:10,046 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:10,047 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:10,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:10,078 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:10,084 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:33:10,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1794623188] [2021-02-21 20:33:10,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:10,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:10,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191991011] [2021-02-21 20:33:10,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:10,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:10,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:10,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:10,098 INFO L87 Difference]: Start difference. First operand 699 states and 906 transitions. Second operand 4 states. [2021-02-21 20:33:10,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:10,553 INFO L93 Difference]: Finished difference Result 1967 states and 2572 transitions. [2021-02-21 20:33:10,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:10,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-02-21 20:33:10,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:10,561 INFO L225 Difference]: With dead ends: 1967 [2021-02-21 20:33:10,561 INFO L226 Difference]: Without dead ends: 1309 [2021-02-21 20:33:10,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2021-02-21 20:33:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1307. [2021-02-21 20:33:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2021-02-21 20:33:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1674 transitions. [2021-02-21 20:33:10,770 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1674 transitions. Word has length 67 [2021-02-21 20:33:10,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:10,771 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 1674 transitions. [2021-02-21 20:33:10,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:10,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1674 transitions. [2021-02-21 20:33:10,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-02-21 20:33:10,772 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:10,773 INFO L422 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] [2021-02-21 20:33:10,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-21 20:33:10,773 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:10,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:10,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1181748528, now seen corresponding path program 1 times [2021-02-21 20:33:10,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:10,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1310769449] [2021-02-21 20:33:10,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:10,777 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:10,806 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:10,806 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:10,807 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:10,807 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:10,810 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:10,811 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:10,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:10,837 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:10,837 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:33:10,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1310769449] [2021-02-21 20:33:10,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:10,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:10,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076876010] [2021-02-21 20:33:10,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:10,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:10,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:10,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:10,845 INFO L87 Difference]: Start difference. First operand 1307 states and 1674 transitions. Second operand 4 states. [2021-02-21 20:33:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:11,323 INFO L93 Difference]: Finished difference Result 1567 states and 1996 transitions. [2021-02-21 20:33:11,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:11,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-02-21 20:33:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:11,331 INFO L225 Difference]: With dead ends: 1567 [2021-02-21 20:33:11,331 INFO L226 Difference]: Without dead ends: 1565 [2021-02-21 20:33:11,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2021-02-21 20:33:11,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1307. [2021-02-21 20:33:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2021-02-21 20:33:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1658 transitions. [2021-02-21 20:33:11,542 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1658 transitions. Word has length 68 [2021-02-21 20:33:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:11,542 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 1658 transitions. [2021-02-21 20:33:11,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1658 transitions. [2021-02-21 20:33:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-02-21 20:33:11,544 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:11,544 INFO L422 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] [2021-02-21 20:33:11,545 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-21 20:33:11,545 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:11,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:11,545 INFO L82 PathProgramCache]: Analyzing trace with hash 403959429, now seen corresponding path program 1 times [2021-02-21 20:33:11,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:11,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [463068683] [2021-02-21 20:33:11,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:11,548 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:11,568 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:11,569 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:11,569 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:11,570 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:11,573 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:11,574 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:11,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:11,603 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:11,604 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:33:11,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [463068683] [2021-02-21 20:33:11,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:11,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:11,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446715214] [2021-02-21 20:33:11,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:11,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:11,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:11,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:11,611 INFO L87 Difference]: Start difference. First operand 1307 states and 1658 transitions. Second operand 4 states. [2021-02-21 20:33:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:12,226 INFO L93 Difference]: Finished difference Result 3743 states and 4764 transitions. [2021-02-21 20:33:12,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:12,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-02-21 20:33:12,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:12,238 INFO L225 Difference]: With dead ends: 3743 [2021-02-21 20:33:12,238 INFO L226 Difference]: Without dead ends: 2477 [2021-02-21 20:33:12,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:12,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2021-02-21 20:33:12,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2475. [2021-02-21 20:33:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2021-02-21 20:33:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3082 transitions. [2021-02-21 20:33:12,614 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3082 transitions. Word has length 68 [2021-02-21 20:33:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:12,615 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 3082 transitions. [2021-02-21 20:33:12,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3082 transitions. [2021-02-21 20:33:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-02-21 20:33:12,617 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:12,618 INFO L422 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] [2021-02-21 20:33:12,618 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-02-21 20:33:12,618 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:12,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:12,619 INFO L82 PathProgramCache]: Analyzing trace with hash 863214073, now seen corresponding path program 1 times [2021-02-21 20:33:12,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:12,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1739639914] [2021-02-21 20:33:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:12,621 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:12,639 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:12,640 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:12,640 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:12,641 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:12,644 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:12,644 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:12,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:12,671 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:12,672 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:33:12,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1739639914] [2021-02-21 20:33:12,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:12,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:12,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14911508] [2021-02-21 20:33:12,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:12,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:12,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:12,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:12,680 INFO L87 Difference]: Start difference. First operand 2475 states and 3082 transitions. Second operand 4 states. [2021-02-21 20:33:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:13,270 INFO L93 Difference]: Finished difference Result 2927 states and 3596 transitions. [2021-02-21 20:33:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:13,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-02-21 20:33:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:13,284 INFO L225 Difference]: With dead ends: 2927 [2021-02-21 20:33:13,284 INFO L226 Difference]: Without dead ends: 2925 [2021-02-21 20:33:13,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2021-02-21 20:33:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2475. [2021-02-21 20:33:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2021-02-21 20:33:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3050 transitions. [2021-02-21 20:33:13,614 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3050 transitions. Word has length 69 [2021-02-21 20:33:13,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:13,615 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 3050 transitions. [2021-02-21 20:33:13,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3050 transitions. [2021-02-21 20:33:13,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-02-21 20:33:13,617 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:13,617 INFO L422 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] [2021-02-21 20:33:13,617 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-02-21 20:33:13,617 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:13,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:13,618 INFO L82 PathProgramCache]: Analyzing trace with hash -361912749, now seen corresponding path program 1 times [2021-02-21 20:33:13,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:13,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [159488431] [2021-02-21 20:33:13,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:13,620 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:13,638 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:13,639 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:13,640 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:13,640 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:13,643 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:13,644 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:13,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:13,670 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:13,671 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:33:13,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [159488431] [2021-02-21 20:33:13,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:13,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:13,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491295991] [2021-02-21 20:33:13,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:13,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:13,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:13,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:13,678 INFO L87 Difference]: Start difference. First operand 2475 states and 3050 transitions. Second operand 4 states. [2021-02-21 20:33:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:14,462 INFO L93 Difference]: Finished difference Result 7149 states and 8811 transitions. [2021-02-21 20:33:14,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:14,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-02-21 20:33:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:14,474 INFO L225 Difference]: With dead ends: 7149 [2021-02-21 20:33:14,475 INFO L226 Difference]: Without dead ends: 2475 [2021-02-21 20:33:14,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2021-02-21 20:33:14,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2021-02-21 20:33:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2021-02-21 20:33:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 2922 transitions. [2021-02-21 20:33:14,802 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 2922 transitions. Word has length 69 [2021-02-21 20:33:14,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:14,802 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 2922 transitions. [2021-02-21 20:33:14,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:14,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2922 transitions. [2021-02-21 20:33:14,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-21 20:33:14,805 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:14,805 INFO L422 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] [2021-02-21 20:33:14,806 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-02-21 20:33:14,806 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:14,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:14,806 INFO L82 PathProgramCache]: Analyzing trace with hash -421419068, now seen corresponding path program 1 times [2021-02-21 20:33:14,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:14,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1324986070] [2021-02-21 20:33:14,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:14,809 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:14,826 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:14,827 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:14,828 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:14,828 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:14,831 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:14,832 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:14,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:14,865 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:14,865 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:33:14,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1324986070] [2021-02-21 20:33:14,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:14,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:14,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147582164] [2021-02-21 20:33:14,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:14,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:14,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:14,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:14,873 INFO L87 Difference]: Start difference. First operand 2475 states and 2922 transitions. Second operand 4 states. [2021-02-21 20:33:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:15,568 INFO L93 Difference]: Finished difference Result 2475 states and 2922 transitions. [2021-02-21 20:33:15,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:15,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2021-02-21 20:33:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:15,569 INFO L225 Difference]: With dead ends: 2475 [2021-02-21 20:33:15,569 INFO L226 Difference]: Without dead ends: 0 [2021-02-21 20:33:15,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-21 20:33:15,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-21 20:33:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-21 20:33:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-21 20:33:15,577 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2021-02-21 20:33:15,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:15,577 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-21 20:33:15,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:15,577 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-21 20:33:15,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-21 20:33:15,577 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-02-21 20:33:15,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-21 20:33:15,941 WARN L202 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 85 [2021-02-21 20:33:16,238 WARN L202 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 31 [2021-02-21 20:33:16,965 WARN L202 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-21 20:33:17,595 WARN L202 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-21 20:33:18,080 WARN L202 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-21 20:33:18,713 WARN L202 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-21 20:33:19,373 WARN L202 SmtUtils]: Spent 657.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-02-21 20:33:19,602 WARN L202 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 85 [2021-02-21 20:33:19,923 WARN L202 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 41 [2021-02-21 20:33:20,196 WARN L202 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 31 [2021-02-21 20:33:20,372 WARN L202 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2021-02-21 20:33:20,558 WARN L202 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 65 [2021-02-21 20:33:20,747 WARN L202 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 34 [2021-02-21 20:33:21,112 WARN L202 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 31 [2021-02-21 20:33:21,240 WARN L202 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 53 [2021-02-21 20:33:21,358 WARN L202 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 41 [2021-02-21 20:33:21,521 WARN L202 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 121 [2021-02-21 20:33:21,932 WARN L202 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-21 20:33:22,075 WARN L202 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 45 [2021-02-21 20:33:22,450 WARN L202 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-21 20:33:22,646 WARN L202 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 31 [2021-02-21 20:33:22,759 WARN L202 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-02-21 20:33:23,255 WARN L202 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 39 [2021-02-21 20:33:23,552 WARN L202 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 371 DAG size of output: 31 [2021-02-21 20:33:23,713 WARN L202 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 121 [2021-02-21 20:33:24,971 WARN L202 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-21 20:33:33,340 WARN L202 SmtUtils]: Spent 8.30 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2021-02-21 20:33:34,675 WARN L202 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-21 20:33:34,920 WARN L202 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-21 20:33:35,207 WARN L202 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2021-02-21 20:33:36,594 WARN L202 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-21 20:33:40,184 WARN L202 SmtUtils]: Spent 3.59 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2021-02-21 20:33:40,730 WARN L202 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-21 20:33:40,858 WARN L202 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2021-02-21 20:33:40,981 WARN L202 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-21 20:33:42,421 WARN L202 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-02-21 20:33:42,961 WARN L202 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-21 20:33:43,204 WARN L202 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-21 20:33:46,414 WARN L202 SmtUtils]: Spent 3.14 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-21 20:33:46,521 WARN L202 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-21 20:33:50,037 WARN L202 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2021-02-21 20:33:50,662 WARN L202 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2021-02-21 20:33:50,803 WARN L202 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-21 20:33:51,340 WARN L202 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-21 20:33:54,518 WARN L202 SmtUtils]: Spent 3.14 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-21 20:33:55,954 WARN L202 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-02-21 20:33:56,232 WARN L202 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2021-02-21 20:33:56,605 WARN L202 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-21 20:33:59,874 WARN L202 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-21 20:34:00,516 WARN L202 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2021-02-21 20:34:00,653 WARN L202 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2021-02-21 20:34:00,658 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-02-21 20:34:00,658 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-02-21 20:34:00,658 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-02-21 20:34:00,659 INFO L192 CegarLoopUtils]: At program point L3-2(line 3) the Hoare annotation is: true [2021-02-21 20:34:00,659 INFO L192 CegarLoopUtils]: At program point L3-3(line 3) the Hoare annotation is: true [2021-02-21 20:34:00,659 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-21 20:34:00,659 INFO L192 CegarLoopUtils]: At program point L3-4(line 3) the Hoare annotation is: true [2021-02-21 20:34:00,659 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-21 20:34:00,659 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2021-02-21 20:34:00,659 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:34:00,660 INFO L192 CegarLoopUtils]: At program point L3(line 3) the Hoare annotation is: true [2021-02-21 20:34:00,660 INFO L192 CegarLoopUtils]: At program point L3-1(line 3) the Hoare annotation is: true [2021-02-21 20:34:00,660 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-21 20:34:00,660 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-21 20:34:00,660 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-21 20:34:00,660 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-21 20:34:00,660 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-21 20:34:00,662 INFO L185 CegarLoopUtils]: At program point L93-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~p5~0 0)) (.cse1 (= main_~lk6~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~p7~0 0)) (.cse5 (= main_~lk4~0 1)) (.cse6 (= main_~p6~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse3 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse5 .cse6 .cse0 .cse7) (and .cse5 .cse0 .cse7 .cse1) (and .cse5 .cse6 .cse0 .cse3) (and .cse5 .cse0 .cse1 .cse3) (and .cse5 .cse1 .cse4 .cse3) (and .cse7 .cse1 .cse2 .cse4) (and .cse6 .cse0 .cse2 .cse3) (and .cse6 .cse7 .cse2 .cse4) (and .cse6 .cse0 .cse7 .cse2) (and .cse6 .cse2 .cse4 .cse3) (and .cse5 .cse7 .cse1 .cse4) (and .cse0 .cse7 .cse1 .cse2) (and .cse5 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse4 .cse3))) [2021-02-21 20:34:00,663 INFO L192 CegarLoopUtils]: At program point L27(line 27) the Hoare annotation is: true [2021-02-21 20:34:00,663 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2021-02-21 20:34:00,663 INFO L185 CegarLoopUtils]: At program point L85(line 85) the Hoare annotation is: (let ((.cse9 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse11 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.cse1 (= main_~p6~0 0)) (.cse10 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse7 .cse11 .cse5) (and .cse10 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse1 .cse10 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse9 .cse10 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse7 .cse11 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse12 .cse5) (and .cse10 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse10 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse9 .cse0 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse0 .cse1 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse11 .cse12 .cse5 .cse6) (and .cse10 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse0 .cse1 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse10 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse0 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse9 .cse0 .cse1 .cse3 .cse11 .cse5 .cse6) (and .cse10 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse0 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse10 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse3 .cse7 .cse11 .cse5) (and .cse1 .cse10 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse0 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse7 .cse4 .cse5))) [2021-02-21 20:34:00,664 INFO L185 CegarLoopUtils]: At program point L110(line 110) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2021-02-21 20:34:00,665 INFO L185 CegarLoopUtils]: At program point L77-1(lines 32 118) the Hoare annotation is: (let ((.cse1 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse10 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse13 (= main_~lk6~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse12 (= main_~p1~0 0)) (.cse11 (= main_~p2~0 0)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse11 .cse5) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse0 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse12 .cse11) (and .cse1 .cse8 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse8 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse7 .cse0 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse12) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse13 .cse9 .cse12 .cse11 .cse6))) [2021-02-21 20:34:00,665 INFO L192 CegarLoopUtils]: At program point L11(line 11) the Hoare annotation is: true [2021-02-21 20:34:00,665 INFO L192 CegarLoopUtils]: At program point L11-1(line 11) the Hoare annotation is: true [2021-02-21 20:34:00,665 INFO L192 CegarLoopUtils]: At program point L11-2(line 11) the Hoare annotation is: true [2021-02-21 20:34:00,665 INFO L185 CegarLoopUtils]: At program point L69-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2021-02-21 20:34:00,665 INFO L185 CegarLoopUtils]: At program point L94(line 94) the Hoare annotation is: (let ((.cse5 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse7 .cse3) (and .cse1 .cse8 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse6 .cse5 .cse7) (and .cse0 .cse1 .cse6 .cse5 .cse8) (and .cse0 .cse1 .cse5 .cse8 .cse3) (and .cse0 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5) (and .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse1 .cse6 .cse8 .cse7 .cse4) (and .cse1 .cse6 .cse5 .cse8 .cse7) (and .cse1 .cse5 .cse8 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse4))) [2021-02-21 20:34:00,666 INFO L185 CegarLoopUtils]: At program point L61-1(lines 32 118) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2021-02-21 20:34:00,666 INFO L192 CegarLoopUtils]: At program point L119(lines 7 123) the Hoare annotation is: true [2021-02-21 20:34:00,666 INFO L192 CegarLoopUtils]: At program point L53(lines 53 55) the Hoare annotation is: true [2021-02-21 20:34:00,666 INFO L192 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: true [2021-02-21 20:34:00,666 INFO L192 CegarLoopUtils]: At program point L20-1(line 20) the Hoare annotation is: true [2021-02-21 20:34:00,666 INFO L185 CegarLoopUtils]: At program point L53-2(lines 32 118) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2021-02-21 20:34:00,666 INFO L192 CegarLoopUtils]: At program point L20-2(line 20) the Hoare annotation is: true [2021-02-21 20:34:00,667 INFO L185 CegarLoopUtils]: At program point L78(line 78) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse9 (= main_~p1~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse9) (and .cse10 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse9 .cse4) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse5) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse5) (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse1 .cse2 .cse11 .cse7 .cse4 .cse5) (and .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse9 .cse4) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse10 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse5) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2021-02-21 20:34:00,667 INFO L192 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: true [2021-02-21 20:34:00,667 INFO L192 CegarLoopUtils]: At program point L12(line 12) the Hoare annotation is: true [2021-02-21 20:34:00,667 INFO L185 CegarLoopUtils]: At program point L70(line 70) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2021-02-21 20:34:00,667 INFO L185 CegarLoopUtils]: At program point L103-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~p6~0 0)) (.cse1 (= main_~lk7~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse2) (and .cse3 .cse1))) [2021-02-21 20:34:00,668 INFO L192 CegarLoopUtils]: At program point L37(line 37) the Hoare annotation is: true [2021-02-21 20:34:00,668 INFO L185 CegarLoopUtils]: At program point L95(line 95) the Hoare annotation is: (let ((.cse5 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse7 .cse3) (and .cse1 .cse8 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse6 .cse5 .cse7) (and .cse0 .cse1 .cse6 .cse5 .cse8) (and .cse0 .cse1 .cse5 .cse8 .cse3) (and .cse0 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5) (and .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse1 .cse6 .cse8 .cse7 .cse4) (and .cse1 .cse6 .cse5 .cse8 .cse7) (and .cse1 .cse5 .cse8 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse4))) [2021-02-21 20:34:00,668 INFO L185 CegarLoopUtils]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2021-02-21 20:34:00,668 INFO L192 CegarLoopUtils]: At program point L54(line 54) the Hoare annotation is: true [2021-02-21 20:34:00,668 INFO L192 CegarLoopUtils]: At program point L21(line 21) the Hoare annotation is: true [2021-02-21 20:34:00,668 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2021-02-21 20:34:00,669 INFO L185 CegarLoopUtils]: At program point L104(line 104) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2021-02-21 20:34:00,669 INFO L185 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) the Hoare annotation is: false [2021-02-21 20:34:00,669 INFO L192 CegarLoopUtils]: At program point L30(line 30) the Hoare annotation is: true [2021-02-21 20:34:00,669 INFO L192 CegarLoopUtils]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2021-02-21 20:34:00,669 INFO L185 CegarLoopUtils]: At program point L121(line 121) the Hoare annotation is: false [2021-02-21 20:34:00,670 INFO L185 CegarLoopUtils]: At program point L88-1(lines 32 118) the Hoare annotation is: (let ((.cse7 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p3~0 0)) (.cse5 (= main_~p7~0 0)) (.cse8 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse6 .cse5 .cse7 .cse8 .cse3) (and .cse2 .cse6 .cse9 .cse8 .cse4) (and .cse1 .cse2 .cse9 .cse5 .cse8) (and .cse6 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse5 .cse3) (and .cse1 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse2 .cse9 .cse8 .cse4) (and .cse6 .cse7 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse8 .cse3) (and .cse1 .cse7 .cse8 .cse3 .cse4) (and .cse2 .cse6 .cse9 .cse5 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse7) (and .cse6 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse9 .cse5 .cse7) (and .cse0 .cse6 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse5) (and .cse2 .cse6 .cse8 .cse3 .cse4) (and .cse0 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse6 .cse7 .cse3 .cse4) (and .cse1 .cse5 .cse7 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse4) (and .cse2 .cse6 .cse5 .cse8 .cse3))) [2021-02-21 20:34:00,670 INFO L192 CegarLoopUtils]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2021-02-21 20:34:00,670 INFO L192 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: true [2021-02-21 20:34:00,670 INFO L192 CegarLoopUtils]: At program point L14(line 14) the Hoare annotation is: true [2021-02-21 20:34:00,670 INFO L192 CegarLoopUtils]: At program point L14-1(line 14) the Hoare annotation is: true [2021-02-21 20:34:00,670 INFO L192 CegarLoopUtils]: At program point L14-2(line 14) the Hoare annotation is: true [2021-02-21 20:34:00,671 INFO L185 CegarLoopUtils]: At program point L105(line 105) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2021-02-21 20:34:00,671 INFO L192 CegarLoopUtils]: At program point L39(line 39) the Hoare annotation is: true [2021-02-21 20:34:00,671 INFO L185 CegarLoopUtils]: At program point L122(line 122) the Hoare annotation is: false [2021-02-21 20:34:00,671 INFO L185 CegarLoopUtils]: At program point L89(line 89) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2021-02-21 20:34:00,671 INFO L192 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: true [2021-02-21 20:34:00,672 INFO L192 CegarLoopUtils]: At program point L23-1(line 23) the Hoare annotation is: true [2021-02-21 20:34:00,672 INFO L192 CegarLoopUtils]: At program point L23-2(line 23) the Hoare annotation is: true [2021-02-21 20:34:00,672 INFO L185 CegarLoopUtils]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2021-02-21 20:34:00,672 INFO L185 CegarLoopUtils]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2021-02-21 20:34:00,672 INFO L192 CegarLoopUtils]: At program point L15(line 15) the Hoare annotation is: true [2021-02-21 20:34:00,673 INFO L185 CegarLoopUtils]: At program point L73-1(lines 32 118) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse9 (= main_~p1~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse9) (and .cse10 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse9 .cse4) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse5) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse5) (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse1 .cse2 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse9 .cse4) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse10 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2021-02-21 20:34:00,673 INFO L185 CegarLoopUtils]: At program point L98-1(lines 32 118) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse0 (= main_~p6~0 0)) (.cse5 (= main_~lk7~0 1)) (.cse3 (= main_~p5~0 0)) (.cse1 (= main_~p7~0 0)) (.cse4 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1) (and .cse3 .cse4 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse2 .cse5) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse1 .cse4))) [2021-02-21 20:34:00,673 INFO L185 CegarLoopUtils]: At program point L65-1(lines 32 118) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2021-02-21 20:34:00,674 INFO L185 CegarLoopUtils]: At program point L90(line 90) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2021-02-21 20:34:00,674 INFO L192 CegarLoopUtils]: At program point L24(line 24) the Hoare annotation is: true [2021-02-21 20:34:00,674 INFO L185 CegarLoopUtils]: At program point L57-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2021-02-21 20:34:00,674 INFO L185 CegarLoopUtils]: At program point L115(line 115) the Hoare annotation is: (= main_~lk7~0 1) [2021-02-21 20:34:00,674 INFO L192 CegarLoopUtils]: At program point L49(line 49) the Hoare annotation is: true [2021-02-21 20:34:00,675 INFO L185 CegarLoopUtils]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2021-02-21 20:34:00,675 INFO L192 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: true [2021-02-21 20:34:00,675 INFO L192 CegarLoopUtils]: At program point L8(line 8) the Hoare annotation is: true [2021-02-21 20:34:00,675 INFO L192 CegarLoopUtils]: At program point L8-1(line 8) the Hoare annotation is: true [2021-02-21 20:34:00,675 INFO L185 CegarLoopUtils]: At program point L99(line 99) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse5) (and .cse0 .cse1 .cse5 .cse6) (and .cse0 .cse4 .cse5 .cse6))) [2021-02-21 20:34:00,676 INFO L185 CegarLoopUtils]: At program point L66(line 66) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2021-02-21 20:34:00,676 INFO L192 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: true [2021-02-21 20:34:00,676 INFO L192 CegarLoopUtils]: At program point L33-1(line 33) the Hoare annotation is: true [2021-02-21 20:34:00,676 INFO L192 CegarLoopUtils]: At program point L33-2(line 33) the Hoare annotation is: true [2021-02-21 20:34:00,676 INFO L185 CegarLoopUtils]: At program point L58(line 58) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2021-02-21 20:34:00,677 INFO L185 CegarLoopUtils]: At program point L83-1(lines 32 118) the Hoare annotation is: (let ((.cse5 (= main_~lk5~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse11 (= main_~p2~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse1 .cse4 .cse5 .cse11 .cse10) (and .cse1 .cse7 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse1 .cse9 .cse3 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse8 .cse6 .cse0 .cse3 .cse5 .cse11) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse11 .cse10) (and .cse1 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse5 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse3 .cse5 .cse11) (and .cse8 .cse6 .cse3 .cse7 .cse5 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse8 .cse6 .cse7 .cse5 .cse11 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse1 .cse9 .cse3 .cse7 .cse4 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse11 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse3 .cse4 .cse5 .cse11) (and .cse6 .cse9 .cse3 .cse7 .cse4 .cse11) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse6 .cse9 .cse7 .cse4 .cse11 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse8 .cse6 .cse9 .cse3 .cse7 .cse11) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse8 .cse1 .cse3 .cse7 .cse5 .cse11) (and .cse8 .cse6 .cse9 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse3 .cse11) (and .cse0 .cse1 .cse9 .cse4 .cse11 .cse10) (and .cse6 .cse0 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse3 .cse11) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse6 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse6 .cse0 .cse9 .cse4 .cse11 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse1 .cse9 .cse7 .cse4 .cse11 .cse10) (and .cse6 .cse7 .cse4 .cse5 .cse11 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse8 .cse1 .cse7 .cse5 .cse11 .cse10) (and .cse8 .cse1 .cse9 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse11) (and .cse6 .cse0 .cse9 .cse3 .cse4 .cse11) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2021-02-21 20:34:00,677 INFO L192 CegarLoopUtils]: At program point L17(line 17) the Hoare annotation is: true [2021-02-21 20:34:00,677 INFO L192 CegarLoopUtils]: At program point L17-1(line 17) the Hoare annotation is: true [2021-02-21 20:34:00,677 INFO L192 CegarLoopUtils]: At program point L17-2(line 17) the Hoare annotation is: true [2021-02-21 20:34:00,677 INFO L185 CegarLoopUtils]: At program point L108-1(lines 32 118) the Hoare annotation is: (or (= main_~p7~0 0) (= main_~lk7~0 1)) [2021-02-21 20:34:00,678 INFO L192 CegarLoopUtils]: At program point L9(line 9) the Hoare annotation is: true [2021-02-21 20:34:00,678 INFO L185 CegarLoopUtils]: At program point L100(line 100) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse5) (and .cse0 .cse1 .cse5 .cse6) (and .cse0 .cse4 .cse5 .cse6))) [2021-02-21 20:34:00,678 INFO L192 CegarLoopUtils]: At program point L34(lines 34 36) the Hoare annotation is: true [2021-02-21 20:34:00,678 INFO L192 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: true [2021-02-21 20:34:00,678 INFO L192 CegarLoopUtils]: At program point L26-1(line 26) the Hoare annotation is: true [2021-02-21 20:34:00,678 INFO L192 CegarLoopUtils]: At program point L26-2(line 26) the Hoare annotation is: true [2021-02-21 20:34:00,679 INFO L185 CegarLoopUtils]: At program point L84(line 84) the Hoare annotation is: (let ((.cse9 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse11 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.cse1 (= main_~p6~0 0)) (.cse10 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse7 .cse11 .cse5) (and .cse10 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse1 .cse10 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse9 .cse10 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse7 .cse11 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse12 .cse5) (and .cse10 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse10 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse9 .cse0 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse0 .cse1 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse11 .cse12 .cse5 .cse6) (and .cse10 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse0 .cse1 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse10 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse0 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse9 .cse0 .cse1 .cse3 .cse11 .cse5 .cse6) (and .cse10 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse0 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse10 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse3 .cse7 .cse11 .cse5) (and .cse1 .cse10 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse0 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse7 .cse4 .cse5))) [2021-02-21 20:34:00,679 INFO L192 CegarLoopUtils]: At program point L18(line 18) the Hoare annotation is: true [2021-02-21 20:34:00,679 INFO L185 CegarLoopUtils]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2021-02-21 20:34:00,679 INFO L192 CegarLoopUtils]: At program point L43(line 43) the Hoare annotation is: true [2021-02-21 20:34:00,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 08:34:00 BoogieIcfgContainer [2021-02-21 20:34:00,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-21 20:34:00,695 INFO L168 Benchmark]: Toolchain (without parser) took 57204.18 ms. Allocated memory was 157.3 MB in the beginning and 1.0 GB in the end (delta: 892.3 MB). Free memory was 133.2 MB in the beginning and 506.1 MB in the end (delta: -372.9 MB). Peak memory consumption was 654.5 MB. Max. memory is 8.0 GB. [2021-02-21 20:34:00,696 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 157.3 MB. Free memory is still 131.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-21 20:34:00,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.37 ms. Allocated memory is still 157.3 MB. Free memory was 132.1 MB in the beginning and 122.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-02-21 20:34:00,697 INFO L168 Benchmark]: Boogie Preprocessor took 80.15 ms. Allocated memory is still 157.3 MB. Free memory was 122.1 MB in the beginning and 120.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-02-21 20:34:00,697 INFO L168 Benchmark]: RCFGBuilder took 844.46 ms. Allocated memory is still 157.3 MB. Free memory was 120.5 MB in the beginning and 130.5 MB in the end (delta: -10.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2021-02-21 20:34:00,698 INFO L168 Benchmark]: TraceAbstraction took 55934.46 ms. Allocated memory was 157.3 MB in the beginning and 1.0 GB in the end (delta: 892.3 MB). Free memory was 130.0 MB in the beginning and 506.1 MB in the end (delta: -376.1 MB). Peak memory consumption was 651.5 MB. Max. memory is 8.0 GB. [2021-02-21 20:34:00,700 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 157.3 MB. Free memory is still 131.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 328.37 ms. Allocated memory is still 157.3 MB. Free memory was 132.1 MB in the beginning and 122.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 80.15 ms. Allocated memory is still 157.3 MB. Free memory was 122.1 MB in the beginning and 120.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 844.46 ms. Allocated memory is still 157.3 MB. Free memory was 120.5 MB in the beginning and 130.5 MB in the end (delta: -10.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 55934.46 ms. Allocated memory was 157.3 MB in the beginning and 1.0 GB in the end (delta: 892.3 MB). Free memory was 130.0 MB in the beginning and 506.1 MB in the end (delta: -376.1 MB). Peak memory consumption was 651.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 45.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1927 SDtfs, 2229 SDslu, 214 SDs, 0 SdLazy, 1391 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2475occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 1020 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 97 LocationsWithAnnotation, 97 PreInvPairs, 4777 NumberOfFragments, 13957 HoareAnnotationTreeSize, 97 FomulaSimplifications, 1335593 FormulaSimplificationTreeSizeReduction, 8.2s HoareSimplificationTime, 97 FomulaSimplificationsInter, 24188 FormulaSimplificationTreeSizeReductionInter, 36.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...