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.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_dsw_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:37:58,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:37:59,000 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:37:59,015 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:37:59,015 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:37:59,016 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:37:59,017 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:37:59,018 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:37:59,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:37:59,020 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:37:59,021 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:37:59,021 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:37:59,023 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:37:59,024 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:37:59,025 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:37:59,028 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:37:59,030 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:37:59,032 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:37:59,034 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:37:59,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:37:59,038 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:37:59,038 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:37:59,038 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:37:59,039 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:37:59,040 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:37:59,042 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:37:59,042 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:37:59,043 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:37:59,043 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:37:59,043 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:37:59,044 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:37:59,044 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.epf [2018-01-24 15:37:59,054 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:37:59,054 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:37:59,055 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:37:59,056 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:37:59,056 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:37:59,056 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:37:59,056 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:37:59,057 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:37:59,057 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:37:59,057 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:37:59,058 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:37:59,058 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:37:59,058 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:37:59,058 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:37:59,058 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:37:59,059 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:37:59,059 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:37:59,059 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:37:59,059 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:37:59,059 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:37:59,060 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:37:59,060 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:37:59,060 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:37:59,060 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:37:59,060 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:37:59,061 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:37:59,061 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:37:59,061 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:37:59,061 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:37:59,061 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:37:59,062 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:37:59,062 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:37:59,062 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:37:59,063 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:37:59,063 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:37:59,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:37:59,113 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:37:59,118 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:37:59,120 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:37:59,120 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:37:59,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_dsw_true-valid-memsafety_false-termination.i [2018-01-24 15:37:59,298 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:37:59,305 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:37:59,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:37:59,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:37:59,312 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:37:59,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:37:59" (1/1) ... [2018-01-24 15:37:59,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53cecf25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:37:59, skipping insertion in model container [2018-01-24 15:37:59,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:37:59" (1/1) ... [2018-01-24 15:37:59,336 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:37:59,378 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:37:59,510 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:37:59,533 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:37:59,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:37:59 WrapperNode [2018-01-24 15:37:59,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:37:59,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:37:59,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:37:59,546 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:37:59,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:37:59" (1/1) ... [2018-01-24 15:37:59,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:37:59" (1/1) ... [2018-01-24 15:37:59,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:37:59" (1/1) ... [2018-01-24 15:37:59,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:37:59" (1/1) ... [2018-01-24 15:37:59,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:37:59" (1/1) ... [2018-01-24 15:37:59,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:37:59" (1/1) ... [2018-01-24 15:37:59,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:37:59" (1/1) ... [2018-01-24 15:37:59,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:37:59,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:37:59,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:37:59,588 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:37:59,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:37:59" (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-24 15:37:59,632 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:37:59,633 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:37:59,633 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:37:59,633 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 15:37:59,633 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 15:37:59,633 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:37:59,633 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:37:59,634 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:37:59,634 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:37:59,634 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 15:37:59,634 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 15:37:59,634 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:37:59,634 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:37:59,635 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:38:00,239 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:38:00,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:38:00 BoogieIcfgContainer [2018-01-24 15:38:00,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:38:00,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:38:00,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:38:00,243 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:38:00,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:37:59" (1/3) ... [2018-01-24 15:38:00,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e59b074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:38:00, skipping insertion in model container [2018-01-24 15:38:00,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:37:59" (2/3) ... [2018-01-24 15:38:00,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e59b074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:38:00, skipping insertion in model container [2018-01-24 15:38:00,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:38:00" (3/3) ... [2018-01-24 15:38:00,246 INFO L105 eAbstractionObserver]: Analyzing ICFG tree_dsw_true-valid-memsafety_false-termination.i [2018-01-24 15:38:00,253 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:38:00,260 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-01-24 15:38:00,304 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:38:00,305 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:38:00,305 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:38:00,305 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:38:00,305 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:38:00,305 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:38:00,305 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:38:00,306 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:38:00,306 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:38:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2018-01-24 15:38:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 15:38:00,340 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:38:00,341 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:38:00,342 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 15:38:00,347 INFO L82 PathProgramCache]: Analyzing trace with hash -985735074, now seen corresponding path program 1 times [2018-01-24 15:38:00,350 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:38:00,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:00,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:38:00,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:00,412 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:38:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:38:00,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:38:00,540 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-24 15:38:00,542 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:38:00,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:38:00,543 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:38:00,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:38:00,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:38:00,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:38:00,564 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 4 states. [2018-01-24 15:38:00,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:38:00,937 INFO L93 Difference]: Finished difference Result 348 states and 384 transitions. [2018-01-24 15:38:00,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:38:00,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 15:38:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:38:00,953 INFO L225 Difference]: With dead ends: 348 [2018-01-24 15:38:00,954 INFO L226 Difference]: Without dead ends: 183 [2018-01-24 15:38:00,958 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-24 15:38:00,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-24 15:38:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2018-01-24 15:38:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-24 15:38:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2018-01-24 15:38:01,000 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 8 [2018-01-24 15:38:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:38:01,001 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2018-01-24 15:38:01,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:38:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2018-01-24 15:38:01,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 15:38:01,001 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:38:01,002 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:38:01,002 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 15:38:01,002 INFO L82 PathProgramCache]: Analyzing trace with hash -985735073, now seen corresponding path program 1 times [2018-01-24 15:38:01,002 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:38:01,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:01,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:38:01,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:01,003 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:38:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:38:01,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:38:01,102 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-24 15:38:01,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:38:01,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:38:01,103 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:38:01,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:38:01,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:38:01,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:38:01,105 INFO L87 Difference]: Start difference. First operand 168 states and 181 transitions. Second operand 4 states. [2018-01-24 15:38:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:38:01,330 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2018-01-24 15:38:01,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:38:01,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 15:38:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:38:01,333 INFO L225 Difference]: With dead ends: 168 [2018-01-24 15:38:01,333 INFO L226 Difference]: Without dead ends: 166 [2018-01-24 15:38:01,334 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-24 15:38:01,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-24 15:38:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-01-24 15:38:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-01-24 15:38:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2018-01-24 15:38:01,349 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 8 [2018-01-24 15:38:01,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:38:01,350 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2018-01-24 15:38:01,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:38:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2018-01-24 15:38:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:38:01,350 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:38:01,351 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:38:01,351 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 15:38:01,351 INFO L82 PathProgramCache]: Analyzing trace with hash 473226571, now seen corresponding path program 1 times [2018-01-24 15:38:01,351 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:38:01,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:01,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:38:01,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:01,353 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:38:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:38:01,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:38:01,416 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-24 15:38:01,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:38:01,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:38:01,417 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:38:01,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:38:01,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:38:01,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:38:01,418 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand 4 states. [2018-01-24 15:38:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:38:01,615 INFO L93 Difference]: Finished difference Result 200 states and 217 transitions. [2018-01-24 15:38:01,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:38:01,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 15:38:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:38:01,618 INFO L225 Difference]: With dead ends: 200 [2018-01-24 15:38:01,618 INFO L226 Difference]: Without dead ends: 180 [2018-01-24 15:38:01,618 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-24 15:38:01,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-24 15:38:01,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 153. [2018-01-24 15:38:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-24 15:38:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2018-01-24 15:38:01,629 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 14 [2018-01-24 15:38:01,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:38:01,629 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2018-01-24 15:38:01,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:38:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2018-01-24 15:38:01,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:38:01,630 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:38:01,630 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:38:01,630 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 15:38:01,630 INFO L82 PathProgramCache]: Analyzing trace with hash 473226572, now seen corresponding path program 1 times [2018-01-24 15:38:01,630 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:38:01,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:01,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:38:01,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:01,632 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:38:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:38:01,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:38:01,722 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-24 15:38:01,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:38:01,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:38:01,723 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:38:01,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:38:01,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:38:01,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:38:01,724 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand 5 states. [2018-01-24 15:38:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:38:01,941 INFO L93 Difference]: Finished difference Result 227 states and 250 transitions. [2018-01-24 15:38:01,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:38:01,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 15:38:01,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:38:01,944 INFO L225 Difference]: With dead ends: 227 [2018-01-24 15:38:01,945 INFO L226 Difference]: Without dead ends: 211 [2018-01-24 15:38:01,945 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-24 15:38:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-24 15:38:01,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 188. [2018-01-24 15:38:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-24 15:38:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 215 transitions. [2018-01-24 15:38:01,962 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 215 transitions. Word has length 14 [2018-01-24 15:38:01,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:38:01,962 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 215 transitions. [2018-01-24 15:38:01,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:38:01,963 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2018-01-24 15:38:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 15:38:01,963 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:38:01,964 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:38:01,964 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 15:38:01,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1727604301, now seen corresponding path program 1 times [2018-01-24 15:38:01,964 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:38:01,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:01,965 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:38:01,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:01,966 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:38:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:38:01,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:38:02,050 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-24 15:38:02,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:38:02,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:38:02,050 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:38:02,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:38:02,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:38:02,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:38:02,051 INFO L87 Difference]: Start difference. First operand 188 states and 215 transitions. Second operand 7 states. [2018-01-24 15:38:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:38:02,226 INFO L93 Difference]: Finished difference Result 310 states and 342 transitions. [2018-01-24 15:38:02,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:38:02,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-24 15:38:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:38:02,228 INFO L225 Difference]: With dead ends: 310 [2018-01-24 15:38:02,228 INFO L226 Difference]: Without dead ends: 249 [2018-01-24 15:38:02,229 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:38:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-01-24 15:38:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 189. [2018-01-24 15:38:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-24 15:38:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 216 transitions. [2018-01-24 15:38:02,238 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 216 transitions. Word has length 18 [2018-01-24 15:38:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:38:02,238 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 216 transitions. [2018-01-24 15:38:02,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:38:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 216 transitions. [2018-01-24 15:38:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 15:38:02,239 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:38:02,239 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] [2018-01-24 15:38:02,239 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 15:38:02,240 INFO L82 PathProgramCache]: Analyzing trace with hash 471570443, now seen corresponding path program 1 times [2018-01-24 15:38:02,240 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:38:02,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:02,241 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:38:02,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:02,241 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:38:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:38:02,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:38:02,279 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-24 15:38:02,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:38:02,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:38:02,279 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:38:02,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:38:02,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:38:02,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:38:02,280 INFO L87 Difference]: Start difference. First operand 189 states and 216 transitions. Second operand 5 states. [2018-01-24 15:38:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:38:02,447 INFO L93 Difference]: Finished difference Result 266 states and 295 transitions. [2018-01-24 15:38:02,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:38:02,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-24 15:38:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:38:02,449 INFO L225 Difference]: With dead ends: 266 [2018-01-24 15:38:02,449 INFO L226 Difference]: Without dead ends: 207 [2018-01-24 15:38:02,449 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:38:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-24 15:38:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 188. [2018-01-24 15:38:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-24 15:38:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 214 transitions. [2018-01-24 15:38:02,457 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 214 transitions. Word has length 21 [2018-01-24 15:38:02,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:38:02,457 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 214 transitions. [2018-01-24 15:38:02,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:38:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 214 transitions. [2018-01-24 15:38:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 15:38:02,458 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:38:02,458 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:38:02,458 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 15:38:02,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1608607228, now seen corresponding path program 1 times [2018-01-24 15:38:02,458 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:38:02,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:02,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:38:02,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:02,459 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:38:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:38:02,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:38:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:38:02,493 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:38:02,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:38:02,493 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:38:02,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:38:02,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:38:02,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:38:02,494 INFO L87 Difference]: Start difference. First operand 188 states and 214 transitions. Second operand 3 states. [2018-01-24 15:38:02,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:38:02,514 INFO L93 Difference]: Finished difference Result 369 states and 423 transitions. [2018-01-24 15:38:02,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:38:02,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-24 15:38:02,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:38:02,516 INFO L225 Difference]: With dead ends: 369 [2018-01-24 15:38:02,516 INFO L226 Difference]: Without dead ends: 190 [2018-01-24 15:38:02,517 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:38:02,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-24 15:38:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-01-24 15:38:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-01-24 15:38:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2018-01-24 15:38:02,525 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 22 [2018-01-24 15:38:02,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:38:02,525 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2018-01-24 15:38:02,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:38:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2018-01-24 15:38:02,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:38:02,526 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:38:02,527 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:38:02,527 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 15:38:02,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1343010439, now seen corresponding path program 1 times [2018-01-24 15:38:02,527 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:38:02,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:02,528 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:38:02,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:02,528 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:38:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:38:02,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:38:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:38:02,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:38:02,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:38:02,704 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:38:02,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:38:02,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:38:02,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:38:02,705 INFO L87 Difference]: Start difference. First operand 190 states and 216 transitions. Second operand 6 states. [2018-01-24 15:38:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:38:02,945 INFO L93 Difference]: Finished difference Result 419 states and 479 transitions. [2018-01-24 15:38:02,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:38:02,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 15:38:02,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:38:02,946 INFO L225 Difference]: With dead ends: 419 [2018-01-24 15:38:02,946 INFO L226 Difference]: Without dead ends: 238 [2018-01-24 15:38:02,948 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:38:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-24 15:38:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 206. [2018-01-24 15:38:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-24 15:38:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 237 transitions. [2018-01-24 15:38:02,959 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 237 transitions. Word has length 24 [2018-01-24 15:38:02,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:38:02,959 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 237 transitions. [2018-01-24 15:38:02,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:38:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 237 transitions. [2018-01-24 15:38:02,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 15:38:02,960 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:38:02,960 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] [2018-01-24 15:38:02,961 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 15:38:02,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1202174280, now seen corresponding path program 1 times [2018-01-24 15:38:02,961 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:38:02,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:02,962 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:38:02,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:02,962 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:38:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:38:02,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:38:03,010 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-24 15:38:03,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:38:03,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:38:03,011 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:38:03,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:38:03,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:38:03,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:38:03,012 INFO L87 Difference]: Start difference. First operand 206 states and 237 transitions. Second operand 5 states. [2018-01-24 15:38:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:38:03,328 INFO L93 Difference]: Finished difference Result 332 states and 384 transitions. [2018-01-24 15:38:03,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:38:03,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 15:38:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:38:03,331 INFO L225 Difference]: With dead ends: 332 [2018-01-24 15:38:03,331 INFO L226 Difference]: Without dead ends: 331 [2018-01-24 15:38:03,331 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-24 15:38:03,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-01-24 15:38:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 205. [2018-01-24 15:38:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-01-24 15:38:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2018-01-24 15:38:03,343 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 25 [2018-01-24 15:38:03,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:38:03,343 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2018-01-24 15:38:03,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:38:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2018-01-24 15:38:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 15:38:03,345 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:38:03,345 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] [2018-01-24 15:38:03,345 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 15:38:03,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1202174281, now seen corresponding path program 1 times [2018-01-24 15:38:03,345 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:38:03,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:03,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:38:03,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:03,347 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:38:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:38:03,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:38:03,442 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-24 15:38:03,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:38:03,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:38:03,443 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:38:03,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:38:03,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:38:03,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:38:03,444 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand 5 states. [2018-01-24 15:38:03,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:38:03,790 INFO L93 Difference]: Finished difference Result 365 states and 417 transitions. [2018-01-24 15:38:03,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:38:03,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 15:38:03,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:38:03,792 INFO L225 Difference]: With dead ends: 365 [2018-01-24 15:38:03,792 INFO L226 Difference]: Without dead ends: 364 [2018-01-24 15:38:03,793 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-24 15:38:03,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-01-24 15:38:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 204. [2018-01-24 15:38:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-24 15:38:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 233 transitions. [2018-01-24 15:38:03,802 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 233 transitions. Word has length 25 [2018-01-24 15:38:03,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:38:03,802 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 233 transitions. [2018-01-24 15:38:03,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:38:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 233 transitions. [2018-01-24 15:38:03,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 15:38:03,803 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:38:03,803 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] [2018-01-24 15:38:03,804 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 15:38:03,804 INFO L82 PathProgramCache]: Analyzing trace with hash -2086605704, now seen corresponding path program 1 times [2018-01-24 15:38:03,804 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:38:03,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:03,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:38:03,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:03,806 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:38:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:38:03,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:38:03,877 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-24 15:38:03,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:38:03,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:38:03,878 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:38:03,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:38:03,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:38:03,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:38:03,879 INFO L87 Difference]: Start difference. First operand 204 states and 233 transitions. Second operand 4 states. [2018-01-24 15:38:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:38:04,078 INFO L93 Difference]: Finished difference Result 251 states and 284 transitions. [2018-01-24 15:38:04,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:38:04,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 15:38:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:38:04,080 INFO L225 Difference]: With dead ends: 251 [2018-01-24 15:38:04,080 INFO L226 Difference]: Without dead ends: 250 [2018-01-24 15:38:04,080 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:38:04,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-24 15:38:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 207. [2018-01-24 15:38:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-01-24 15:38:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 238 transitions. [2018-01-24 15:38:04,091 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 238 transitions. Word has length 27 [2018-01-24 15:38:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:38:04,091 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 238 transitions. [2018-01-24 15:38:04,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:38:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 238 transitions. [2018-01-24 15:38:04,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 15:38:04,092 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:38:04,093 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] [2018-01-24 15:38:04,093 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 15:38:04,093 INFO L82 PathProgramCache]: Analyzing trace with hash -2086605703, now seen corresponding path program 1 times [2018-01-24 15:38:04,093 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:38:04,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:04,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:38:04,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:04,094 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:38:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:38:04,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:38:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 15:38:04,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:38:04,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:38:04,263 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:38:04,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:38:04,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:38:04,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:38:04,264 INFO L87 Difference]: Start difference. First operand 207 states and 238 transitions. Second operand 8 states. [2018-01-24 15:38:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:38:04,811 INFO L93 Difference]: Finished difference Result 321 states and 357 transitions. [2018-01-24 15:38:04,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:38:04,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-01-24 15:38:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:38:04,813 INFO L225 Difference]: With dead ends: 321 [2018-01-24 15:38:04,814 INFO L226 Difference]: Without dead ends: 317 [2018-01-24 15:38:04,814 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:38:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-01-24 15:38:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 211. [2018-01-24 15:38:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-24 15:38:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 244 transitions. [2018-01-24 15:38:04,822 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 244 transitions. Word has length 27 [2018-01-24 15:38:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:38:04,823 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 244 transitions. [2018-01-24 15:38:04,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:38:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 244 transitions. [2018-01-24 15:38:04,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 15:38:04,823 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:38:04,824 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] [2018-01-24 15:38:04,824 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 15:38:04,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2086546122, now seen corresponding path program 1 times [2018-01-24 15:38:04,824 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:38:04,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:04,825 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:38:04,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:04,825 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:38:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:38:04,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:38:05,167 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-24 15:38:05,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:38:05,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:38:05,168 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:38:05,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:38:05,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:38:05,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:38:05,168 INFO L87 Difference]: Start difference. First operand 211 states and 244 transitions. Second operand 7 states. [2018-01-24 15:38:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:38:05,570 INFO L93 Difference]: Finished difference Result 423 states and 470 transitions. [2018-01-24 15:38:05,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:38:05,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-24 15:38:05,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:38:05,571 INFO L225 Difference]: With dead ends: 423 [2018-01-24 15:38:05,571 INFO L226 Difference]: Without dead ends: 343 [2018-01-24 15:38:05,572 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:38:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-01-24 15:38:05,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 223. [2018-01-24 15:38:05,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-24 15:38:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 256 transitions. [2018-01-24 15:38:05,582 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 256 transitions. Word has length 27 [2018-01-24 15:38:05,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:38:05,582 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 256 transitions. [2018-01-24 15:38:05,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:38:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 256 transitions. [2018-01-24 15:38:05,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 15:38:05,583 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:38:05,583 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:38:05,584 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 15:38:05,584 INFO L82 PathProgramCache]: Analyzing trace with hash -260268355, now seen corresponding path program 1 times [2018-01-24 15:38:05,584 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:38:05,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:05,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:38:05,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:38:05,585 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:38:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:38:05,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:38:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:38:05,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:38:05,683 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:38:05,684 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 15:38:05,688 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [10], [16], [18], [21], [136], [137], [141], [145], [147], [148], [151], [152], [155], [158], [159], [162], [165], [174], [176], [264], [265], [266] [2018-01-24 15:38:05,754 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:38:05,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 15:38:59,467 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 15:38:59,468 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 15:38:59,468 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:38:59,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:38:59,469 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-24 15:38:59,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:38:59,474 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:38:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:38:59,515 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:38:59,524 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 15:38:59,524 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:38:59,530 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:38:59,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:38:59 BoogieIcfgContainer [2018-01-24 15:38:59,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:38:59,532 INFO L168 Benchmark]: Toolchain (without parser) took 60233.14 ms. Allocated memory was 300.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 261.0 MB in the beginning and 1.1 GB in the end (delta: -859.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 15:38:59,533 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:38:59,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.09 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 249.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:38:59,533 INFO L168 Benchmark]: Boogie Preprocessor took 42.26 ms. Allocated memory is still 300.9 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:38:59,534 INFO L168 Benchmark]: RCFGBuilder took 651.96 ms. Allocated memory is still 300.9 MB. Free memory was 247.0 MB in the beginning and 203.7 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 5.3 GB. [2018-01-24 15:38:59,534 INFO L168 Benchmark]: TraceAbstraction took 59290.24 ms. Allocated memory was 300.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 203.7 MB in the beginning and 1.1 GB in the end (delta: -916.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-01-24 15:38:59,535 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.25 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 239.09 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 249.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.26 ms. Allocated memory is still 300.9 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 651.96 ms. Allocated memory is still 300.9 MB. Free memory was 247.0 MB in the beginning and 203.7 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 59290.24 ms. Allocated memory was 300.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 203.7 MB in the beginning and 1.1 GB in the end (delta: -916.8 MB). Peak memory consumption was 1.0 GB. 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 674). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 685). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 685). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 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 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 75 error locations. TIMEOUT Result, 59.2s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1741 SDtfs, 3622 SDslu, 2924 SDs, 0 SdLazy, 2546 SolverSat, 190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 53.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 731 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 23993 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 13/13 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/tree_dsw_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-38-59-545.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_dsw_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-38-59-545.csv Completed graceful shutdown