java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 17:14:40,857 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 17:14:40,859 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 17:14:40,869 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 17:14:40,870 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 17:14:40,870 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 17:14:40,871 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 17:14:40,873 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 17:14:40,875 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 17:14:40,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 17:14:40,876 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 17:14:40,876 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 17:14:40,877 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 17:14:40,878 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 17:14:40,879 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 17:14:40,880 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 17:14:40,882 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 17:14:40,883 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 17:14:40,884 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 17:14:40,885 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 17:14:40,886 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 17:14:40,887 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 17:14:40,887 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 17:14:40,888 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 17:14:40,888 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 17:14:40,889 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 17:14:40,889 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 17:14:40,890 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 17:14:40,890 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 17:14:40,890 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 17:14:40,891 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 17:14:40,891 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 17:14:40,912 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 17:14:40,912 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 17:14:40,913 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 17:14:40,913 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 17:14:40,914 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 17:14:40,914 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 17:14:40,914 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 17:14:40,914 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 17:14:40,914 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 17:14:40,914 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 17:14:40,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 17:14:40,915 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 17:14:40,915 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 17:14:40,915 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 17:14:40,915 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 17:14:40,915 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 17:14:40,915 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 17:14:40,916 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 17:14:40,916 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 17:14:40,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 17:14:40,916 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 17:14:40,916 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 17:14:40,916 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 17:14:40,917 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 17:14:40,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 17:14:40,953 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 17:14:40,956 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 17:14:40,958 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 17:14:40,958 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 17:14:40,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 17:14:41,301 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6c51902df [2018-04-11 17:14:41,401 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 17:14:41,401 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 17:14:41,401 INFO L168 CDTParser]: Scanning test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 17:14:41,402 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 17:14:41,402 INFO L215 ultiparseSymbolTable]: [2018-04-11 17:14:41,402 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 17:14:41,402 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 17:14:41,402 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 17:14:41,402 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__size_t in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 17:14:41,402 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 17:14:41,431 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6c51902df [2018-04-11 17:14:41,434 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 17:14:41,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 17:14:41,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 17:14:41,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 17:14:41,441 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 17:14:41,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 05:14:41" (1/1) ... [2018-04-11 17:14:41,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25fd0a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:14:41, skipping insertion in model container [2018-04-11 17:14:41,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 05:14:41" (1/1) ... [2018-04-11 17:14:41,454 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 17:14:41,466 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 17:14:41,587 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 17:14:41,615 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 17:14:41,621 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-11 17:14:41,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:14:41 WrapperNode [2018-04-11 17:14:41,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 17:14:41,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 17:14:41,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 17:14:41,631 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 17:14:41,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:14:41" (1/1) ... [2018-04-11 17:14:41,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:14:41" (1/1) ... [2018-04-11 17:14:41,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:14:41" (1/1) ... [2018-04-11 17:14:41,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:14:41" (1/1) ... [2018-04-11 17:14:41,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:14:41" (1/1) ... [2018-04-11 17:14:41,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:14:41" (1/1) ... [2018-04-11 17:14:41,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:14:41" (1/1) ... [2018-04-11 17:14:41,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 17:14:41,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 17:14:41,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 17:14:41,664 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 17:14:41,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:14:41" (1/1) ... No working directory specified, using /home/ultimate/work/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 [2018-04-11 17:14:41,704 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 17:14:41,704 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 17:14:41,704 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 17:14:41,705 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-11 17:14:41,705 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 17:14:41,705 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 17:14:41,705 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 17:14:41,705 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 17:14:41,705 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 17:14:41,705 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-11 17:14:41,705 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 17:14:41,705 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 17:14:41,705 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 17:14:41,705 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 17:14:41,706 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 17:14:41,706 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 17:14:42,042 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 17:14:42,049 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 17:14:42,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 05:14:42 BoogieIcfgContainer [2018-04-11 17:14:42,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 17:14:42,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 17:14:42,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 17:14:42,052 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 17:14:42,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 05:14:41" (1/3) ... [2018-04-11 17:14:42,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796107a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 05:14:42, skipping insertion in model container [2018-04-11 17:14:42,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:14:41" (2/3) ... [2018-04-11 17:14:42,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796107a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 05:14:42, skipping insertion in model container [2018-04-11 17:14:42,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 05:14:42" (3/3) ... [2018-04-11 17:14:42,053 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 17:14:42,059 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 17:14:42,066 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-04-11 17:14:42,096 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 17:14:42,097 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 17:14:42,097 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 17:14:42,097 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 17:14:42,097 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 17:14:42,097 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 17:14:42,098 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 17:14:42,098 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 17:14:42,098 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 17:14:42,098 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 17:14:42,107 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-04-11 17:14:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 17:14:42,113 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:14:42,113 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:14:42,113 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:14:42,116 INFO L82 PathProgramCache]: Analyzing trace with hash -383275974, now seen corresponding path program 1 times [2018-04-11 17:14:42,117 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:14:42,117 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:14:42,144 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:42,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:14:42,145 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:42,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:14:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:42,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:14:42,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:14:42,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:14:42,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:14:42,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:14:42,254 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 4 states. [2018-04-11 17:14:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:14:42,488 INFO L93 Difference]: Finished difference Result 202 states and 221 transitions. [2018-04-11 17:14:42,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:14:42,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 17:14:42,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:14:42,500 INFO L225 Difference]: With dead ends: 202 [2018-04-11 17:14:42,500 INFO L226 Difference]: Without dead ends: 199 [2018-04-11 17:14:42,501 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:14:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-11 17:14:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 123. [2018-04-11 17:14:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 17:14:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-04-11 17:14:42,531 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 17 [2018-04-11 17:14:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:14:42,532 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-04-11 17:14:42,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:14:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-04-11 17:14:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 17:14:42,533 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:14:42,533 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:14:42,533 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:14:42,533 INFO L82 PathProgramCache]: Analyzing trace with hash -383275973, now seen corresponding path program 1 times [2018-04-11 17:14:42,533 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:14:42,533 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:14:42,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:42,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:14:42,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:42,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:14:42,553 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:14:42,554 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:14:42,554 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:14:42,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:14:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:42,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:14:42,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:14:42,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:14:42,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:42,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 17:14:42,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:14:42,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:14:42,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:14:42,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 17:14:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:42,629 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:14:42,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 17:14:42,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 17:14:42,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 17:14:42,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 17:14:42,630 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 3 states. [2018-04-11 17:14:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:14:42,716 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2018-04-11 17:14:42,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 17:14:42,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-04-11 17:14:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:14:42,717 INFO L225 Difference]: With dead ends: 188 [2018-04-11 17:14:42,717 INFO L226 Difference]: Without dead ends: 188 [2018-04-11 17:14:42,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 17:14:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-11 17:14:42,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 122. [2018-04-11 17:14:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 17:14:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-04-11 17:14:42,723 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 17 [2018-04-11 17:14:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:14:42,724 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-04-11 17:14:42,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 17:14:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-04-11 17:14:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 17:14:42,724 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:14:42,725 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:14:42,725 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:14:42,725 INFO L82 PathProgramCache]: Analyzing trace with hash -383275972, now seen corresponding path program 1 times [2018-04-11 17:14:42,725 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:14:42,725 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:14:42,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:42,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:14:42,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:42,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:14:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:42,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:14:42,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:14:42,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:14:42,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:14:42,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:14:42,788 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 4 states. [2018-04-11 17:14:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:14:42,875 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-04-11 17:14:42,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 17:14:42,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 17:14:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:14:42,876 INFO L225 Difference]: With dead ends: 100 [2018-04-11 17:14:42,876 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 17:14:42,876 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:14:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 17:14:42,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-04-11 17:14:42,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 17:14:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-04-11 17:14:42,881 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 17 [2018-04-11 17:14:42,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:14:42,881 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-04-11 17:14:42,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:14:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-04-11 17:14:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 17:14:42,882 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:14:42,882 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:14:42,882 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:14:42,882 INFO L82 PathProgramCache]: Analyzing trace with hash -383275971, now seen corresponding path program 1 times [2018-04-11 17:14:42,883 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:14:42,883 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:14:42,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:42,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:14:42,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:42,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:14:42,901 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:14:42,901 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:14:42,901 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:14:42,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:14:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:42,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:14:42,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:14:42,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:14:42,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:42,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:14:42,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:14:42,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:14:42,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:14:42,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-11 17:14:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:42,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:14:42,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 17:14:42,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 17:14:42,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 17:14:42,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 17:14:42,957 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 3 states. [2018-04-11 17:14:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:14:42,976 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-04-11 17:14:42,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 17:14:42,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-04-11 17:14:42,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:14:42,977 INFO L225 Difference]: With dead ends: 99 [2018-04-11 17:14:42,977 INFO L226 Difference]: Without dead ends: 99 [2018-04-11 17:14:42,977 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 17:14:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-11 17:14:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-04-11 17:14:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-11 17:14:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-04-11 17:14:42,980 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 17 [2018-04-11 17:14:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:14:42,980 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-04-11 17:14:42,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 17:14:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-04-11 17:14:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 17:14:42,981 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:14:42,981 INFO L355 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] [2018-04-11 17:14:42,981 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:14:42,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1560963691, now seen corresponding path program 1 times [2018-04-11 17:14:42,981 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:14:42,981 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:14:42,982 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:42,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:14:42,982 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:42,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:14:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:43,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:14:43,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:14:43,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:14:43,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:14:43,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:14:43,029 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 4 states. [2018-04-11 17:14:43,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:14:43,036 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2018-04-11 17:14:43,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 17:14:43,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-11 17:14:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:14:43,037 INFO L225 Difference]: With dead ends: 102 [2018-04-11 17:14:43,037 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 17:14:43,037 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:14:43,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 17:14:43,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-04-11 17:14:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 17:14:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-04-11 17:14:43,040 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 29 [2018-04-11 17:14:43,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:14:43,040 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-04-11 17:14:43,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:14:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-04-11 17:14:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 17:14:43,041 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:14:43,041 INFO L355 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] [2018-04-11 17:14:43,041 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:14:43,041 INFO L82 PathProgramCache]: Analyzing trace with hash 730350873, now seen corresponding path program 1 times [2018-04-11 17:14:43,041 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:14:43,041 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:14:43,042 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:43,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:14:43,042 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:43,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:14:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:43,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:14:43,084 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:14:43,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:14:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:43,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:14:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:43,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:14:43,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-04-11 17:14:43,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 17:14:43,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 17:14:43,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:14:43,120 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 8 states. [2018-04-11 17:14:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:14:43,140 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-04-11 17:14:43,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:14:43,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-04-11 17:14:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:14:43,140 INFO L225 Difference]: With dead ends: 103 [2018-04-11 17:14:43,141 INFO L226 Difference]: Without dead ends: 101 [2018-04-11 17:14:43,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-11 17:14:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-11 17:14:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-04-11 17:14:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 17:14:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-04-11 17:14:43,143 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 30 [2018-04-11 17:14:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:14:43,143 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-04-11 17:14:43,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 17:14:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-04-11 17:14:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 17:14:43,144 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:14:43,144 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:14:43,144 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:14:43,144 INFO L82 PathProgramCache]: Analyzing trace with hash 751157291, now seen corresponding path program 2 times [2018-04-11 17:14:43,144 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:14:43,144 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:14:43,145 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:43,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:14:43,145 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:43,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:14:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:43,192 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:14:43,192 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:14:43,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:14:43,221 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:14:43,221 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:14:43,224 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:14:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:43,263 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:14:43,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-11 17:14:43,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 17:14:43,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 17:14:43,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-11 17:14:43,264 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 10 states. [2018-04-11 17:14:43,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:14:43,297 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-04-11 17:14:43,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 17:14:43,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-04-11 17:14:43,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:14:43,298 INFO L225 Difference]: With dead ends: 104 [2018-04-11 17:14:43,299 INFO L226 Difference]: Without dead ends: 102 [2018-04-11 17:14:43,299 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-04-11 17:14:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-11 17:14:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-04-11 17:14:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-11 17:14:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-04-11 17:14:43,302 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 31 [2018-04-11 17:14:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:14:43,303 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-04-11 17:14:43,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 17:14:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-04-11 17:14:43,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 17:14:43,303 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:14:43,304 INFO L355 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:14:43,304 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:14:43,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1396156249, now seen corresponding path program 3 times [2018-04-11 17:14:43,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:14:43,304 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:14:43,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:43,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:14:43,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:43,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:14:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:43,361 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:14:43,361 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:14:43,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 17:14:43,387 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 17:14:43,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:14:43,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:14:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:43,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:14:43,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-04-11 17:14:43,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 17:14:43,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 17:14:43,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-04-11 17:14:43,423 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 12 states. [2018-04-11 17:14:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:14:43,457 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2018-04-11 17:14:43,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:14:43,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-04-11 17:14:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:14:43,459 INFO L225 Difference]: With dead ends: 105 [2018-04-11 17:14:43,460 INFO L226 Difference]: Without dead ends: 103 [2018-04-11 17:14:43,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-04-11 17:14:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-11 17:14:43,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-04-11 17:14:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-11 17:14:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-04-11 17:14:43,463 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 32 [2018-04-11 17:14:43,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:14:43,463 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-04-11 17:14:43,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 17:14:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-04-11 17:14:43,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 17:14:43,464 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:14:43,464 INFO L355 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:14:43,464 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:14:43,465 INFO L82 PathProgramCache]: Analyzing trace with hash -83712533, now seen corresponding path program 4 times [2018-04-11 17:14:43,465 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:14:43,465 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:14:43,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:43,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:14:43,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:43,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:14:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:43,546 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:14:43,546 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:14:43,547 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 17:14:43,558 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 17:14:43,558 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:14:43,561 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:14:43,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:43,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:14:43,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-04-11 17:14:43,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 17:14:43,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 17:14:43,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-04-11 17:14:43,600 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 14 states. [2018-04-11 17:14:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:14:43,637 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2018-04-11 17:14:43,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 17:14:43,637 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-04-11 17:14:43,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:14:43,638 INFO L225 Difference]: With dead ends: 106 [2018-04-11 17:14:43,643 INFO L226 Difference]: Without dead ends: 104 [2018-04-11 17:14:43,643 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-04-11 17:14:43,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-11 17:14:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-04-11 17:14:43,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-11 17:14:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-04-11 17:14:43,647 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 33 [2018-04-11 17:14:43,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:14:43,647 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-04-11 17:14:43,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 17:14:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-04-11 17:14:43,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 17:14:43,648 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:14:43,648 INFO L355 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:14:43,648 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:14:43,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1284995481, now seen corresponding path program 5 times [2018-04-11 17:14:43,648 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:14:43,649 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:14:43,649 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:43,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:14:43,650 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:43,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:14:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:43,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:14:43,721 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:14:43,721 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 17:14:43,735 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-11 17:14:43,735 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:14:43,737 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:14:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:43,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:14:43,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-11 17:14:43,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 17:14:43,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 17:14:43,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-04-11 17:14:43,771 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 16 states. [2018-04-11 17:14:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:14:43,825 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-04-11 17:14:43,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 17:14:43,826 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-04-11 17:14:43,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:14:43,826 INFO L225 Difference]: With dead ends: 107 [2018-04-11 17:14:43,826 INFO L226 Difference]: Without dead ends: 105 [2018-04-11 17:14:43,827 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-04-11 17:14:43,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-11 17:14:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-04-11 17:14:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-11 17:14:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-04-11 17:14:43,830 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 34 [2018-04-11 17:14:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:14:43,830 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-04-11 17:14:43,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 17:14:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-04-11 17:14:43,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 17:14:43,831 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:14:43,831 INFO L355 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:14:43,831 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:14:43,831 INFO L82 PathProgramCache]: Analyzing trace with hash 765270955, now seen corresponding path program 6 times [2018-04-11 17:14:43,831 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:14:43,831 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:14:43,832 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:43,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:14:43,832 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:43,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:14:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:43,892 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:14:43,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:14:43,893 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 17:14:43,913 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-11 17:14:43,913 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:14:43,916 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:14:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:43,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:14:43,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-04-11 17:14:43,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 17:14:43,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 17:14:43,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-04-11 17:14:43,969 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 18 states. [2018-04-11 17:14:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:14:44,006 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-04-11 17:14:44,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 17:14:44,007 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-04-11 17:14:44,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:14:44,008 INFO L225 Difference]: With dead ends: 108 [2018-04-11 17:14:44,008 INFO L226 Difference]: Without dead ends: 106 [2018-04-11 17:14:44,009 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2018-04-11 17:14:44,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-11 17:14:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-04-11 17:14:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-11 17:14:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-04-11 17:14:44,011 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 35 [2018-04-11 17:14:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:14:44,012 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-04-11 17:14:44,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 17:14:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-04-11 17:14:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 17:14:44,012 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:14:44,013 INFO L355 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:14:44,013 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:14:44,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1833679833, now seen corresponding path program 7 times [2018-04-11 17:14:44,013 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:14:44,013 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:14:44,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:44,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:14:44,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:44,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:14:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:44,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:14:44,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:14:44,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:14:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:44,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:14:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:44,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:14:44,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-11 17:14:44,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 17:14:44,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 17:14:44,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2018-04-11 17:14:44,209 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 20 states. [2018-04-11 17:14:44,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:14:44,253 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-04-11 17:14:44,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 17:14:44,253 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-04-11 17:14:44,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:14:44,254 INFO L225 Difference]: With dead ends: 109 [2018-04-11 17:14:44,254 INFO L226 Difference]: Without dead ends: 107 [2018-04-11 17:14:44,255 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2018-04-11 17:14:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-11 17:14:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-04-11 17:14:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-11 17:14:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-04-11 17:14:44,257 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 36 [2018-04-11 17:14:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:14:44,258 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-04-11 17:14:44,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 17:14:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2018-04-11 17:14:44,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 17:14:44,258 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:14:44,258 INFO L355 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:14:44,259 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:14:44,259 INFO L82 PathProgramCache]: Analyzing trace with hash 594616683, now seen corresponding path program 8 times [2018-04-11 17:14:44,259 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:14:44,259 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:14:44,260 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:44,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:14:44,260 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:44,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:14:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:44,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:14:44,359 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:14:44,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:14:44,379 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:14:44,379 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:14:44,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:14:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:44,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:14:44,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-04-11 17:14:44,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 17:14:44,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 17:14:44,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2018-04-11 17:14:44,439 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 22 states. [2018-04-11 17:14:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:14:44,478 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-04-11 17:14:44,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 17:14:44,479 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-04-11 17:14:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:14:44,479 INFO L225 Difference]: With dead ends: 110 [2018-04-11 17:14:44,479 INFO L226 Difference]: Without dead ends: 108 [2018-04-11 17:14:44,480 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2018-04-11 17:14:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-11 17:14:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-04-11 17:14:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 17:14:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2018-04-11 17:14:44,482 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 37 [2018-04-11 17:14:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:14:44,482 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2018-04-11 17:14:44,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 17:14:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2018-04-11 17:14:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 17:14:44,482 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:14:44,483 INFO L355 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:14:44,483 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:14:44,483 INFO L82 PathProgramCache]: Analyzing trace with hash 838364697, now seen corresponding path program 9 times [2018-04-11 17:14:44,483 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:14:44,483 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:14:44,484 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:44,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:14:44,484 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:44,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:14:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:44,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:14:44,600 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:14:44,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 17:14:44,625 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-11 17:14:44,626 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:14:44,629 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:14:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:14:44,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:14:44,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-04-11 17:14:44,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 17:14:44,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 17:14:44,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2018-04-11 17:14:44,699 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 24 states. [2018-04-11 17:14:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:14:44,734 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-04-11 17:14:44,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 17:14:44,734 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 38 [2018-04-11 17:14:44,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:14:44,735 INFO L225 Difference]: With dead ends: 111 [2018-04-11 17:14:44,735 INFO L226 Difference]: Without dead ends: 109 [2018-04-11 17:14:44,735 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2018-04-11 17:14:44,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-11 17:14:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-04-11 17:14:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-11 17:14:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2018-04-11 17:14:44,738 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 38 [2018-04-11 17:14:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:14:44,738 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2018-04-11 17:14:44,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 17:14:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2018-04-11 17:14:44,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 17:14:44,739 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:14:44,739 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:14:44,739 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:14:44,739 INFO L82 PathProgramCache]: Analyzing trace with hash -195381461, now seen corresponding path program 10 times [2018-04-11 17:14:44,739 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:14:44,739 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:14:44,740 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:44,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:14:44,740 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:14:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:14:44,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:14:44,780 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:14:44,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:14:44,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:14:44,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 17:14:44,808 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 17:14:44,808 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:14:44,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:14:44,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:14:44,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:14:44,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:14:44,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:44,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:44,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-11 17:14:44,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 17:14:44,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-04-11 17:14:44,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:14:44,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:44,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:44,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 17:14:44,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-11 17:14:44,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 60 [2018-04-11 17:14:44,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:14:44,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:44,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:44,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-11 17:14:44,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-11 17:14:44,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 93 [2018-04-11 17:14:44,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:14:44,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:44,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:44,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-11 17:14:44,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-04-11 17:14:44,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:44,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 132 [2018-04-11 17:14:44,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:14:44,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:45,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:45,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-11 17:14:45,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-04-11 17:14:45,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 179 [2018-04-11 17:14:45,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:14:45,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:45,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:45,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-04-11 17:14:45,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2018-04-11 17:14:45,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 234 [2018-04-11 17:14:45,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:14:45,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:45,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:45,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-04-11 17:14:45,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2018-04-11 17:14:45,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:14:45,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 157 [2018-04-11 17:14:45,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:14:45,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:45,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:14:45,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:7 [2018-04-11 17:14:46,657 WARN L148 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 77 [2018-04-11 17:14:47,362 WARN L148 SmtUtils]: Spent 130ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-11 17:14:48,186 WARN L148 SmtUtils]: Spent 136ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-11 17:18:11,777 WARN L151 SmtUtils]: Spent 203528ms on a formula simplification. DAG size of input: 3699 DAG size of output 157 [2018-04-11 17:18:13,429 INFO L303 Elim1Store]: Index analysis took 1650 ms [2018-04-11 17:18:13,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 11787 treesize of output 972 [2018-04-11 17:18:13,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,568 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:18:13,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,670 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:18:13,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:13,713 INFO L303 Elim1Store]: Index analysis took 275 ms [2018-04-11 17:18:13,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 963 treesize of output 1156 [2018-04-11 17:18:13,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:18:14,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 860 treesize of output 835 [2018-04-11 17:18:14,360 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:18:14,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 945 treesize of output 928 [2018-04-11 17:18:14,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:18:15,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1184 treesize of output 1175 [2018-04-11 17:18:15,227 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:18:15,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1763 treesize of output 1710 [2018-04-11 17:18:15,552 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:18:15,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2072 treesize of output 2071 [2018-04-11 17:18:15,818 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:18:16,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2675 treesize of output 2214 [2018-04-11 17:18:16,809 WARN L148 SmtUtils]: Spent 635ms on a formula simplification that was a NOOP. DAG size: 133 [2018-04-11 17:18:16,815 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 17:18:16,837 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:18:16,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:16,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:16,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:16,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:16,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:16,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:16,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:16,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:16,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:16,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:16,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:16,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:16,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:16,966 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:18:16,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:16,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,172 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:18:17,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:17,365 INFO L303 Elim1Store]: Index analysis took 527 ms [2018-04-11 17:18:17,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 10 select indices, 10 select index equivalence classes, 28 disjoint index pairs (out of 45 index pairs), introduced 2 new quantified variables, introduced 16 case distinctions, treesize of input 1713 treesize of output 1550 [2018-04-11 17:18:17,695 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-11 17:18:24,443 WARN L151 SmtUtils]: Spent 6706ms on a formula simplification. DAG size of input: 1375 DAG size of output 321 [2018-04-11 17:18:24,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,652 INFO L303 Elim1Store]: Index analysis took 207 ms [2018-04-11 17:18:24,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 42 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1003 treesize of output 1203 [2018-04-11 17:18:24,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,806 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:18:24,806 INFO L303 Elim1Store]: Index analysis took 144 ms [2018-04-11 17:18:24,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 60 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 708 treesize of output 1087 [2018-04-11 17:18:24,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:24,984 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:18:24,984 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:18:24,985 INFO L303 Elim1Store]: Index analysis took 172 ms [2018-04-11 17:18:24,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 72 disjoint index pairs (out of 55 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 714 treesize of output 1233 [2018-04-11 17:18:25,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,145 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:18:25,146 INFO L303 Elim1Store]: Index analysis took 145 ms [2018-04-11 17:18:25,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 85 disjoint index pairs (out of 66 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 770 treesize of output 1408 [2018-04-11 17:18:25,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,300 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:18:25,301 INFO L303 Elim1Store]: Index analysis took 146 ms [2018-04-11 17:18:25,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 99 disjoint index pairs (out of 78 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 861 treesize of output 1647 [2018-04-11 17:18:25,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,566 INFO L303 Elim1Store]: Index analysis took 255 ms [2018-04-11 17:18:25,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 115 disjoint index pairs (out of 91 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 974 treesize of output 1702 [2018-04-11 17:18:25,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,895 INFO L303 Elim1Store]: Index analysis took 317 ms [2018-04-11 17:18:25,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 15 select indices, 15 select index equivalence classes, 132 disjoint index pairs (out of 105 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 976 treesize of output 1820 [2018-04-11 17:18:25,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:25,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:18:26,339 INFO L303 Elim1Store]: Index analysis took 427 ms [2018-04-11 17:18:26,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 16 select indices, 16 select index equivalence classes, 150 disjoint index pairs (out of 120 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 978 treesize of output 1987 [2018-04-11 17:18:26,343 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 17:18:27,055 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:18:27,520 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. Received shutdown request... [2018-04-11 17:18:27,805 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 17:18:27,806 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 17:18:27,809 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 17:18:27,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 05:18:27 BoogieIcfgContainer [2018-04-11 17:18:27,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 17:18:27,809 INFO L168 Benchmark]: Toolchain (without parser) took 226374.69 ms. Allocated memory was 405.3 MB in the beginning and 652.2 MB in the end (delta: 246.9 MB). Free memory was 343.9 MB in the beginning and 546.5 MB in the end (delta: -202.6 MB). Peak memory consumption was 174.3 MB. Max. memory is 5.3 GB. [2018-04-11 17:18:27,810 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 405.3 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 17:18:27,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.74 ms. Allocated memory is still 405.3 MB. Free memory was 343.9 MB in the beginning and 331.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-04-11 17:18:27,810 INFO L168 Benchmark]: Boogie Preprocessor took 31.91 ms. Allocated memory is still 405.3 MB. Free memory was 331.8 MB in the beginning and 329.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-04-11 17:18:27,810 INFO L168 Benchmark]: RCFGBuilder took 385.87 ms. Allocated memory was 405.3 MB in the beginning and 580.9 MB in the end (delta: 175.6 MB). Free memory was 329.0 MB in the beginning and 531.2 MB in the end (delta: -202.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 5.3 GB. [2018-04-11 17:18:27,811 INFO L168 Benchmark]: TraceAbstraction took 225759.24 ms. Allocated memory was 580.9 MB in the beginning and 652.2 MB in the end (delta: 71.3 MB). Free memory was 531.2 MB in the beginning and 546.5 MB in the end (delta: -15.2 MB). Peak memory consumption was 186.0 MB. Max. memory is 5.3 GB. [2018-04-11 17:18:27,811 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 405.3 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.74 ms. Allocated memory is still 405.3 MB. Free memory was 343.9 MB in the beginning and 331.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.91 ms. Allocated memory is still 405.3 MB. Free memory was 331.8 MB in the beginning and 329.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 385.87 ms. Allocated memory was 405.3 MB in the beginning and 580.9 MB in the end (delta: 175.6 MB). Free memory was 329.0 MB in the beginning and 531.2 MB in the end (delta: -202.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 225759.24 ms. Allocated memory was 580.9 MB in the beginning and 652.2 MB in the end (delta: 71.3 MB). Free memory was 531.2 MB in the beginning and 546.5 MB in the end (delta: -15.2 MB). Peak memory consumption was 186.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 48). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 66). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 60). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 63). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 69). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 60). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 64). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 48). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 63). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 61). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 67). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 70). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 72). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 64). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 61). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 70). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 72). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 67). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 66). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 69). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 127 locations, 47 error locations. TIMEOUT Result, 225.7s OverallTime, 15 OverallIterations, 10 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1242 SDtfs, 566 SDslu, 7296 SDs, 0 SdLazy, 618 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 284 SyntacticMatches, 2 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 142 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 743 NumberOfCodeBlocks, 742 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 686 ConstructedInterpolants, 0 QuantifiedInterpolants, 44514 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1292 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 0/330 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_17-18-27-818.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_17-18-27-818.csv Completed graceful shutdown