java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:41:09,291 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:41:09,293 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:41:09,309 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:41:09,310 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:41:09,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:41:09,312 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:41:09,314 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:41:09,316 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:41:09,317 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:41:09,318 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:41:09,319 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:41:09,320 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:41:09,321 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:41:09,322 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:41:09,325 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:41:09,327 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:41:09,329 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:41:09,331 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:41:09,332 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:41:09,335 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:41:09,335 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:41:09,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:41:09,337 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:41:09,337 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:41:09,339 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:41:09,339 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:41:09,340 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:41:09,340 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:41:09,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:41:09,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:41:09,341 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:41:09,350 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:41:09,350 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:41:09,351 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:41:09,351 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:41:09,351 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:41:09,352 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:41:09,352 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:41:09,352 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:41:09,352 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:41:09,352 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:41:09,353 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:41:09,353 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:41:09,353 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:41:09,353 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:41:09,353 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:41:09,354 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:41:09,354 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:41:09,354 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:41:09,354 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:41:09,354 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:41:09,354 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:41:09,354 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:41:09,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:41:09,355 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:41:09,355 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:41:09,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:41:09,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:41:09,356 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:41:09,356 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:41:09,356 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:41:09,356 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:41:09,356 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:41:09,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:41:09,356 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:41:09,356 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:41:09,357 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:41:09,357 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:41:09,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:41:09,406 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:41:09,411 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:41:09,412 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:41:09,412 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:41:09,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:41:09,600 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:41:09,605 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:41:09,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:41:09,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:41:09,612 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:41:09,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:41:09" (1/1) ... [2018-01-25 02:41:09,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aad67c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:09, skipping insertion in model container [2018-01-25 02:41:09,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:41:09" (1/1) ... [2018-01-25 02:41:09,633 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:41:09,673 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:41:09,801 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:41:09,822 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:41:09,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:09 WrapperNode [2018-01-25 02:41:09,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:41:09,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:41:09,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:41:09,833 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:41:09,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:09" (1/1) ... [2018-01-25 02:41:09,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:09" (1/1) ... [2018-01-25 02:41:09,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:09" (1/1) ... [2018-01-25 02:41:09,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:09" (1/1) ... [2018-01-25 02:41:09,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:09" (1/1) ... [2018-01-25 02:41:09,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:09" (1/1) ... [2018-01-25 02:41:09,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:09" (1/1) ... [2018-01-25 02:41:09,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:41:09,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:41:09,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:41:09,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:41:09,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:09" (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 02:41:09,928 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:41:09,928 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:41:09,928 INFO L136 BoogieDeclarations]: Found implementation of procedure cstpncpy [2018-01-25 02:41:09,928 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:41:09,929 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 02:41:09,929 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 02:41:09,929 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:41:09,929 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:41:09,929 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:41:09,929 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:41:09,930 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:41:09,930 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:41:09,930 INFO L128 BoogieDeclarations]: Found specification of procedure cstpncpy [2018-01-25 02:41:09,930 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:41:09,930 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:41:09,930 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:41:10,283 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:41:10,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:41:10 BoogieIcfgContainer [2018-01-25 02:41:10,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:41:10,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:41:10,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:41:10,289 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:41:10,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:41:09" (1/3) ... [2018-01-25 02:41:10,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b05fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:41:10, skipping insertion in model container [2018-01-25 02:41:10,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:09" (2/3) ... [2018-01-25 02:41:10,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b05fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:41:10, skipping insertion in model container [2018-01-25 02:41:10,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:41:10" (3/3) ... [2018-01-25 02:41:10,296 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:41:10,304 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:41:10,315 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-25 02:41:10,378 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:41:10,378 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:41:10,378 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:41:10,378 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:41:10,378 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:41:10,378 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:41:10,379 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:41:10,379 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:41:10,380 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:41:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-01-25 02:41:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:41:10,414 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:10,415 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:10,415 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:41:10,422 INFO L82 PathProgramCache]: Analyzing trace with hash 149116887, now seen corresponding path program 1 times [2018-01-25 02:41:10,425 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:10,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:10,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:10,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:10,471 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:10,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:10,637 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 02:41:10,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:10,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:41:10,640 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:10,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:41:10,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:41:10,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:41:10,662 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states. [2018-01-25 02:41:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:10,865 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-01-25 02:41:10,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:41:10,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 02:41:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:10,878 INFO L225 Difference]: With dead ends: 89 [2018-01-25 02:41:10,879 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 02:41:10,882 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 02:41:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 02:41:10,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-25 02:41:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 02:41:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-25 02:41:10,919 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 13 [2018-01-25 02:41:10,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:10,920 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-25 02:41:10,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:41:10,920 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-25 02:41:10,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:41:10,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:10,921 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:10,921 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:41:10,921 INFO L82 PathProgramCache]: Analyzing trace with hash 149116888, now seen corresponding path program 1 times [2018-01-25 02:41:10,922 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:10,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:10,923 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:10,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:10,924 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:10,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:11,082 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 02:41:11,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:11,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:41:11,083 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:11,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:41:11,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:41:11,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:41:11,086 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 5 states. [2018-01-25 02:41:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:11,228 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-01-25 02:41:11,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:41:11,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-25 02:41:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:11,231 INFO L225 Difference]: With dead ends: 67 [2018-01-25 02:41:11,231 INFO L226 Difference]: Without dead ends: 66 [2018-01-25 02:41:11,234 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:41:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-25 02:41:11,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-25 02:41:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-25 02:41:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-01-25 02:41:11,245 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 13 [2018-01-25 02:41:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:11,245 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-01-25 02:41:11,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:41:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-01-25 02:41:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:41:11,246 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:11,246 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:11,247 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:41:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1345074556, now seen corresponding path program 1 times [2018-01-25 02:41:11,247 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:11,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:11,248 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:11,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:11,249 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:11,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:11,307 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 02:41:11,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:11,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 02:41:11,308 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:11,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:41:11,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:41:11,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:41:11,309 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 3 states. [2018-01-25 02:41:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:11,376 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-01-25 02:41:11,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:41:11,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-25 02:41:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:11,378 INFO L225 Difference]: With dead ends: 66 [2018-01-25 02:41:11,378 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 02:41:11,378 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:41:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 02:41:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-25 02:41:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 02:41:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-25 02:41:11,386 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 16 [2018-01-25 02:41:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:11,386 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-25 02:41:11,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:41:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-25 02:41:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:41:11,387 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:11,388 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:11,388 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:41:11,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1345074557, now seen corresponding path program 1 times [2018-01-25 02:41:11,388 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:11,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:11,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:11,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:11,390 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:11,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:11,463 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 02:41:11,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:11,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 02:41:11,464 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:11,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:41:11,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:41:11,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:41:11,465 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 3 states. [2018-01-25 02:41:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:11,506 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-01-25 02:41:11,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:41:11,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-25 02:41:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:11,507 INFO L225 Difference]: With dead ends: 60 [2018-01-25 02:41:11,507 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 02:41:11,508 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:41:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 02:41:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 02:41:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 02:41:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-25 02:41:11,515 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 16 [2018-01-25 02:41:11,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:11,515 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-25 02:41:11,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:41:11,516 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-25 02:41:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 02:41:11,516 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:11,517 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 02:41:11,517 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:41:11,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1779018923, now seen corresponding path program 1 times [2018-01-25 02:41:11,517 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:11,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:11,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:11,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:11,519 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:11,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:11,777 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 02:41:11,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:11,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:41:11,778 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:11,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:41:11,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:41:11,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:41:11,779 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 9 states. [2018-01-25 02:41:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:11,954 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-01-25 02:41:11,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:41:11,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-25 02:41:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:11,955 INFO L225 Difference]: With dead ends: 57 [2018-01-25 02:41:11,956 INFO L226 Difference]: Without dead ends: 56 [2018-01-25 02:41:11,956 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:41:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-25 02:41:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-01-25 02:41:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 02:41:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-25 02:41:11,963 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 25 [2018-01-25 02:41:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:11,964 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-25 02:41:11,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:41:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-25 02:41:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 02:41:11,965 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:11,965 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 02:41:11,965 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:41:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1779018922, now seen corresponding path program 1 times [2018-01-25 02:41:11,965 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:11,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:11,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:11,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:11,967 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:11,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:12,202 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 02:41:12,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:12,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 02:41:12,203 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:12,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 02:41:12,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 02:41:12,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:41:12,204 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 11 states. [2018-01-25 02:41:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:12,464 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-01-25 02:41:12,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 02:41:12,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-01-25 02:41:12,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:12,466 INFO L225 Difference]: With dead ends: 60 [2018-01-25 02:41:12,466 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 02:41:12,466 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-01-25 02:41:12,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 02:41:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-25 02:41:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 02:41:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-01-25 02:41:12,471 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 25 [2018-01-25 02:41:12,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:12,472 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-01-25 02:41:12,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 02:41:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-01-25 02:41:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:41:12,472 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:12,472 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] [2018-01-25 02:41:12,473 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:41:12,473 INFO L82 PathProgramCache]: Analyzing trace with hash 684988236, now seen corresponding path program 1 times [2018-01-25 02:41:12,473 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:12,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:12,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:12,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:12,474 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:12,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:12,692 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 02:41:12,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:12,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-25 02:41:12,693 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:12,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-25 02:41:12,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-25 02:41:12,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-01-25 02:41:12,694 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 14 states. [2018-01-25 02:41:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:13,023 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-01-25 02:41:13,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 02:41:13,024 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-01-25 02:41:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:13,024 INFO L225 Difference]: With dead ends: 58 [2018-01-25 02:41:13,025 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 02:41:13,025 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2018-01-25 02:41:13,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 02:41:13,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-01-25 02:41:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 02:41:13,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-25 02:41:13,033 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 26 [2018-01-25 02:41:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:13,033 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-25 02:41:13,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-25 02:41:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-25 02:41:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:41:13,034 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:13,034 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] [2018-01-25 02:41:13,034 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:41:13,035 INFO L82 PathProgramCache]: Analyzing trace with hash 684988237, now seen corresponding path program 1 times [2018-01-25 02:41:13,035 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:13,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:13,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:13,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:13,036 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:13,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:13,276 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 02:41:13,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:13,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 02:41:13,277 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:13,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 02:41:13,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 02:41:13,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:41:13,278 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 13 states. [2018-01-25 02:41:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:13,512 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-01-25 02:41:13,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 02:41:13,513 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-01-25 02:41:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:13,513 INFO L225 Difference]: With dead ends: 60 [2018-01-25 02:41:13,513 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 02:41:13,514 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-01-25 02:41:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 02:41:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-25 02:41:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 02:41:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-01-25 02:41:13,520 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 26 [2018-01-25 02:41:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:13,521 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-01-25 02:41:13,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 02:41:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-01-25 02:41:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 02:41:13,522 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:13,522 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:13,522 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:41:13,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1786557187, now seen corresponding path program 1 times [2018-01-25 02:41:13,523 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:13,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:13,524 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:13,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:13,524 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:13,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:13,584 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 02:41:13,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:13,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:41:13,585 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:13,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:41:13,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:41:13,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:41:13,586 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 5 states. [2018-01-25 02:41:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:13,647 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-01-25 02:41:13,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:41:13,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-25 02:41:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:13,653 INFO L225 Difference]: With dead ends: 86 [2018-01-25 02:41:13,653 INFO L226 Difference]: Without dead ends: 79 [2018-01-25 02:41:13,653 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:41:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-25 02:41:13,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2018-01-25 02:41:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 02:41:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-25 02:41:13,668 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 30 [2018-01-25 02:41:13,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:13,668 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-25 02:41:13,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:41:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-25 02:41:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 02:41:13,670 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:13,670 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:13,670 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:41:13,670 INFO L82 PathProgramCache]: Analyzing trace with hash -18881147, now seen corresponding path program 1 times [2018-01-25 02:41:13,670 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:13,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:13,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:13,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:13,672 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:13,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:13,765 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 02:41:13,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:13,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:41:13,766 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:13,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:41:13,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:41:13,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:41:13,767 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 6 states. [2018-01-25 02:41:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:13,830 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-01-25 02:41:13,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:41:13,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-25 02:41:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:13,832 INFO L225 Difference]: With dead ends: 79 [2018-01-25 02:41:13,832 INFO L226 Difference]: Without dead ends: 66 [2018-01-25 02:41:13,832 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:41:13,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-25 02:41:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2018-01-25 02:41:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 02:41:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-01-25 02:41:13,839 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 30 [2018-01-25 02:41:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:13,839 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-01-25 02:41:13,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:41:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-01-25 02:41:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 02:41:13,840 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:13,840 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, 1] [2018-01-25 02:41:13,841 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:41:13,841 INFO L82 PathProgramCache]: Analyzing trace with hash -25567208, now seen corresponding path program 1 times [2018-01-25 02:41:13,841 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:13,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:13,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:13,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:13,842 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:13,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:13,961 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 02:41:13,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:13,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:41:13,962 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:13,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:41:13,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:41:13,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:41:13,963 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-01-25 02:41:14,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:14,039 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-01-25 02:41:14,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:41:14,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-25 02:41:14,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:14,047 INFO L225 Difference]: With dead ends: 128 [2018-01-25 02:41:14,047 INFO L226 Difference]: Without dead ends: 99 [2018-01-25 02:41:14,048 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 02:41:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-25 02:41:14,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-01-25 02:41:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-25 02:41:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-01-25 02:41:14,057 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 31 [2018-01-25 02:41:14,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:14,057 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-01-25 02:41:14,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:41:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-01-25 02:41:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 02:41:14,058 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:14,058 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, 1] [2018-01-25 02:41:14,058 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:41:14,059 INFO L82 PathProgramCache]: Analyzing trace with hash -159580714, now seen corresponding path program 1 times [2018-01-25 02:41:14,059 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:14,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:14,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:14,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:14,060 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:14,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:14,260 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 02:41:14,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:14,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-25 02:41:14,261 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:14,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 02:41:14,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 02:41:14,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:41:14,262 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 13 states. [2018-01-25 02:41:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:14,589 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-01-25 02:41:14,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 02:41:14,589 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-01-25 02:41:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:14,591 INFO L225 Difference]: With dead ends: 197 [2018-01-25 02:41:14,591 INFO L226 Difference]: Without dead ends: 160 [2018-01-25 02:41:14,592 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-01-25 02:41:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-25 02:41:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 120. [2018-01-25 02:41:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-25 02:41:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2018-01-25 02:41:14,605 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 31 [2018-01-25 02:41:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:14,606 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2018-01-25 02:41:14,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 02:41:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2018-01-25 02:41:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 02:41:14,607 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:14,608 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, 1] [2018-01-25 02:41:14,608 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:41:14,608 INFO L82 PathProgramCache]: Analyzing trace with hash -19032104, now seen corresponding path program 1 times [2018-01-25 02:41:14,608 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:14,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:14,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:14,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:14,609 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:14,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:14,908 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 02:41:14,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:41:14,909 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:41:14,910 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-01-25 02:41:14,911 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [17], [20], [23], [27], [28], [30], [31], [59], [61], [66], [80], [85], [91], [93], [94], [95], [96], [97], [108], [109], [110], [112] [2018-01-25 02:41:14,962 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:41:14,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown