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_smtcomp.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:14:26,299 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:14:26,300 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:14:26,315 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:14:26,316 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:14:26,317 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:14:26,318 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:14:26,319 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:14:26,321 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:14:26,322 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:14:26,323 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:14:26,323 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:14:26,324 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:14:26,325 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:14:26,326 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:14:26,329 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:14:26,331 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:14:26,333 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:14:26,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:14:26,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:14:26,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:14:26,338 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:14:26,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:14:26,339 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:14:26,340 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:14:26,341 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:14:26,341 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:14:26,342 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:14:26,342 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:14:26,342 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:14:26,343 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:14:26,343 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_smtcomp.epf [2018-01-25 06:14:26,351 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:14:26,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:14:26,352 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:14:26,352 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:14:26,352 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:14:26,353 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:14:26,353 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:14:26,353 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:14:26,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:14:26,353 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:14:26,354 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:14:26,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:14:26,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:14:26,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:14:26,354 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:14:26,354 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:14:26,354 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:14:26,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:14:26,355 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:14:26,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:14:26,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:14:26,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:14:26,355 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:14:26,356 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:14:26,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:14:26,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:14:26,356 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:14:26,356 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:14:26,356 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:14:26,357 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:14:26,357 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:14:26,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:14:26,357 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:14:26,357 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:14:26,358 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:14:26,358 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:14:26,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:14:26,399 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:14:26,403 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:14:26,404 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:14:26,404 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:14:26,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-01-25 06:14:26,561 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:14:26,567 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:14:26,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:14:26,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:14:26,573 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:14:26,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:14:26" (1/1) ... [2018-01-25 06:14:26,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bd00cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:26, skipping insertion in model container [2018-01-25 06:14:26,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:14:26" (1/1) ... [2018-01-25 06:14:26,591 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:14:26,631 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:14:26,753 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:14:26,777 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:14:26,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:26 WrapperNode [2018-01-25 06:14:26,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:14:26,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:14:26,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:14:26,789 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:14:26,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:26" (1/1) ... [2018-01-25 06:14:26,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:26" (1/1) ... [2018-01-25 06:14:26,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:26" (1/1) ... [2018-01-25 06:14:26,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:26" (1/1) ... [2018-01-25 06:14:26,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:26" (1/1) ... [2018-01-25 06:14:26,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:26" (1/1) ... [2018-01-25 06:14:26,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:26" (1/1) ... [2018-01-25 06:14:26,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:14:26,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:14:26,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:14:26,832 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:14:26,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:26" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:14:26,885 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:14:26,885 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:14:26,885 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:14:26,886 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:14:26,886 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:14:26,886 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:14:26,886 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:14:26,886 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:14:26,886 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:14:26,887 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:14:26,887 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:14:26,887 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:14:26,887 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:14:26,887 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 06:14:26,887 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:14:26,888 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:14:26,888 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:14:27,386 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:14:27,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:14:27 BoogieIcfgContainer [2018-01-25 06:14:27,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:14:27,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:14:27,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:14:27,389 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:14:27,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:14:26" (1/3) ... [2018-01-25 06:14:27,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f399ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:14:27, skipping insertion in model container [2018-01-25 06:14:27,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:14:26" (2/3) ... [2018-01-25 06:14:27,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f399ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:14:27, skipping insertion in model container [2018-01-25 06:14:27,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:14:27" (3/3) ... [2018-01-25 06:14:27,392 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-01-25 06:14:27,399 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:14:27,404 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2018-01-25 06:14:27,453 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:14:27,453 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:14:27,453 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:14:27,453 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:14:27,454 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:14:27,454 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:14:27,454 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:14:27,454 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:14:27,455 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:14:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2018-01-25 06:14:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:14:27,485 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:27,486 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:14:27,487 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:14:27,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2026691577, now seen corresponding path program 1 times [2018-01-25 06:14:27,495 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:27,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:27,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:27,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:27,552 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:27,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:14:27,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:27,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:14:27,683 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:27,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:14:27,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:14:27,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:14:27,698 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 4 states. [2018-01-25 06:14:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:28,038 INFO L93 Difference]: Finished difference Result 270 states and 310 transitions. [2018-01-25 06:14:28,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:14:28,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:14:28,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:28,092 INFO L225 Difference]: With dead ends: 270 [2018-01-25 06:14:28,092 INFO L226 Difference]: Without dead ends: 166 [2018-01-25 06:14:28,096 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:14:28,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-25 06:14:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 124. [2018-01-25 06:14:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-25 06:14:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2018-01-25 06:14:28,142 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 8 [2018-01-25 06:14:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:28,142 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2018-01-25 06:14:28,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:14:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2018-01-25 06:14:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:14:28,143 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:28,143 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:14:28,143 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:14:28,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2026691576, now seen corresponding path program 1 times [2018-01-25 06:14:28,144 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:28,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:28,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:28,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:28,145 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:28,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:28,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:14:28,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:28,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:14:28,256 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:28,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:14:28,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:14:28,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:14:28,258 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 4 states. [2018-01-25 06:14:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:28,625 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-01-25 06:14:28,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:14:28,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:14:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:28,628 INFO L225 Difference]: With dead ends: 154 [2018-01-25 06:14:28,628 INFO L226 Difference]: Without dead ends: 151 [2018-01-25 06:14:28,629 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:14:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-25 06:14:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 121. [2018-01-25 06:14:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-25 06:14:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-01-25 06:14:28,639 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 8 [2018-01-25 06:14:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:28,639 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-01-25 06:14:28,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:14:28,640 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-01-25 06:14:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 06:14:28,640 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:28,641 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:14:28,641 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:14:28,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2141337492, now seen corresponding path program 1 times [2018-01-25 06:14:28,641 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:28,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:28,642 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:28,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:28,643 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:28,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:14:28,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:28,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:14:28,720 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:28,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:14:28,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:14:28,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:14:28,721 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 4 states. [2018-01-25 06:14:28,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:28,845 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-01-25 06:14:28,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:14:28,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-25 06:14:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:28,847 INFO L225 Difference]: With dead ends: 141 [2018-01-25 06:14:28,848 INFO L226 Difference]: Without dead ends: 122 [2018-01-25 06:14:28,848 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-25 06:14:28,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-25 06:14:28,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2018-01-25 06:14:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-25 06:14:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-01-25 06:14:28,859 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 16 [2018-01-25 06:14:28,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:28,859 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-01-25 06:14:28,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:14:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2018-01-25 06:14:28,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 06:14:28,860 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:28,860 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:14:28,860 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:14:28,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2141337493, now seen corresponding path program 1 times [2018-01-25 06:14:28,861 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:28,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:28,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:28,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:28,862 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:28,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:14:28,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:28,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:14:28,953 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:28,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:14:28,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:14:28,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:14:28,954 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 7 states. [2018-01-25 06:14:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:29,329 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2018-01-25 06:14:29,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:14:29,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-01-25 06:14:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:29,331 INFO L225 Difference]: With dead ends: 208 [2018-01-25 06:14:29,331 INFO L226 Difference]: Without dead ends: 193 [2018-01-25 06:14:29,331 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:14:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-25 06:14:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 161. [2018-01-25 06:14:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-25 06:14:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 191 transitions. [2018-01-25 06:14:29,348 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 191 transitions. Word has length 16 [2018-01-25 06:14:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:29,349 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 191 transitions. [2018-01-25 06:14:29,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:14:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 191 transitions. [2018-01-25 06:14:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 06:14:29,350 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:29,350 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-25 06:14:29,350 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:14:29,351 INFO L82 PathProgramCache]: Analyzing trace with hash 535994936, now seen corresponding path program 1 times [2018-01-25 06:14:29,351 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:29,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:29,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:29,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:29,352 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:29,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:14:29,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:29,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:14:29,436 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:29,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:14:29,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:14:29,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:14:29,437 INFO L87 Difference]: Start difference. First operand 161 states and 191 transitions. Second operand 5 states. [2018-01-25 06:14:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:29,702 INFO L93 Difference]: Finished difference Result 282 states and 338 transitions. [2018-01-25 06:14:29,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:14:29,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 06:14:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:29,703 INFO L225 Difference]: With dead ends: 282 [2018-01-25 06:14:29,704 INFO L226 Difference]: Without dead ends: 281 [2018-01-25 06:14:29,704 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-25 06:14:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-01-25 06:14:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 160. [2018-01-25 06:14:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-25 06:14:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 189 transitions. [2018-01-25 06:14:29,717 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 189 transitions. Word has length 18 [2018-01-25 06:14:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:29,718 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 189 transitions. [2018-01-25 06:14:29,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:14:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2018-01-25 06:14:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 06:14:29,719 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:29,719 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-25 06:14:29,719 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:14:29,719 INFO L82 PathProgramCache]: Analyzing trace with hash 535994935, now seen corresponding path program 1 times [2018-01-25 06:14:29,719 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:29,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:29,720 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:29,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:29,720 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:29,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:14:29,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:29,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:14:29,759 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:29,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:14:29,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:14:29,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:14:29,760 INFO L87 Difference]: Start difference. First operand 160 states and 189 transitions. Second operand 5 states. [2018-01-25 06:14:29,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:29,957 INFO L93 Difference]: Finished difference Result 274 states and 326 transitions. [2018-01-25 06:14:29,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:14:29,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 06:14:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:29,960 INFO L225 Difference]: With dead ends: 274 [2018-01-25 06:14:29,961 INFO L226 Difference]: Without dead ends: 273 [2018-01-25 06:14:29,961 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-25 06:14:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-01-25 06:14:29,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 159. [2018-01-25 06:14:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-25 06:14:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 187 transitions. [2018-01-25 06:14:29,975 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 187 transitions. Word has length 18 [2018-01-25 06:14:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:29,975 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 187 transitions. [2018-01-25 06:14:29,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:14:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 187 transitions. [2018-01-25 06:14:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:14:29,976 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:29,976 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:14:29,976 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:14:29,977 INFO L82 PathProgramCache]: Analyzing trace with hash -598321662, now seen corresponding path program 1 times [2018-01-25 06:14:29,977 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:29,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:29,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:29,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:29,978 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:29,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:14:30,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:30,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:14:30,012 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:30,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:14:30,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:14:30,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:14:30,014 INFO L87 Difference]: Start difference. First operand 159 states and 187 transitions. Second operand 4 states. [2018-01-25 06:14:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:30,179 INFO L93 Difference]: Finished difference Result 175 states and 194 transitions. [2018-01-25 06:14:30,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:14:30,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-25 06:14:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:30,180 INFO L225 Difference]: With dead ends: 175 [2018-01-25 06:14:30,180 INFO L226 Difference]: Without dead ends: 174 [2018-01-25 06:14:30,180 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:14:30,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-25 06:14:30,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2018-01-25 06:14:30,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-25 06:14:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-01-25 06:14:30,189 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 19 [2018-01-25 06:14:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:30,189 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-01-25 06:14:30,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:14:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-01-25 06:14:30,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:14:30,190 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:30,190 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:14:30,190 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:14:30,190 INFO L82 PathProgramCache]: Analyzing trace with hash -598321661, now seen corresponding path program 1 times [2018-01-25 06:14:30,190 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:30,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:30,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:30,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:30,191 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:30,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:14:30,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:30,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:14:30,243 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:30,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:14:30,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:14:30,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:14:30,244 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 4 states. [2018-01-25 06:14:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:30,359 INFO L93 Difference]: Finished difference Result 177 states and 198 transitions. [2018-01-25 06:14:30,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:14:30,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-25 06:14:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:30,360 INFO L225 Difference]: With dead ends: 177 [2018-01-25 06:14:30,360 INFO L226 Difference]: Without dead ends: 174 [2018-01-25 06:14:30,360 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:14:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-25 06:14:30,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 155. [2018-01-25 06:14:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-25 06:14:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2018-01-25 06:14:30,370 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 19 [2018-01-25 06:14:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:30,370 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2018-01-25 06:14:30,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:14:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2018-01-25 06:14:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 06:14:30,371 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:30,371 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] [2018-01-25 06:14:30,371 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:14:30,372 INFO L82 PathProgramCache]: Analyzing trace with hash -992339015, now seen corresponding path program 1 times [2018-01-25 06:14:30,372 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:30,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:30,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:30,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:30,373 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:30,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:30,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:14:30,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:30,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:14:30,483 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:30,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:14:30,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:14:30,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:14:30,484 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand 9 states. [2018-01-25 06:14:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:31,080 INFO L93 Difference]: Finished difference Result 161 states and 185 transitions. [2018-01-25 06:14:31,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:14:31,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-25 06:14:31,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:31,082 INFO L225 Difference]: With dead ends: 161 [2018-01-25 06:14:31,082 INFO L226 Difference]: Without dead ends: 160 [2018-01-25 06:14:31,083 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-25 06:14:31,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-25 06:14:31,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2018-01-25 06:14:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-25 06:14:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2018-01-25 06:14:31,101 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 22 [2018-01-25 06:14:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:31,101 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2018-01-25 06:14:31,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:14:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2018-01-25 06:14:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 06:14:31,102 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:31,102 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] [2018-01-25 06:14:31,103 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:14:31,103 INFO L82 PathProgramCache]: Analyzing trace with hash -992339014, now seen corresponding path program 1 times [2018-01-25 06:14:31,103 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:31,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:31,104 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:31,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:31,104 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:31,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:14:31,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:31,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:14:31,319 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:31,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:14:31,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:14:31,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:14:31,320 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand 10 states. [2018-01-25 06:14:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:32,033 INFO L93 Difference]: Finished difference Result 165 states and 190 transitions. [2018-01-25 06:14:32,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 06:14:32,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-25 06:14:32,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:32,034 INFO L225 Difference]: With dead ends: 165 [2018-01-25 06:14:32,034 INFO L226 Difference]: Without dead ends: 160 [2018-01-25 06:14:32,034 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-25 06:14:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-25 06:14:32,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2018-01-25 06:14:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-25 06:14:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2018-01-25 06:14:32,046 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 22 [2018-01-25 06:14:32,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:32,046 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2018-01-25 06:14:32,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:14:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2018-01-25 06:14:32,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 06:14:32,047 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:32,048 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-25 06:14:32,048 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:14:32,048 INFO L82 PathProgramCache]: Analyzing trace with hash 325408366, now seen corresponding path program 1 times [2018-01-25 06:14:32,048 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:32,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:32,049 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:32,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:32,050 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:32,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:32,249 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-25 06:14:32,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:32,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:14:32,250 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:32,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:14:32,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:14:32,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:14:32,251 INFO L87 Difference]: Start difference. First operand 140 states and 167 transitions. Second operand 5 states. [2018-01-25 06:14:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:32,450 INFO L93 Difference]: Finished difference Result 241 states and 282 transitions. [2018-01-25 06:14:32,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:14:32,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-25 06:14:32,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:32,451 INFO L225 Difference]: With dead ends: 241 [2018-01-25 06:14:32,452 INFO L226 Difference]: Without dead ends: 157 [2018-01-25 06:14:32,452 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:14:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-25 06:14:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 148. [2018-01-25 06:14:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-25 06:14:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 177 transitions. [2018-01-25 06:14:32,464 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 177 transitions. Word has length 24 [2018-01-25 06:14:32,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:32,464 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 177 transitions. [2018-01-25 06:14:32,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:14:32,465 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 177 transitions. [2018-01-25 06:14:32,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 06:14:32,465 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:32,466 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-25 06:14:32,466 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:14:32,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1282351166, now seen corresponding path program 1 times [2018-01-25 06:14:32,466 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:32,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:32,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:32,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:32,467 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:32,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:14:32,530 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:32,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:14:32,530 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:32,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:14:32,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:14:32,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:14:32,531 INFO L87 Difference]: Start difference. First operand 148 states and 177 transitions. Second operand 5 states. [2018-01-25 06:14:32,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:32,752 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2018-01-25 06:14:32,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:14:32,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-25 06:14:32,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:32,754 INFO L225 Difference]: With dead ends: 185 [2018-01-25 06:14:32,754 INFO L226 Difference]: Without dead ends: 180 [2018-01-25 06:14:32,754 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:14:32,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-25 06:14:32,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 126. [2018-01-25 06:14:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-25 06:14:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-01-25 06:14:32,774 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 25 [2018-01-25 06:14:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:32,775 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-01-25 06:14:32,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:14:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-01-25 06:14:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 06:14:32,776 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:32,776 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:14:32,776 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:14:32,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1416942161, now seen corresponding path program 1 times [2018-01-25 06:14:32,776 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:32,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:32,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:32,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:32,778 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:32,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:14:32,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:14:32,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:14:32,867 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:14:32,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:14:32,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:14:32,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:14:32,868 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand 6 states. [2018-01-25 06:14:33,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:14:33,179 INFO L93 Difference]: Finished difference Result 248 states and 276 transitions. [2018-01-25 06:14:33,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:14:33,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-25 06:14:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:14:33,216 INFO L225 Difference]: With dead ends: 248 [2018-01-25 06:14:33,216 INFO L226 Difference]: Without dead ends: 193 [2018-01-25 06:14:33,217 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:14:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-25 06:14:33,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 139. [2018-01-25 06:14:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-25 06:14:33,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions. [2018-01-25 06:14:33,223 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 27 [2018-01-25 06:14:33,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:14:33,224 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions. [2018-01-25 06:14:33,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:14:33,224 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions. [2018-01-25 06:14:33,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 06:14:33,224 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:14:33,225 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, 1, 1] [2018-01-25 06:14:33,225 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:14:33,225 INFO L82 PathProgramCache]: Analyzing trace with hash -564778548, now seen corresponding path program 1 times [2018-01-25 06:14:33,225 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:14:33,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:33,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:14:33,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:14:33,226 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:14:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:14:33,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:14:33,489 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-25 06:14:33,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:14:33,489 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:14:33,490 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-25 06:14:33,492 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [11], [15], [17], [20], [47], [50], [51], [52], [53], [56], [59], [62], [120], [124], [126], [128], [133], [134], [137], [213], [214], [218], [219], [220] [2018-01-25 06:14:33,556 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:14:33,556 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 06:15:27,705 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 06:15:27,706 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 06:15:27,707 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:15:27,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:15:27,707 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:15:27,723 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:27,723 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:15:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:27,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:15:27,771 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 06:15:27,771 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:15:27,777 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:15:27,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:15:27 BoogieIcfgContainer [2018-01-25 06:15:27,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:15:27,779 INFO L168 Benchmark]: Toolchain (without parser) took 61217.13 ms. Allocated memory was 302.0 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 258.9 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 101.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:15:27,780 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 302.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:15:27,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.77 ms. Allocated memory is still 302.0 MB. Free memory was 258.9 MB in the beginning and 246.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:15:27,781 INFO L168 Benchmark]: Boogie Preprocessor took 43.29 ms. Allocated memory is still 302.0 MB. Free memory was 246.9 MB in the beginning and 245.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:15:27,781 INFO L168 Benchmark]: RCFGBuilder took 554.47 ms. Allocated memory is still 302.0 MB. Free memory was 245.0 MB in the beginning and 208.0 MB in the end (delta: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 5.3 GB. [2018-01-25 06:15:27,782 INFO L168 Benchmark]: TraceAbstraction took 60390.74 ms. Allocated memory was 302.0 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 208.0 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 50.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:15:27,784 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.13 ms. Allocated memory is still 302.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.77 ms. Allocated memory is still 302.0 MB. Free memory was 258.9 MB in the beginning and 246.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.29 ms. Allocated memory is still 302.0 MB. Free memory was 246.9 MB in the beginning and 245.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 554.47 ms. Allocated memory is still 302.0 MB. Free memory was 245.0 MB in the beginning and 208.0 MB in the end (delta: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 60390.74 ms. Allocated memory was 302.0 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 208.0 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 50.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1061). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1061). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 57 error locations. TIMEOUT Result, 60.3s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1170 SDtfs, 1973 SDslu, 1915 SDs, 0 SdLazy, 2956 SolverSat, 215 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 54.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 524 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 21139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2/2 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/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-15-27-795.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-15-27-795.csv Completed graceful shutdown