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_precise.epf -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 00:13:16,281 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:13:16,283 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:13:16,298 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:13:16,298 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:13:16,299 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:13:16,300 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:13:16,301 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:13:16,303 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:13:16,304 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:13:16,305 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:13:16,305 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:13:16,306 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:13:16,307 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:13:16,308 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:13:16,311 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:13:16,313 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:13:16,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:13:16,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:13:16,317 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:13:16,320 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:13:16,320 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:13:16,320 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:13:16,321 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:13:16,322 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:13:16,323 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:13:16,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:13:16,324 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:13:16,324 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:13:16,325 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:13:16,325 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:13:16,326 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_precise.epf [2018-01-25 00:13:16,336 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:13:16,336 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:13:16,337 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:13:16,337 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:13:16,338 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:13:16,338 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:13:16,338 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:13:16,338 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:13:16,339 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:13:16,339 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:13:16,339 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:13:16,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:13:16,340 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:13:16,340 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:13:16,340 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:13:16,340 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:13:16,341 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:13:16,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:13:16,341 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:13:16,341 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:13:16,341 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:13:16,342 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:13:16,342 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:13:16,342 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:13:16,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:13:16,342 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:13:16,343 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:13:16,343 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:13:16,343 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:13:16,343 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:13:16,343 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:13:16,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:13:16,344 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:13:16,344 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:13:16,345 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:13:16,345 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:13:16,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:13:16,392 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:13:16,396 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:13:16,398 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:13:16,398 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:13:16,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i [2018-01-25 00:13:16,571 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:13:16,578 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:13:16,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:13:16,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:13:16,587 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:13:16,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:13:16" (1/1) ... [2018-01-25 00:13:16,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5af4b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:13:16, skipping insertion in model container [2018-01-25 00:13:16,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:13:16" (1/1) ... [2018-01-25 00:13:16,611 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:13:16,653 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:13:16,767 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:13:16,793 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:13:16,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:13:16 WrapperNode [2018-01-25 00:13:16,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:13:16,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:13:16,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:13:16,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:13:16,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:13:16" (1/1) ... [2018-01-25 00:13:16,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:13:16" (1/1) ... [2018-01-25 00:13:16,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:13:16" (1/1) ... [2018-01-25 00:13:16,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:13:16" (1/1) ... [2018-01-25 00:13:16,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:13:16" (1/1) ... [2018-01-25 00:13:16,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:13:16" (1/1) ... [2018-01-25 00:13:16,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:13:16" (1/1) ... [2018-01-25 00:13:16,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:13:16,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:13:16,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:13:16,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:13:16,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:13:16" (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 00:13:16,912 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:13:16,912 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:13:16,912 INFO L136 BoogieDeclarations]: Found implementation of procedure fail [2018-01-25 00:13:16,912 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-01-25 00:13:16,912 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-01-25 00:13:16,913 INFO L136 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-01-25 00:13:16,913 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-01-25 00:13:16,913 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-01-25 00:13:16,913 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:13:16,913 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 00:13:16,913 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 00:13:16,914 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 00:13:16,914 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 00:13:16,914 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:13:16,914 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:13:16,914 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:13:16,914 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 00:13:16,915 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 00:13:16,915 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-25 00:13:16,915 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:13:16,915 INFO L128 BoogieDeclarations]: Found specification of procedure fail [2018-01-25 00:13:16,915 INFO L128 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-01-25 00:13:16,915 INFO L128 BoogieDeclarations]: Found specification of procedure merge_pair [2018-01-25 00:13:16,916 INFO L128 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-01-25 00:13:16,916 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_before [2018-01-25 00:13:16,916 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_after [2018-01-25 00:13:16,916 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:13:16,916 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:13:16,916 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:13:17,849 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:13:17,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:13:17 BoogieIcfgContainer [2018-01-25 00:13:17,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:13:17,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:13:17,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:13:17,854 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:13:17,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:13:16" (1/3) ... [2018-01-25 00:13:17,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c65fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:13:17, skipping insertion in model container [2018-01-25 00:13:17,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:13:16" (2/3) ... [2018-01-25 00:13:17,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c65fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:13:17, skipping insertion in model container [2018-01-25 00:13:17,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:13:17" (3/3) ... [2018-01-25 00:13:17,858 INFO L105 eAbstractionObserver]: Analyzing ICFG merge_sort_true-unreach-call_true-valid-memsafety.i [2018-01-25 00:13:17,864 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:13:17,872 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 109 error locations. [2018-01-25 00:13:17,917 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:13:17,917 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:13:17,917 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:13:17,917 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:13:17,917 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:13:17,917 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:13:17,917 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:13:17,918 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:13:17,918 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:13:17,942 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states. [2018-01-25 00:13:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-25 00:13:17,948 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:13:17,948 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:13:17,949 INFO L371 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-01-25 00:13:17,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1556477250, now seen corresponding path program 1 times [2018-01-25 00:13:17,954 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:13:17,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:17,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:13:17,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:17,996 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:13:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:13:18,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:13:18,061 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 00:13:18,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:13:18,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:13:18,063 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:13:18,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 00:13:18,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 00:13:18,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 00:13:18,165 INFO L87 Difference]: Start difference. First operand 315 states. Second operand 2 states. [2018-01-25 00:13:18,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:13:18,218 INFO L93 Difference]: Finished difference Result 622 states and 773 transitions. [2018-01-25 00:13:18,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 00:13:18,219 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-25 00:13:18,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:13:18,234 INFO L225 Difference]: With dead ends: 622 [2018-01-25 00:13:18,234 INFO L226 Difference]: Without dead ends: 296 [2018-01-25 00:13:18,240 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 00:13:18,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-01-25 00:13:18,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-01-25 00:13:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-01-25 00:13:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 309 transitions. [2018-01-25 00:13:18,294 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 309 transitions. Word has length 9 [2018-01-25 00:13:18,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:13:18,295 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 309 transitions. [2018-01-25 00:13:18,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 00:13:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 309 transitions. [2018-01-25 00:13:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 00:13:18,296 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:13:18,296 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:13:18,296 INFO L371 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-01-25 00:13:18,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1087749341, now seen corresponding path program 1 times [2018-01-25 00:13:18,297 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:13:18,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:18,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:13:18,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:18,298 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:13:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:13:18,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:13:18,355 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 00:13:18,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:13:18,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:13:18,356 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:13:18,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:13:18,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:13:18,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:13:18,358 INFO L87 Difference]: Start difference. First operand 296 states and 309 transitions. Second operand 3 states. [2018-01-25 00:13:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:13:18,657 INFO L93 Difference]: Finished difference Result 340 states and 362 transitions. [2018-01-25 00:13:18,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:13:18,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-25 00:13:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:13:18,660 INFO L225 Difference]: With dead ends: 340 [2018-01-25 00:13:18,660 INFO L226 Difference]: Without dead ends: 338 [2018-01-25 00:13:18,661 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 00:13:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-01-25 00:13:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 300. [2018-01-25 00:13:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-01-25 00:13:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 314 transitions. [2018-01-25 00:13:18,686 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 314 transitions. Word has length 11 [2018-01-25 00:13:18,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:13:18,686 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 314 transitions. [2018-01-25 00:13:18,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:13:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 314 transitions. [2018-01-25 00:13:18,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 00:13:18,687 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:13:18,687 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:13:18,687 INFO L371 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-01-25 00:13:18,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1650764336, now seen corresponding path program 1 times [2018-01-25 00:13:18,688 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:13:18,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:18,689 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:13:18,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:18,689 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:13:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:13:18,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:13:18,799 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 00:13:18,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:13:18,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 00:13:18,799 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:13:18,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 00:13:18,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 00:13:18,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:13:18,800 INFO L87 Difference]: Start difference. First operand 300 states and 314 transitions. Second operand 4 states. [2018-01-25 00:13:19,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:13:19,057 INFO L93 Difference]: Finished difference Result 330 states and 348 transitions. [2018-01-25 00:13:19,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 00:13:19,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 00:13:19,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:13:19,060 INFO L225 Difference]: With dead ends: 330 [2018-01-25 00:13:19,060 INFO L226 Difference]: Without dead ends: 328 [2018-01-25 00:13:19,061 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:13:19,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-01-25 00:13:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 298. [2018-01-25 00:13:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-01-25 00:13:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 312 transitions. [2018-01-25 00:13:19,078 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 312 transitions. Word has length 13 [2018-01-25 00:13:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:13:19,078 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 312 transitions. [2018-01-25 00:13:19,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 00:13:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 312 transitions. [2018-01-25 00:13:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 00:13:19,079 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:13:19,079 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:13:19,080 INFO L371 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-01-25 00:13:19,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1650764335, now seen corresponding path program 1 times [2018-01-25 00:13:19,080 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:13:19,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:19,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:13:19,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:19,081 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:13:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:13:19,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:13:19,120 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 00:13:19,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:13:19,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 00:13:19,121 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:13:19,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 00:13:19,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 00:13:19,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:13:19,122 INFO L87 Difference]: Start difference. First operand 298 states and 312 transitions. Second operand 4 states. [2018-01-25 00:13:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:13:19,427 INFO L93 Difference]: Finished difference Result 317 states and 334 transitions. [2018-01-25 00:13:19,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 00:13:19,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 00:13:19,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:13:19,430 INFO L225 Difference]: With dead ends: 317 [2018-01-25 00:13:19,430 INFO L226 Difference]: Without dead ends: 315 [2018-01-25 00:13:19,430 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:13:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-01-25 00:13:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 296. [2018-01-25 00:13:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-01-25 00:13:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 310 transitions. [2018-01-25 00:13:19,442 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 310 transitions. Word has length 13 [2018-01-25 00:13:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:13:19,443 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 310 transitions. [2018-01-25 00:13:19,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 00:13:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 310 transitions. [2018-01-25 00:13:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 00:13:19,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:13:19,444 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:13:19,444 INFO L371 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-01-25 00:13:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash 45229303, now seen corresponding path program 1 times [2018-01-25 00:13:19,444 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:13:19,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:19,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:13:19,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:19,446 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:13:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:13:19,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:13:19,480 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 00:13:19,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:13:19,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 00:13:19,481 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:13:19,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:13:19,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:13:19,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:13:19,481 INFO L87 Difference]: Start difference. First operand 296 states and 310 transitions. Second operand 3 states. [2018-01-25 00:13:19,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:13:19,508 INFO L93 Difference]: Finished difference Result 580 states and 604 transitions. [2018-01-25 00:13:19,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:13:19,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 00:13:19,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:13:19,510 INFO L225 Difference]: With dead ends: 580 [2018-01-25 00:13:19,510 INFO L226 Difference]: Without dead ends: 314 [2018-01-25 00:13:19,512 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:13:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-01-25 00:13:19,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 295. [2018-01-25 00:13:19,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-01-25 00:13:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 308 transitions. [2018-01-25 00:13:19,524 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 308 transitions. Word has length 17 [2018-01-25 00:13:19,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:13:19,524 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 308 transitions. [2018-01-25 00:13:19,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:13:19,524 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 308 transitions. [2018-01-25 00:13:19,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 00:13:19,525 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:13:19,525 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:13:19,525 INFO L371 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-01-25 00:13:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash 963226955, now seen corresponding path program 1 times [2018-01-25 00:13:19,525 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:13:19,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:19,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:13:19,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:19,526 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:13:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:13:19,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:13:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:13:19,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:13:19,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 00:13:19,605 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:13:19,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 00:13:19,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 00:13:19,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:13:19,605 INFO L87 Difference]: Start difference. First operand 295 states and 308 transitions. Second operand 4 states. [2018-01-25 00:13:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:13:19,786 INFO L93 Difference]: Finished difference Result 331 states and 347 transitions. [2018-01-25 00:13:19,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 00:13:19,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-25 00:13:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:13:19,788 INFO L225 Difference]: With dead ends: 331 [2018-01-25 00:13:19,788 INFO L226 Difference]: Without dead ends: 329 [2018-01-25 00:13:19,789 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:13:19,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-01-25 00:13:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 293. [2018-01-25 00:13:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-01-25 00:13:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 306 transitions. [2018-01-25 00:13:19,801 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 306 transitions. Word has length 20 [2018-01-25 00:13:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:13:19,801 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 306 transitions. [2018-01-25 00:13:19,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 00:13:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 306 transitions. [2018-01-25 00:13:19,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 00:13:19,802 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:13:19,802 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:13:19,803 INFO L371 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-01-25 00:13:19,803 INFO L82 PathProgramCache]: Analyzing trace with hash 963226954, now seen corresponding path program 1 times [2018-01-25 00:13:19,803 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:13:19,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:19,804 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:13:19,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:19,805 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:13:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:13:19,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:13:19,853 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 00:13:19,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:13:19,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 00:13:19,854 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:13:19,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 00:13:19,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 00:13:19,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:13:19,855 INFO L87 Difference]: Start difference. First operand 293 states and 306 transitions. Second operand 4 states. [2018-01-25 00:13:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:13:20,124 INFO L93 Difference]: Finished difference Result 318 states and 333 transitions. [2018-01-25 00:13:20,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 00:13:20,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-25 00:13:20,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:13:20,126 INFO L225 Difference]: With dead ends: 318 [2018-01-25 00:13:20,126 INFO L226 Difference]: Without dead ends: 316 [2018-01-25 00:13:20,126 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:13:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-01-25 00:13:20,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 291. [2018-01-25 00:13:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-01-25 00:13:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 304 transitions. [2018-01-25 00:13:20,138 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 304 transitions. Word has length 20 [2018-01-25 00:13:20,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:13:20,138 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 304 transitions. [2018-01-25 00:13:20,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 00:13:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 304 transitions. [2018-01-25 00:13:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 00:13:20,139 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:13:20,139 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:13:20,139 INFO L371 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-01-25 00:13:20,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1725402921, now seen corresponding path program 1 times [2018-01-25 00:13:20,140 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:13:20,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:20,141 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:13:20,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:20,141 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:13:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:13:20,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:13:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:13:20,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:13:20,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:13:20,216 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:13:20,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:13:20,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:13:20,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:13:20,217 INFO L87 Difference]: Start difference. First operand 291 states and 304 transitions. Second operand 5 states. [2018-01-25 00:13:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:13:20,307 INFO L93 Difference]: Finished difference Result 333 states and 349 transitions. [2018-01-25 00:13:20,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:13:20,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-25 00:13:20,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:13:20,310 INFO L225 Difference]: With dead ends: 333 [2018-01-25 00:13:20,310 INFO L226 Difference]: Without dead ends: 331 [2018-01-25 00:13:20,311 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 00:13:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-01-25 00:13:20,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2018-01-25 00:13:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-01-25 00:13:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 303 transitions. [2018-01-25 00:13:20,325 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 303 transitions. Word has length 27 [2018-01-25 00:13:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:13:20,326 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 303 transitions. [2018-01-25 00:13:20,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:13:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 303 transitions. [2018-01-25 00:13:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 00:13:20,327 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:13:20,327 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:13:20,327 INFO L371 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-01-25 00:13:20,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1961365059, now seen corresponding path program 1 times [2018-01-25 00:13:20,328 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:13:20,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:20,329 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:13:20,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:20,329 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:13:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:13:20,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:13:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:13:20,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:13:20,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:13:20,414 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:13:20,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:13:20,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:13:20,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:13:20,415 INFO L87 Difference]: Start difference. First operand 291 states and 303 transitions. Second operand 6 states. [2018-01-25 00:13:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:13:21,085 INFO L93 Difference]: Finished difference Result 320 states and 337 transitions. [2018-01-25 00:13:21,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 00:13:21,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-25 00:13:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:13:21,088 INFO L225 Difference]: With dead ends: 320 [2018-01-25 00:13:21,088 INFO L226 Difference]: Without dead ends: 309 [2018-01-25 00:13:21,089 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 00:13:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-01-25 00:13:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 286. [2018-01-25 00:13:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-01-25 00:13:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 300 transitions. [2018-01-25 00:13:21,098 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 300 transitions. Word has length 33 [2018-01-25 00:13:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:13:21,099 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 300 transitions. [2018-01-25 00:13:21,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:13:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 300 transitions. [2018-01-25 00:13:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 00:13:21,100 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:13:21,100 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:13:21,100 INFO L371 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-01-25 00:13:21,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1961365060, now seen corresponding path program 1 times [2018-01-25 00:13:21,100 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:13:21,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:21,102 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:13:21,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:21,102 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:13:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:13:21,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:13:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:13:21,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:13:21,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:13:21,239 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:13:21,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 00:13:21,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 00:13:21,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:13:21,240 INFO L87 Difference]: Start difference. First operand 286 states and 300 transitions. Second operand 7 states. [2018-01-25 00:13:21,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:13:21,750 INFO L93 Difference]: Finished difference Result 370 states and 386 transitions. [2018-01-25 00:13:21,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 00:13:21,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-01-25 00:13:21,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:13:21,753 INFO L225 Difference]: With dead ends: 370 [2018-01-25 00:13:21,753 INFO L226 Difference]: Without dead ends: 359 [2018-01-25 00:13:21,754 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-25 00:13:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-01-25 00:13:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 322. [2018-01-25 00:13:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-01-25 00:13:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 339 transitions. [2018-01-25 00:13:21,766 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 339 transitions. Word has length 33 [2018-01-25 00:13:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:13:21,766 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 339 transitions. [2018-01-25 00:13:21,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 00:13:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 339 transitions. [2018-01-25 00:13:21,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-25 00:13:21,768 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:13:21,768 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:13:21,768 INFO L371 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-01-25 00:13:21,768 INFO L82 PathProgramCache]: Analyzing trace with hash 816569686, now seen corresponding path program 1 times [2018-01-25 00:13:21,768 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:13:21,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:21,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:13:21,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:21,770 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:13:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:13:21,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:13:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:13:22,047 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:13:22,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 00:13:22,047 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:13:22,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 00:13:22,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 00:13:22,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-01-25 00:13:22,048 INFO L87 Difference]: Start difference. First operand 322 states and 339 transitions. Second operand 12 states. [2018-01-25 00:13:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:13:22,877 INFO L93 Difference]: Finished difference Result 337 states and 353 transitions. [2018-01-25 00:13:22,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:13:22,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-01-25 00:13:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:13:22,879 INFO L225 Difference]: With dead ends: 337 [2018-01-25 00:13:22,879 INFO L226 Difference]: Without dead ends: 336 [2018-01-25 00:13:22,880 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-01-25 00:13:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-01-25 00:13:22,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 323. [2018-01-25 00:13:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-01-25 00:13:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 341 transitions. [2018-01-25 00:13:22,895 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 341 transitions. Word has length 48 [2018-01-25 00:13:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:13:22,896 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 341 transitions. [2018-01-25 00:13:22,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 00:13:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 341 transitions. [2018-01-25 00:13:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-25 00:13:22,897 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:13:22,897 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:13:22,897 INFO L371 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-01-25 00:13:22,898 INFO L82 PathProgramCache]: Analyzing trace with hash 816569687, now seen corresponding path program 1 times [2018-01-25 00:13:22,898 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:13:22,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:22,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:13:22,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:22,899 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:13:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:13:22,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:13:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:13:23,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:13:23,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 00:13:23,191 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:13:23,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 00:13:23,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 00:13:23,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-25 00:13:23,192 INFO L87 Difference]: Start difference. First operand 323 states and 341 transitions. Second operand 10 states. [2018-01-25 00:13:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:13:23,863 INFO L93 Difference]: Finished difference Result 349 states and 365 transitions. [2018-01-25 00:13:23,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 00:13:23,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-01-25 00:13:23,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:13:23,866 INFO L225 Difference]: With dead ends: 349 [2018-01-25 00:13:23,866 INFO L226 Difference]: Without dead ends: 348 [2018-01-25 00:13:23,866 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-01-25 00:13:23,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-01-25 00:13:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 323. [2018-01-25 00:13:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-01-25 00:13:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 340 transitions. [2018-01-25 00:13:23,878 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 340 transitions. Word has length 48 [2018-01-25 00:13:23,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:13:23,878 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 340 transitions. [2018-01-25 00:13:23,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 00:13:23,878 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 340 transitions. [2018-01-25 00:13:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-25 00:13:23,879 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:13:23,879 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:13:23,880 INFO L371 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-01-25 00:13:23,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1119918648, now seen corresponding path program 1 times [2018-01-25 00:13:23,880 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:13:23,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:23,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:13:23,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:23,881 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:13:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:13:23,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:13:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:13:24,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:13:24,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 00:13:24,350 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:13:24,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 00:13:24,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 00:13:24,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-01-25 00:13:24,351 INFO L87 Difference]: Start difference. First operand 323 states and 340 transitions. Second operand 12 states. [2018-01-25 00:13:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:13:25,063 INFO L93 Difference]: Finished difference Result 335 states and 351 transitions. [2018-01-25 00:13:25,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:13:25,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-01-25 00:13:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:13:25,065 INFO L225 Difference]: With dead ends: 335 [2018-01-25 00:13:25,066 INFO L226 Difference]: Without dead ends: 334 [2018-01-25 00:13:25,066 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-01-25 00:13:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-25 00:13:25,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 323. [2018-01-25 00:13:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-01-25 00:13:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 339 transitions. [2018-01-25 00:13:25,078 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 339 transitions. Word has length 48 [2018-01-25 00:13:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:13:25,079 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 339 transitions. [2018-01-25 00:13:25,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 00:13:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 339 transitions. [2018-01-25 00:13:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-25 00:13:25,080 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:13:25,080 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:13:25,080 INFO L371 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-01-25 00:13:25,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1119918649, now seen corresponding path program 1 times [2018-01-25 00:13:25,081 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:13:25,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:25,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:13:25,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:25,082 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:13:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:13:25,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:13:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:13:25,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:13:25,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 00:13:25,278 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:13:25,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 00:13:25,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 00:13:25,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-25 00:13:25,279 INFO L87 Difference]: Start difference. First operand 323 states and 339 transitions. Second operand 10 states. [2018-01-25 00:13:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:13:25,851 INFO L93 Difference]: Finished difference Result 347 states and 363 transitions. [2018-01-25 00:13:25,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 00:13:25,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-01-25 00:13:25,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:13:25,853 INFO L225 Difference]: With dead ends: 347 [2018-01-25 00:13:25,853 INFO L226 Difference]: Without dead ends: 346 [2018-01-25 00:13:25,854 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-01-25 00:13:25,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-01-25 00:13:25,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 323. [2018-01-25 00:13:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-01-25 00:13:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 338 transitions. [2018-01-25 00:13:25,864 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 338 transitions. Word has length 48 [2018-01-25 00:13:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:13:25,864 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 338 transitions. [2018-01-25 00:13:25,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 00:13:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 338 transitions. [2018-01-25 00:13:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-25 00:13:25,865 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:13:25,865 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:13:25,865 INFO L371 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-01-25 00:13:25,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1300121728, now seen corresponding path program 1 times [2018-01-25 00:13:25,865 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:13:25,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:25,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:13:25,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:13:25,867 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:13:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:13:25,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:13:26,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:13:26,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:13:26,305 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:13:26,305 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-01-25 00:13:26,307 INFO L201 CegarAbsIntRunner]: [74], [78], [84], [88], [96], [97], [98], [104], [108], [114], [118], [126], [127], [135], [139], [147], [148], [156], [160], [168], [169], [172], [180], [184], [190], [193], [282], [286], [288], [291], [293], [294], [295], [300], [302], [305], [306], [309], [310], [311], [316], [318], [321], [324], [331], [494], [495], [623], [641], [642], [643] [2018-01-25 00:13:26,353 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:13:26,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 00:14:11,539 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 00:14:11,540 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 00:14:11,541 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 00:14:11,541 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:14:11,541 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 00:14:11,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:14:11,549 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:14:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:14:11,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:14:11,601 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 00:14:11,601 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 00:14:11,607 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 00:14:11,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 12:14:11 BoogieIcfgContainer [2018-01-25 00:14:11,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 00:14:11,609 INFO L168 Benchmark]: Toolchain (without parser) took 55036.59 ms. Allocated memory was 308.8 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 268.7 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 445.7 MB. Max. memory is 5.3 GB. [2018-01-25 00:14:11,610 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 308.8 MB. Free memory is still 274.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:14:11,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.43 ms. Allocated memory is still 308.8 MB. Free memory was 267.7 MB in the beginning and 255.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-25 00:14:11,611 INFO L168 Benchmark]: Boogie Preprocessor took 48.66 ms. Allocated memory is still 308.8 MB. Free memory was 255.6 MB in the beginning and 252.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:14:11,611 INFO L168 Benchmark]: RCFGBuilder took 992.87 ms. Allocated memory was 308.8 MB in the beginning and 326.6 MB in the end (delta: 17.8 MB). Free memory was 252.6 MB in the beginning and 288.5 MB in the end (delta: -35.9 MB). Peak memory consumption was 73.3 MB. Max. memory is 5.3 GB. [2018-01-25 00:14:11,611 INFO L168 Benchmark]: TraceAbstraction took 53756.66 ms. Allocated memory was 326.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 288.5 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 447.7 MB. Max. memory is 5.3 GB. [2018-01-25 00:14:11,613 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.18 ms. Allocated memory is still 308.8 MB. Free memory is still 274.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 228.43 ms. Allocated memory is still 308.8 MB. Free memory was 267.7 MB in the beginning and 255.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.66 ms. Allocated memory is still 308.8 MB. Free memory was 255.6 MB in the beginning and 252.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 992.87 ms. Allocated memory was 308.8 MB in the beginning and 326.6 MB in the end (delta: 17.8 MB). Free memory was 252.6 MB in the beginning and 288.5 MB in the end (delta: -35.9 MB). Peak memory consumption was 73.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53756.66 ms. Allocated memory was 326.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 288.5 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 447.7 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 578). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 598). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 597). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 588). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 598). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 597). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 588). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 613). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 607). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 607). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 612). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 608). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 612). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 613). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 608). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 625]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 623). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 619). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 619). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 623). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 315 locations, 109 error locations. TIMEOUT Result, 53.6s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4000 SDtfs, 1923 SDslu, 9597 SDs, 0 SdLazy, 6515 SolverSat, 233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 45.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 339 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 374 ConstructedInterpolants, 0 QuantifiedInterpolants, 100314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 21/21 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/merge_sort_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_00-14-11-625.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_00-14-11-625.csv Completed graceful shutdown