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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/memsafety/test-0521_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:05:15,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:05:15,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:05:15,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:05:15,036 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:05:15,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:05:15,038 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:05:15,040 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:05:15,042 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:05:15,043 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:05:15,044 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:05:15,044 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:05:15,045 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:05:15,047 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:05:15,048 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:05:15,051 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:05:15,053 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:05:15,055 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:05:15,057 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:05:15,058 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:05:15,061 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:05:15,061 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:05:15,061 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:05:15,062 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:05:15,063 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:05:15,065 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:05:15,065 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:05:15,066 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:05:15,066 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:05:15,066 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:05:15,067 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:05:15,068 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 03:05:15,079 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:05:15,081 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:05:15,082 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:05:15,082 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:05:15,083 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:05:15,083 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:05:15,083 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:05:15,083 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:05:15,083 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:05:15,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:05:15,084 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:05:15,085 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:05:15,085 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:05:15,085 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:05:15,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:05:15,085 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:05:15,086 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:05:15,086 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:05:15,086 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:05:15,086 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:05:15,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:05:15,087 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:05:15,087 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:05:15,087 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:05:15,087 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:05:15,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:05:15,088 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:05:15,088 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:05:15,088 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:05:15,088 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:05:15,089 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:05:15,089 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:05:15,089 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:05:15,089 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:05:15,089 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:05:15,090 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:05:15,091 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:05:15,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:05:15,167 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:05:15,172 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:05:15,173 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:05:15,174 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:05:15,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0521_true-valid-memsafety.i [2018-01-25 03:05:15,385 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:05:15,391 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:05:15,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:05:15,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:05:15,398 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:05:15,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:05:15" (1/1) ... [2018-01-25 03:05:15,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a446621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:05:15, skipping insertion in model container [2018-01-25 03:05:15,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:05:15" (1/1) ... [2018-01-25 03:05:15,422 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:05:15,482 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:05:15,680 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:05:15,718 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:05:15,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:05:15 WrapperNode [2018-01-25 03:05:15,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:05:15,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:05:15,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:05:15,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:05:15,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:05:15" (1/1) ... [2018-01-25 03:05:15,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:05:15" (1/1) ... [2018-01-25 03:05:15,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:05:15" (1/1) ... [2018-01-25 03:05:15,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:05:15" (1/1) ... [2018-01-25 03:05:15,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:05:15" (1/1) ... [2018-01-25 03:05:15,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:05:15" (1/1) ... [2018-01-25 03:05:15,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:05:15" (1/1) ... [2018-01-25 03:05:15,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:05:15,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:05:15,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:05:15,807 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:05:15,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:05:15" (1/1) ... No working directory specified, using /storage/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-01-25 03:05:15,931 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:05:15,931 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:05:15,931 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:05:15,932 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:05:15,932 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:05:15,934 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:05:15,934 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:05:15,935 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:05:15,935 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:05:15,935 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:05:15,935 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:05:15,935 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-25 03:05:15,936 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:05:15,936 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:05:15,936 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:05:15,936 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:05:16,868 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:05:16,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:05:16 BoogieIcfgContainer [2018-01-25 03:05:16,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:05:16,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:05:16,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:05:16,873 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:05:16,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:05:15" (1/3) ... [2018-01-25 03:05:16,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db982c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:05:16, skipping insertion in model container [2018-01-25 03:05:16,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:05:15" (2/3) ... [2018-01-25 03:05:16,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db982c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:05:16, skipping insertion in model container [2018-01-25 03:05:16,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:05:16" (3/3) ... [2018-01-25 03:05:16,877 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0521_true-valid-memsafety.i [2018-01-25 03:05:16,884 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:05:16,891 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-01-25 03:05:16,949 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:05:16,949 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:05:16,949 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:05:16,949 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:05:16,949 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:05:16,950 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:05:16,950 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:05:16,950 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:05:16,950 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:05:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states. [2018-01-25 03:05:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 03:05:16,980 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:16,981 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:05:16,981 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:16,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2006593009, now seen corresponding path program 1 times [2018-01-25 03:05:16,986 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:17,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:17,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:17,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:17,040 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:17,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:17,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:17,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:05:17,113 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:17,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 03:05:17,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 03:05:17,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 03:05:17,211 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 2 states. [2018-01-25 03:05:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:17,259 INFO L93 Difference]: Finished difference Result 488 states and 562 transitions. [2018-01-25 03:05:17,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 03:05:17,261 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-01-25 03:05:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:17,278 INFO L225 Difference]: With dead ends: 488 [2018-01-25 03:05:17,278 INFO L226 Difference]: Without dead ends: 244 [2018-01-25 03:05:17,284 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 03:05:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-01-25 03:05:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-01-25 03:05:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-01-25 03:05:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 271 transitions. [2018-01-25 03:05:17,334 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 271 transitions. Word has length 10 [2018-01-25 03:05:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:17,335 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 271 transitions. [2018-01-25 03:05:17,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 03:05:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 271 transitions. [2018-01-25 03:05:17,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 03:05:17,335 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:17,336 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:05:17,336 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:17,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1287736010, now seen corresponding path program 1 times [2018-01-25 03:05:17,336 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:17,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:17,337 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:17,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:17,338 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:17,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:17,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:17,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:05:17,424 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:17,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:05:17,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:05:17,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:05:17,427 INFO L87 Difference]: Start difference. First operand 244 states and 271 transitions. Second operand 4 states. [2018-01-25 03:05:17,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:17,620 INFO L93 Difference]: Finished difference Result 773 states and 860 transitions. [2018-01-25 03:05:17,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:05:17,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-01-25 03:05:17,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:17,625 INFO L225 Difference]: With dead ends: 773 [2018-01-25 03:05:17,626 INFO L226 Difference]: Without dead ends: 561 [2018-01-25 03:05:17,628 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:05:17,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-01-25 03:05:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 256. [2018-01-25 03:05:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-01-25 03:05:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 285 transitions. [2018-01-25 03:05:17,651 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 285 transitions. Word has length 12 [2018-01-25 03:05:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:17,651 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 285 transitions. [2018-01-25 03:05:17,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:05:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 285 transitions. [2018-01-25 03:05:17,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 03:05:17,652 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:17,653 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:05:17,653 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:17,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1264312096, now seen corresponding path program 1 times [2018-01-25 03:05:17,653 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:17,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:17,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:17,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:17,655 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:17,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:17,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:17,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:05:17,702 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:17,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:05:17,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:05:17,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:05:17,703 INFO L87 Difference]: Start difference. First operand 256 states and 285 transitions. Second operand 4 states. [2018-01-25 03:05:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:18,321 INFO L93 Difference]: Finished difference Result 418 states and 466 transitions. [2018-01-25 03:05:18,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:05:18,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 03:05:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:18,325 INFO L225 Difference]: With dead ends: 418 [2018-01-25 03:05:18,325 INFO L226 Difference]: Without dead ends: 416 [2018-01-25 03:05:18,326 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:05:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-01-25 03:05:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 254. [2018-01-25 03:05:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-01-25 03:05:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 283 transitions. [2018-01-25 03:05:18,363 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 283 transitions. Word has length 13 [2018-01-25 03:05:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:18,363 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 283 transitions. [2018-01-25 03:05:18,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:05:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 283 transitions. [2018-01-25 03:05:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 03:05:18,364 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:18,365 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:05:18,365 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:18,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1264312095, now seen corresponding path program 1 times [2018-01-25 03:05:18,365 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:18,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:18,367 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:18,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:18,367 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:18,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:18,491 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:18,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:05:18,491 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:18,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:05:18,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:05:18,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:05:18,492 INFO L87 Difference]: Start difference. First operand 254 states and 283 transitions. Second operand 4 states. [2018-01-25 03:05:18,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:18,707 INFO L93 Difference]: Finished difference Result 351 states and 394 transitions. [2018-01-25 03:05:18,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:05:18,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 03:05:18,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:18,709 INFO L225 Difference]: With dead ends: 351 [2018-01-25 03:05:18,709 INFO L226 Difference]: Without dead ends: 349 [2018-01-25 03:05:18,710 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:05:18,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-01-25 03:05:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 252. [2018-01-25 03:05:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-01-25 03:05:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 281 transitions. [2018-01-25 03:05:18,725 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 281 transitions. Word has length 13 [2018-01-25 03:05:18,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:18,725 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 281 transitions. [2018-01-25 03:05:18,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:05:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 281 transitions. [2018-01-25 03:05:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:05:18,727 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:18,727 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:05:18,727 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:18,728 INFO L82 PathProgramCache]: Analyzing trace with hash 184691868, now seen corresponding path program 1 times [2018-01-25 03:05:18,728 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:18,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:18,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:18,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:18,729 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:18,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:18,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:18,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:05:18,815 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:18,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:05:18,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:05:18,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:05:18,816 INFO L87 Difference]: Start difference. First operand 252 states and 281 transitions. Second operand 5 states. [2018-01-25 03:05:18,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:18,992 INFO L93 Difference]: Finished difference Result 499 states and 558 transitions. [2018-01-25 03:05:18,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:05:18,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 03:05:18,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:18,997 INFO L225 Difference]: With dead ends: 499 [2018-01-25 03:05:18,997 INFO L226 Difference]: Without dead ends: 327 [2018-01-25 03:05:18,998 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:05:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-01-25 03:05:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 292. [2018-01-25 03:05:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-01-25 03:05:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 344 transitions. [2018-01-25 03:05:19,014 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 344 transitions. Word has length 20 [2018-01-25 03:05:19,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:19,014 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 344 transitions. [2018-01-25 03:05:19,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:05:19,015 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 344 transitions. [2018-01-25 03:05:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:05:19,015 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:19,016 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:05:19,016 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:19,016 INFO L82 PathProgramCache]: Analyzing trace with hash 415972895, now seen corresponding path program 1 times [2018-01-25 03:05:19,016 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:19,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:19,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:19,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:19,019 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:19,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:19,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:19,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:05:19,142 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:19,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:05:19,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:05:19,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:05:19,144 INFO L87 Difference]: Start difference. First operand 292 states and 344 transitions. Second operand 4 states. [2018-01-25 03:05:19,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:19,535 INFO L93 Difference]: Finished difference Result 456 states and 526 transitions. [2018-01-25 03:05:19,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:05:19,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-25 03:05:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:19,537 INFO L225 Difference]: With dead ends: 456 [2018-01-25 03:05:19,538 INFO L226 Difference]: Without dead ends: 454 [2018-01-25 03:05:19,538 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:05:19,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-01-25 03:05:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 290. [2018-01-25 03:05:19,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-01-25 03:05:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 342 transitions. [2018-01-25 03:05:19,549 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 342 transitions. Word has length 20 [2018-01-25 03:05:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:19,549 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 342 transitions. [2018-01-25 03:05:19,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:05:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 342 transitions. [2018-01-25 03:05:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:05:19,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:19,550 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:05:19,550 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:19,550 INFO L82 PathProgramCache]: Analyzing trace with hash 415972896, now seen corresponding path program 1 times [2018-01-25 03:05:19,550 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:19,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:19,551 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:19,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:19,551 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:19,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:19,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:19,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:05:19,605 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:19,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:05:19,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:05:19,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:05:19,606 INFO L87 Difference]: Start difference. First operand 290 states and 342 transitions. Second operand 4 states. [2018-01-25 03:05:19,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:19,814 INFO L93 Difference]: Finished difference Result 389 states and 454 transitions. [2018-01-25 03:05:19,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:05:19,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-25 03:05:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:19,817 INFO L225 Difference]: With dead ends: 389 [2018-01-25 03:05:19,817 INFO L226 Difference]: Without dead ends: 387 [2018-01-25 03:05:19,817 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:05:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-01-25 03:05:19,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 288. [2018-01-25 03:05:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-01-25 03:05:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 340 transitions. [2018-01-25 03:05:19,829 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 340 transitions. Word has length 20 [2018-01-25 03:05:19,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:19,829 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 340 transitions. [2018-01-25 03:05:19,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:05:19,830 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 340 transitions. [2018-01-25 03:05:19,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:05:19,830 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:19,831 INFO L322 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] [2018-01-25 03:05:19,831 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:19,831 INFO L82 PathProgramCache]: Analyzing trace with hash 308407885, now seen corresponding path program 1 times [2018-01-25 03:05:19,831 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:19,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:19,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:19,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:19,833 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:19,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:19,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:19,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:05:19,890 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:19,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:05:19,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:05:19,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:05:19,891 INFO L87 Difference]: Start difference. First operand 288 states and 340 transitions. Second operand 5 states. [2018-01-25 03:05:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:20,068 INFO L93 Difference]: Finished difference Result 408 states and 471 transitions. [2018-01-25 03:05:20,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:05:20,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-25 03:05:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:20,070 INFO L225 Difference]: With dead ends: 408 [2018-01-25 03:05:20,071 INFO L226 Difference]: Without dead ends: 319 [2018-01-25 03:05:20,071 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:05:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-01-25 03:05:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 275. [2018-01-25 03:05:20,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-01-25 03:05:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 307 transitions. [2018-01-25 03:05:20,081 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 307 transitions. Word has length 23 [2018-01-25 03:05:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:20,082 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 307 transitions. [2018-01-25 03:05:20,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:05:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 307 transitions. [2018-01-25 03:05:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:05:20,083 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:20,083 INFO L322 BasicCegarLoop]: trace histogram [2, 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] [2018-01-25 03:05:20,083 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:20,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1728935830, now seen corresponding path program 1 times [2018-01-25 03:05:20,084 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:20,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:20,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:20,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:20,085 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:20,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:20,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:20,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:05:20,145 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:20,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:05:20,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:05:20,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:05:20,147 INFO L87 Difference]: Start difference. First operand 275 states and 307 transitions. Second operand 5 states. [2018-01-25 03:05:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:20,627 INFO L93 Difference]: Finished difference Result 460 states and 514 transitions. [2018-01-25 03:05:20,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:05:20,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-25 03:05:20,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:20,630 INFO L225 Difference]: With dead ends: 460 [2018-01-25 03:05:20,630 INFO L226 Difference]: Without dead ends: 457 [2018-01-25 03:05:20,630 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:05:20,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-01-25 03:05:20,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 276. [2018-01-25 03:05:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-01-25 03:05:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 310 transitions. [2018-01-25 03:05:20,647 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 310 transitions. Word has length 28 [2018-01-25 03:05:20,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:20,648 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 310 transitions. [2018-01-25 03:05:20,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:05:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 310 transitions. [2018-01-25 03:05:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:05:20,649 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:20,649 INFO L322 BasicCegarLoop]: trace histogram [2, 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] [2018-01-25 03:05:20,649 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:20,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1728935829, now seen corresponding path program 1 times [2018-01-25 03:05:20,650 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:20,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:20,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:20,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:20,652 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:20,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:20,909 WARN L143 SmtUtils]: Spent 107ms on a formula simplification that was a NOOP. DAG size: 9 [2018-01-25 03:05:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:21,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:21,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:05:21,056 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:21,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:05:21,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:05:21,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:05:21,057 INFO L87 Difference]: Start difference. First operand 276 states and 310 transitions. Second operand 6 states. [2018-01-25 03:05:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:21,617 INFO L93 Difference]: Finished difference Result 388 states and 438 transitions. [2018-01-25 03:05:21,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:05:21,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-25 03:05:21,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:21,619 INFO L225 Difference]: With dead ends: 388 [2018-01-25 03:05:21,620 INFO L226 Difference]: Without dead ends: 387 [2018-01-25 03:05:21,620 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:05:21,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-01-25 03:05:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 275. [2018-01-25 03:05:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-01-25 03:05:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 309 transitions. [2018-01-25 03:05:21,631 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 309 transitions. Word has length 28 [2018-01-25 03:05:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:21,632 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 309 transitions. [2018-01-25 03:05:21,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:05:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 309 transitions. [2018-01-25 03:05:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:05:21,644 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:21,644 INFO L322 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-01-25 03:05:21,644 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:21,645 INFO L82 PathProgramCache]: Analyzing trace with hash -887445228, now seen corresponding path program 1 times [2018-01-25 03:05:21,645 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:21,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:21,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:21,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:21,646 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:21,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:21,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:21,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:05:21,701 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:21,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:05:21,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:05:21,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:05:21,702 INFO L87 Difference]: Start difference. First operand 275 states and 309 transitions. Second operand 3 states. [2018-01-25 03:05:22,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:22,000 INFO L93 Difference]: Finished difference Result 279 states and 312 transitions. [2018-01-25 03:05:22,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:05:22,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-01-25 03:05:22,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:22,002 INFO L225 Difference]: With dead ends: 279 [2018-01-25 03:05:22,002 INFO L226 Difference]: Without dead ends: 255 [2018-01-25 03:05:22,003 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:05:22,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-25 03:05:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2018-01-25 03:05:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-01-25 03:05:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2018-01-25 03:05:22,010 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 30 [2018-01-25 03:05:22,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:22,011 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2018-01-25 03:05:22,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:05:22,011 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2018-01-25 03:05:22,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 03:05:22,012 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:22,012 INFO L322 BasicCegarLoop]: trace histogram [2, 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] [2018-01-25 03:05:22,012 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:22,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1380917583, now seen corresponding path program 1 times [2018-01-25 03:05:22,013 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:22,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:22,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:22,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:22,014 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:22,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:22,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:22,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 03:05:22,196 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:22,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 03:05:22,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 03:05:22,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:05:22,197 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand 12 states. [2018-01-25 03:05:24,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:24,535 INFO L93 Difference]: Finished difference Result 1031 states and 1163 transitions. [2018-01-25 03:05:24,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 03:05:24,535 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-01-25 03:05:24,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:24,540 INFO L225 Difference]: With dead ends: 1031 [2018-01-25 03:05:24,541 INFO L226 Difference]: Without dead ends: 1030 [2018-01-25 03:05:24,542 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2018-01-25 03:05:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-01-25 03:05:24,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 253. [2018-01-25 03:05:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-01-25 03:05:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 284 transitions. [2018-01-25 03:05:24,555 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 284 transitions. Word has length 32 [2018-01-25 03:05:24,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:24,555 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 284 transitions. [2018-01-25 03:05:24,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 03:05:24,555 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 284 transitions. [2018-01-25 03:05:24,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 03:05:24,556 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:24,557 INFO L322 BasicCegarLoop]: trace histogram [2, 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] [2018-01-25 03:05:24,557 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:24,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1380917584, now seen corresponding path program 1 times [2018-01-25 03:05:24,557 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:24,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:24,558 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:24,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:24,559 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:24,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:24,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:24,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 03:05:24,802 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:24,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 03:05:24,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 03:05:24,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:05:24,804 INFO L87 Difference]: Start difference. First operand 253 states and 284 transitions. Second operand 11 states. [2018-01-25 03:05:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:27,227 INFO L93 Difference]: Finished difference Result 1176 states and 1332 transitions. [2018-01-25 03:05:27,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-25 03:05:27,227 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-01-25 03:05:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:27,231 INFO L225 Difference]: With dead ends: 1176 [2018-01-25 03:05:27,232 INFO L226 Difference]: Without dead ends: 1175 [2018-01-25 03:05:27,233 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2018-01-25 03:05:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2018-01-25 03:05:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 252. [2018-01-25 03:05:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-01-25 03:05:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2018-01-25 03:05:27,248 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 32 [2018-01-25 03:05:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:27,248 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2018-01-25 03:05:27,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 03:05:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2018-01-25 03:05:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 03:05:27,249 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:27,250 INFO L322 BasicCegarLoop]: trace histogram [2, 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, 1, 1] [2018-01-25 03:05:27,250 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:27,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1718989974, now seen corresponding path program 1 times [2018-01-25 03:05:27,250 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:27,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:27,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:27,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:27,251 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:27,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 03:05:27,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:27,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:05:27,310 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:27,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:05:27,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:05:27,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:05:27,311 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand 4 states. [2018-01-25 03:05:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:27,568 INFO L93 Difference]: Finished difference Result 777 states and 874 transitions. [2018-01-25 03:05:27,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:05:27,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-25 03:05:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:27,571 INFO L225 Difference]: With dead ends: 777 [2018-01-25 03:05:27,571 INFO L226 Difference]: Without dead ends: 775 [2018-01-25 03:05:27,572 INFO L525 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-01-25 03:05:27,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2018-01-25 03:05:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 250. [2018-01-25 03:05:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-01-25 03:05:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 281 transitions. [2018-01-25 03:05:27,580 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 281 transitions. Word has length 35 [2018-01-25 03:05:27,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:27,580 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 281 transitions. [2018-01-25 03:05:27,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:05:27,581 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 281 transitions. [2018-01-25 03:05:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 03:05:27,581 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:27,581 INFO L322 BasicCegarLoop]: trace histogram [2, 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, 1, 1] [2018-01-25 03:05:27,581 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:27,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1718989975, now seen corresponding path program 1 times [2018-01-25 03:05:27,582 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:27,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:27,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:27,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:27,583 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:27,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:27,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:27,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:05:27,752 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:27,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:05:27,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:05:27,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:05:27,753 INFO L87 Difference]: Start difference. First operand 250 states and 281 transitions. Second operand 6 states. [2018-01-25 03:05:28,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:28,400 INFO L93 Difference]: Finished difference Result 476 states and 543 transitions. [2018-01-25 03:05:28,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:05:28,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-25 03:05:28,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:28,402 INFO L225 Difference]: With dead ends: 476 [2018-01-25 03:05:28,402 INFO L226 Difference]: Without dead ends: 474 [2018-01-25 03:05:28,402 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:05:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-01-25 03:05:28,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 256. [2018-01-25 03:05:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-01-25 03:05:28,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 292 transitions. [2018-01-25 03:05:28,412 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 292 transitions. Word has length 35 [2018-01-25 03:05:28,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:28,412 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 292 transitions. [2018-01-25 03:05:28,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:05:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 292 transitions. [2018-01-25 03:05:28,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 03:05:28,413 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:28,413 INFO L322 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2018-01-25 03:05:28,414 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:28,414 INFO L82 PathProgramCache]: Analyzing trace with hash 320441296, now seen corresponding path program 1 times [2018-01-25 03:05:28,415 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:28,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:28,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:28,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:28,416 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:28,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:28,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:28,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:05:28,661 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:28,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:05:28,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:05:28,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:05:28,662 INFO L87 Difference]: Start difference. First operand 256 states and 292 transitions. Second operand 6 states. [2018-01-25 03:05:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:28,731 INFO L93 Difference]: Finished difference Result 641 states and 718 transitions. [2018-01-25 03:05:28,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:05:28,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-25 03:05:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:28,733 INFO L225 Difference]: With dead ends: 641 [2018-01-25 03:05:28,733 INFO L226 Difference]: Without dead ends: 453 [2018-01-25 03:05:28,733 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:05:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-01-25 03:05:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 254. [2018-01-25 03:05:28,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-01-25 03:05:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 287 transitions. [2018-01-25 03:05:28,744 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 287 transitions. Word has length 36 [2018-01-25 03:05:28,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:28,744 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 287 transitions. [2018-01-25 03:05:28,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:05:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 287 transitions. [2018-01-25 03:05:28,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 03:05:28,745 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:28,745 INFO L322 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2018-01-25 03:05:28,745 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:28,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1534000121, now seen corresponding path program 1 times [2018-01-25 03:05:28,745 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:28,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:28,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:28,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:28,747 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:28,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:29,453 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 24 DAG size of output 20 [2018-01-25 03:05:29,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:29,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:05:29,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-25 03:05:29,574 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:05:29,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 03:05:29,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 03:05:29,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:05:29,575 INFO L87 Difference]: Start difference. First operand 254 states and 287 transitions. Second operand 16 states. [2018-01-25 03:05:30,069 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 66 DAG size of output 54 [2018-01-25 03:05:31,373 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 93 DAG size of output 81 [2018-01-25 03:05:31,823 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 89 DAG size of output 77 [2018-01-25 03:05:32,253 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 73 DAG size of output 63 [2018-01-25 03:05:32,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:05:32,957 INFO L93 Difference]: Finished difference Result 896 states and 1011 transitions. [2018-01-25 03:05:32,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-25 03:05:32,957 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-01-25 03:05:32,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:05:32,959 INFO L225 Difference]: With dead ends: 896 [2018-01-25 03:05:32,959 INFO L226 Difference]: Without dead ends: 685 [2018-01-25 03:05:32,961 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=401, Invalid=1159, Unknown=0, NotChecked=0, Total=1560 [2018-01-25 03:05:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-01-25 03:05:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 247. [2018-01-25 03:05:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-01-25 03:05:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 275 transitions. [2018-01-25 03:05:32,968 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 275 transitions. Word has length 38 [2018-01-25 03:05:32,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:05:32,969 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 275 transitions. [2018-01-25 03:05:32,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 03:05:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 275 transitions. [2018-01-25 03:05:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 03:05:32,969 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:05:32,969 INFO L322 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2018-01-25 03:05:32,969 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr85RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr76RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr83RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr87RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr81RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr90EnsuresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr88RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:05:32,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1535290008, now seen corresponding path program 1 times [2018-01-25 03:05:32,970 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:05:32,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:32,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:05:32,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:05:32,970 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:05:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:05:32,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:05:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:05:33,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:05:33,367 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:05:33,369 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-25 03:05:33,370 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [12], [13], [18], [20], [23], [24], [27], [28], [29], [34], [36], [39], [42], [46], [49], [50], [53], [57], [62], [63], [66], [71], [72], [75], [78], [80], [429], [430], [434], [435], [436] [2018-01-25 03:05:33,423 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:05:33,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 03:06:12,636 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 03:06:12,637 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 03:06:12,638 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:06:12,638 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:06:12,638 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:06:12,645 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:06:12,645 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:06:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:06:12,717 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:06:12,768 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 03:06:12,768 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 03:06:12,780 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 03:06:12,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:06:12 BoogieIcfgContainer [2018-01-25 03:06:12,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:06:12,782 INFO L168 Benchmark]: Toolchain (without parser) took 57395.80 ms. Allocated memory was 308.8 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 267.7 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 432.4 MB. Max. memory is 5.3 GB. [2018-01-25 03:06:12,784 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 308.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:06:12,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.33 ms. Allocated memory is still 308.8 MB. Free memory was 267.7 MB in the beginning and 255.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:06:12,785 INFO L168 Benchmark]: Boogie Preprocessor took 75.36 ms. Allocated memory is still 308.8 MB. Free memory was 255.8 MB in the beginning and 251.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:06:12,785 INFO L168 Benchmark]: RCFGBuilder took 1062.40 ms. Allocated memory is still 308.8 MB. Free memory was 251.8 MB in the beginning and 194.4 MB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 5.3 GB. [2018-01-25 03:06:12,786 INFO L168 Benchmark]: TraceAbstraction took 55910.89 ms. Allocated memory was 308.8 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 194.4 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 359.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:06:12,789 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.24 ms. Allocated memory is still 308.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 338.33 ms. Allocated memory is still 308.8 MB. Free memory was 267.7 MB in the beginning and 255.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 75.36 ms. Allocated memory is still 308.8 MB. Free memory was 255.8 MB in the beginning and 251.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1062.40 ms. Allocated memory is still 308.8 MB. Free memory was 251.8 MB in the beginning and 194.4 MB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55910.89 ms. Allocated memory was 308.8 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 194.4 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 359.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 713). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 741). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 733). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 693). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 771). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 757). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 712). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 702). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 721). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 713). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 773). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 704). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 708). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 761). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 721). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 760). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 696). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 708). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 760). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 708). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 713). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 704). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 771). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 704). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 773). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 702). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 774). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 715). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 761). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 713). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 745). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 770). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 696). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 714). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 741). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 708). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 757). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 693). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 770). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 733). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 714). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 704). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 774). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 712). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 745). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 247 locations, 91 error locations. TIMEOUT Result, 55.8s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 12.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4641 SDtfs, 12980 SDslu, 11588 SDs, 0 SdLazy, 6938 SolverSat, 324 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 39.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 4280 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 66095 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 24/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0521_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-06-12-805.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0521_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-06-12-805.csv Completed graceful shutdown