java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:24:45,952 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:24:45,954 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:24:45,967 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:24:45,967 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:24:45,968 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:24:45,968 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:24:45,970 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:24:45,972 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:24:45,972 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:24:45,973 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:24:45,973 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:24:45,974 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:24:45,976 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:24:45,977 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:24:45,979 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:24:45,981 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:24:45,983 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:24:45,985 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:24:45,986 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:24:45,988 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:24:45,989 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:24:45,989 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:24:45,990 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:24:45,991 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:24:45,992 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:24:45,992 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:24:45,993 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:24:45,993 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:24:45,993 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:24:45,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:24:45,994 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:24:46,002 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:24:46,003 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:24:46,003 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:24:46,004 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:24:46,004 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:24:46,004 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:24:46,004 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:24:46,004 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:24:46,005 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:24:46,005 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:24:46,005 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:24:46,005 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:24:46,005 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:24:46,005 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:24:46,005 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:24:46,006 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:24:46,006 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:24:46,006 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:24:46,006 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:24:46,006 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:24:46,006 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:24:46,006 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:24:46,007 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:24:46,007 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:24:46,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:24:46,007 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:24:46,007 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:24:46,008 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:24:46,008 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:24:46,008 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:24:46,008 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:24:46,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:24:46,008 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:24:46,008 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:24:46,009 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:24:46,009 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:24:46,042 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:24:46,055 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:24:46,059 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:24:46,061 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:24:46,061 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:24:46,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:24:46,244 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:24:46,250 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:24:46,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:24:46,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:24:46,277 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:24:46,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:24:46" (1/1) ... [2018-01-25 05:24:46,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47ad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:46, skipping insertion in model container [2018-01-25 05:24:46,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:24:46" (1/1) ... [2018-01-25 05:24:46,294 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:24:46,332 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:24:46,452 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:24:46,470 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:24:46,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:46 WrapperNode [2018-01-25 05:24:46,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:24:46,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:24:46,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:24:46,481 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:24:46,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:46" (1/1) ... [2018-01-25 05:24:46,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:46" (1/1) ... [2018-01-25 05:24:46,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:46" (1/1) ... [2018-01-25 05:24:46,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:46" (1/1) ... [2018-01-25 05:24:46,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:46" (1/1) ... [2018-01-25 05:24:46,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:46" (1/1) ... [2018-01-25 05:24:46,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:46" (1/1) ... [2018-01-25 05:24:46,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:24:46,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:24:46,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:24:46,517 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:24:46,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:46" (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 05:24:46,568 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:24:46,568 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:24:46,568 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-01-25 05:24:46,568 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:24:46,569 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:24:46,569 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:24:46,569 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:24:46,569 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:24:46,569 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:24:46,569 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:24:46,569 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-01-25 05:24:46,569 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:24:46,569 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:24:46,570 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:24:46,893 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:24:46,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:24:46 BoogieIcfgContainer [2018-01-25 05:24:46,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:24:46,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:24:46,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:24:46,897 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:24:46,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:24:46" (1/3) ... [2018-01-25 05:24:46,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9c0ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:24:46, skipping insertion in model container [2018-01-25 05:24:46,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:46" (2/3) ... [2018-01-25 05:24:46,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9c0ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:24:46, skipping insertion in model container [2018-01-25 05:24:46,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:24:46" (3/3) ... [2018-01-25 05:24:46,901 INFO L105 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:24:46,910 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:24:46,919 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-25 05:24:46,971 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:24:46,971 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:24:46,971 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:24:46,971 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:24:46,972 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:24:46,972 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:24:46,972 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:24:46,972 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:24:46,973 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:24:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-25 05:24:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:24:46,997 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:24:46,998 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:24:46,998 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:24:47,002 INFO L82 PathProgramCache]: Analyzing trace with hash -456745945, now seen corresponding path program 1 times [2018-01-25 05:24:47,004 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:24:47,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:47,045 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:47,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:47,045 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:24:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:47,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:24:47,244 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 05:24:47,247 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:24:47,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:24:47,247 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:24:47,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:24:47,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:24:47,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:24:47,350 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 4 states. [2018-01-25 05:24:47,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:24:47,509 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2018-01-25 05:24:47,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:24:47,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-25 05:24:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:24:47,520 INFO L225 Difference]: With dead ends: 138 [2018-01-25 05:24:47,520 INFO L226 Difference]: Without dead ends: 74 [2018-01-25 05:24:47,524 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 05:24:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-25 05:24:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-25 05:24:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-25 05:24:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-01-25 05:24:47,562 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 18 [2018-01-25 05:24:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:24:47,563 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-01-25 05:24:47,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:24:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-01-25 05:24:47,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:24:47,564 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:24:47,564 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:24:47,564 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:24:47,564 INFO L82 PathProgramCache]: Analyzing trace with hash -456745944, now seen corresponding path program 1 times [2018-01-25 05:24:47,564 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:24:47,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:47,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:47,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:47,566 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:24:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:47,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:24:47,726 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 05:24:47,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:24:47,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:24:47,727 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:24:47,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:24:47,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:24:47,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:24:47,729 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-01-25 05:24:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:24:48,040 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-01-25 05:24:48,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:24:48,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-25 05:24:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:24:48,044 INFO L225 Difference]: With dead ends: 99 [2018-01-25 05:24:48,044 INFO L226 Difference]: Without dead ends: 96 [2018-01-25 05:24:48,045 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:24:48,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-25 05:24:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-01-25 05:24:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-25 05:24:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-01-25 05:24:48,055 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 18 [2018-01-25 05:24:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:24:48,055 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-01-25 05:24:48,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:24:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-01-25 05:24:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:24:48,056 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:24:48,056 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:24:48,056 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:24:48,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222418, now seen corresponding path program 1 times [2018-01-25 05:24:48,056 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:24:48,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:48,058 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:48,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:48,058 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:24:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:48,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:24:48,131 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 05:24:48,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:24:48,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:24:48,132 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:24:48,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:24:48,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:24:48,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:24:48,133 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 4 states. [2018-01-25 05:24:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:24:48,202 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-01-25 05:24:48,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:24:48,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-25 05:24:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:24:48,204 INFO L225 Difference]: With dead ends: 82 [2018-01-25 05:24:48,204 INFO L226 Difference]: Without dead ends: 80 [2018-01-25 05:24:48,204 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:24:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-25 05:24:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-25 05:24:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-25 05:24:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-01-25 05:24:48,213 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 19 [2018-01-25 05:24:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:24:48,213 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-01-25 05:24:48,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:24:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-01-25 05:24:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:24:48,214 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:24:48,214 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:24:48,214 INFO L371 AbstractCegarLoop]: === Iteration 4 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:24:48,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222417, now seen corresponding path program 1 times [2018-01-25 05:24:48,214 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:24:48,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:48,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:48,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:48,216 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:24:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:48,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:24:48,340 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 05:24:48,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:24:48,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:24:48,340 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:24:48,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:24:48,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:24:48,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:24:48,341 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 8 states. [2018-01-25 05:24:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:24:48,570 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2018-01-25 05:24:48,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:24:48,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-25 05:24:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:24:48,572 INFO L225 Difference]: With dead ends: 99 [2018-01-25 05:24:48,572 INFO L226 Difference]: Without dead ends: 97 [2018-01-25 05:24:48,573 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:24:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-25 05:24:48,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-01-25 05:24:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-25 05:24:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-01-25 05:24:48,584 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 19 [2018-01-25 05:24:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:24:48,585 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-01-25 05:24:48,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:24:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-01-25 05:24:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:24:48,586 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:24:48,586 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:24:48,586 INFO L371 AbstractCegarLoop]: === Iteration 5 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:24:48,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1183954355, now seen corresponding path program 1 times [2018-01-25 05:24:48,587 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:24:48,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:48,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:48,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:48,588 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:24:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:48,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:24:48,669 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 05:24:48,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:24:48,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:24:48,669 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:24:48,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:24:48,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:24:48,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:24:48,670 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 6 states. [2018-01-25 05:24:48,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:24:48,832 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2018-01-25 05:24:48,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:24:48,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-25 05:24:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:24:48,835 INFO L225 Difference]: With dead ends: 181 [2018-01-25 05:24:48,835 INFO L226 Difference]: Without dead ends: 128 [2018-01-25 05:24:48,836 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:24:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-25 05:24:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2018-01-25 05:24:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-25 05:24:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-01-25 05:24:48,854 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 23 [2018-01-25 05:24:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:24:48,854 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-01-25 05:24:48,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:24:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-01-25 05:24:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:24:48,856 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:24:48,856 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] [2018-01-25 05:24:48,856 INFO L371 AbstractCegarLoop]: === Iteration 6 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:24:48,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1662425565, now seen corresponding path program 1 times [2018-01-25 05:24:48,856 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:24:48,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:48,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:48,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:48,858 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:24:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:48,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:24:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:24:48,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:24:48,962 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:24:48,963 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 05:24:48,965 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [10], [15], [16], [18], [19], [23], [126], [129], [133], [134], [141], [142], [143], [145] [2018-01-25 05:24:49,008 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:24:49,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:24:52,221 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:24:52,222 INFO L268 AbstractInterpreter]: Visited 21 different actions 31 times. Merged at 6 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-25 05:24:52,243 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:24:52,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:24:52,243 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 05:24:52,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:52,252 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:24:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:52,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:24:52,355 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 05:24:52,355 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:24:52,387 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 05:24:52,409 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:24:52,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 13 [2018-01-25 05:24:52,409 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:24:52,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:24:52,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:24:52,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:24:52,410 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 7 states. [2018-01-25 05:24:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:24:52,633 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2018-01-25 05:24:52,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:24:52,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-25 05:24:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:24:52,634 INFO L225 Difference]: With dead ends: 165 [2018-01-25 05:24:52,634 INFO L226 Difference]: Without dead ends: 126 [2018-01-25 05:24:52,635 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:24:52,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-25 05:24:52,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 113. [2018-01-25 05:24:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-25 05:24:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-01-25 05:24:52,648 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 23 [2018-01-25 05:24:52,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:24:52,649 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-01-25 05:24:52,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:24:52,649 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-01-25 05:24:52,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:24:52,650 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:24:52,650 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:24:52,650 INFO L371 AbstractCegarLoop]: === Iteration 7 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:24:52,651 INFO L82 PathProgramCache]: Analyzing trace with hash -404393547, now seen corresponding path program 1 times [2018-01-25 05:24:52,651 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:24:52,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:52,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:52,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:52,652 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:24:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:52,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:24:52,760 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 05:24:52,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:24:52,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:24:52,760 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:24:52,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:24:52,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:24:52,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:24:52,761 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 6 states. [2018-01-25 05:24:52,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:24:52,981 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2018-01-25 05:24:52,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:24:52,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-25 05:24:52,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:24:52,982 INFO L225 Difference]: With dead ends: 191 [2018-01-25 05:24:52,982 INFO L226 Difference]: Without dead ends: 117 [2018-01-25 05:24:52,983 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:24:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-25 05:24:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-01-25 05:24:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-25 05:24:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-01-25 05:24:52,994 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 23 [2018-01-25 05:24:52,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:24:52,994 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-01-25 05:24:52,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:24:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-01-25 05:24:52,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:24:52,995 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:24:52,996 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] [2018-01-25 05:24:52,996 INFO L371 AbstractCegarLoop]: === Iteration 8 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:24:52,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1044193829, now seen corresponding path program 1 times [2018-01-25 05:24:52,996 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:24:52,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:52,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:52,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:52,997 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:24:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:53,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:24:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:24:53,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:24:53,225 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:24:53,226 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 05:24:53,226 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [10], [15], [16], [18], [19], [23], [126], [131], [133], [134], [141], [142], [143], [145] [2018-01-25 05:24:53,227 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:24:53,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:24:55,424 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:24:55,424 INFO L268 AbstractInterpreter]: Visited 21 different actions 31 times. Merged at 6 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-25 05:24:55,434 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:24:55,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:24:55,434 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:24:55,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:55,457 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:24:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:55,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:24:55,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:24:55,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:55,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:24:55,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:55,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:24:55,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-25 05:24:55,655 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:24:55,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:24:55,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:24:55,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:55,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-25 05:24:55,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:55,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:24:55,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-25 05:24:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:24:56,047 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:24:56,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:24:56,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:24:56,426 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:24:56,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:56,439 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:24:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:56,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:24:56,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:24:56,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:56,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:24:56,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:56,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:24:56,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-25 05:24:56,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:24:56,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:24:56,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:24:56,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:56,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-25 05:24:56,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:56,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:24:56,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-25 05:24:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:24:56,582 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:24:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:24:56,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:24:56,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 18 [2018-01-25 05:24:56,694 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:24:56,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 05:24:56,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 05:24:56,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-01-25 05:24:56,695 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 12 states. [2018-01-25 05:24:57,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:24:57,062 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-01-25 05:24:57,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:24:57,063 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-01-25 05:24:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:24:57,063 INFO L225 Difference]: With dead ends: 117 [2018-01-25 05:24:57,064 INFO L226 Difference]: Without dead ends: 112 [2018-01-25 05:24:57,064 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2018-01-25 05:24:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-25 05:24:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2018-01-25 05:24:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-25 05:24:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-01-25 05:24:57,072 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 23 [2018-01-25 05:24:57,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:24:57,072 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-01-25 05:24:57,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 05:24:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-01-25 05:24:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:24:57,074 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:24:57,074 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:24:57,074 INFO L371 AbstractCegarLoop]: === Iteration 9 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:24:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash 186672598, now seen corresponding path program 1 times [2018-01-25 05:24:57,074 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:24:57,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:57,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:57,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:57,076 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:24:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:57,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:24:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:24:57,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:24:57,184 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:24:57,184 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 05:24:57,184 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [10], [13], [15], [16], [19], [23], [27], [31], [36], [40], [45], [48], [126], [131], [133], [134], [141], [142], [143], [145] [2018-01-25 05:24:57,185 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:24:57,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:25:00,039 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:25:00,039 INFO L268 AbstractInterpreter]: Visited 27 different actions 49 times. Merged at 12 different actions 22 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-25 05:25:00,040 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:25:00,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:00,040 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:25:00,045 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:00,045 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:25:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:00,059 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:00,078 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:00,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:00,124 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:25:00,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:00,130 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:25:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:00,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:00,175 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:00,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:25:00,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 9 [2018-01-25 05:25:00,195 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:25:00,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:25:00,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:25:00,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:25:00,196 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 8 states. [2018-01-25 05:25:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:00,302 INFO L93 Difference]: Finished difference Result 222 states and 246 transitions. [2018-01-25 05:25:00,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:25:00,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-25 05:25:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:00,304 INFO L225 Difference]: With dead ends: 222 [2018-01-25 05:25:00,304 INFO L226 Difference]: Without dead ends: 176 [2018-01-25 05:25:00,305 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:25:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-25 05:25:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 124. [2018-01-25 05:25:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-25 05:25:00,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-01-25 05:25:00,316 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 28 [2018-01-25 05:25:00,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:00,317 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-01-25 05:25:00,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:25:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-01-25 05:25:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:25:00,318 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:00,318 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 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] [2018-01-25 05:25:00,318 INFO L371 AbstractCegarLoop]: === Iteration 10 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:00,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1928191573, now seen corresponding path program 2 times [2018-01-25 05:25:00,319 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:00,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:00,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:00,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:00,320 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:00,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:00,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:00,728 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:25:00,728 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:25:00,728 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:25:00,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:00,728 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:25:00,733 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:25:00,733 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:25:00,744 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:25:00,746 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:25:00,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:00,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:25:00,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:00,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:25:00,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:00,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:00,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-25 05:25:00,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:25:00,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-25 05:25:00,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:00,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:25:00,865 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:25:00,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-25 05:25:00,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:00,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 05:25:00,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:35 [2018-01-25 05:25:00,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:25:00,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:25:00,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-01-25 05:25:00,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:00,925 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:25:00,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:25:00,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:25:00,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:25:00,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:00,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-25 05:25:00,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2018-01-25 05:25:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-25 05:25:01,100 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:01,752 WARN L143 SmtUtils]: Spent 218ms on a formula simplification that was a NOOP. DAG size: 53 [2018-01-25 05:25:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-25 05:25:01,791 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:25:01,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [13] total 27 [2018-01-25 05:25:01,792 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:01,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:25:01,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:25:01,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2018-01-25 05:25:01,792 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 10 states. [2018-01-25 05:25:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:02,273 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-01-25 05:25:02,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:25:02,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-01-25 05:25:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:02,319 INFO L225 Difference]: With dead ends: 124 [2018-01-25 05:25:02,319 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 05:25:02,319 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2018-01-25 05:25:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 05:25:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-01-25 05:25:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-25 05:25:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2018-01-25 05:25:02,333 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 33 [2018-01-25 05:25:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:02,333 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2018-01-25 05:25:02,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:25:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2018-01-25 05:25:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 05:25:02,334 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:02,334 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 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] [2018-01-25 05:25:02,334 INFO L371 AbstractCegarLoop]: === Iteration 11 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash -355603392, now seen corresponding path program 1 times [2018-01-25 05:25:02,334 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:02,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:02,335 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:25:02,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:02,335 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:02,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:02,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-25 05:25:02,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:02,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:25:02,495 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:02,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:25:02,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:25:02,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:25:02,496 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 9 states. [2018-01-25 05:25:02,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:02,816 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2018-01-25 05:25:02,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:25:02,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-25 05:25:02,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:02,818 INFO L225 Difference]: With dead ends: 159 [2018-01-25 05:25:02,818 INFO L226 Difference]: Without dead ends: 158 [2018-01-25 05:25:02,818 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:25:02,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-25 05:25:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 125. [2018-01-25 05:25:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-25 05:25:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-01-25 05:25:02,839 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 34 [2018-01-25 05:25:02,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:02,839 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-01-25 05:25:02,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:25:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-01-25 05:25:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 05:25:02,841 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:02,841 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 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] [2018-01-25 05:25:02,841 INFO L371 AbstractCegarLoop]: === Iteration 12 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:02,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1116063411, now seen corresponding path program 1 times [2018-01-25 05:25:02,841 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:02,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:02,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:02,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:02,843 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:02,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-25 05:25:02,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:02,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:25:02,889 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:02,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:25:02,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:25:02,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:25:02,890 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 3 states. [2018-01-25 05:25:02,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:02,911 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2018-01-25 05:25:02,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:25:02,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-01-25 05:25:02,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:02,913 INFO L225 Difference]: With dead ends: 173 [2018-01-25 05:25:02,913 INFO L226 Difference]: Without dead ends: 126 [2018-01-25 05:25:02,914 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 05:25:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-25 05:25:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-01-25 05:25:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-25 05:25:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-01-25 05:25:02,930 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 38 [2018-01-25 05:25:02,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:02,931 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-01-25 05:25:02,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:25:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-01-25 05:25:02,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 05:25:02,933 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:02,933 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 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] [2018-01-25 05:25:02,933 INFO L371 AbstractCegarLoop]: === Iteration 13 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:02,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1116072442, now seen corresponding path program 1 times [2018-01-25 05:25:02,933 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:02,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:02,934 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:02,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:02,934 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:02,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-25 05:25:03,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:03,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:25:03,059 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:03,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:25:03,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:25:03,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:25:03,060 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 11 states. [2018-01-25 05:25:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:03,286 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2018-01-25 05:25:03,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 05:25:03,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-25 05:25:03,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:03,287 INFO L225 Difference]: With dead ends: 127 [2018-01-25 05:25:03,287 INFO L226 Difference]: Without dead ends: 125 [2018-01-25 05:25:03,288 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-01-25 05:25:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-25 05:25:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-01-25 05:25:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-25 05:25:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-01-25 05:25:03,300 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 38 [2018-01-25 05:25:03,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:03,300 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-01-25 05:25:03,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:25:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-01-25 05:25:03,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 05:25:03,302 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:03,302 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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] [2018-01-25 05:25:03,302 INFO L371 AbstractCegarLoop]: === Iteration 14 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:03,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1390751146, now seen corresponding path program 1 times [2018-01-25 05:25:03,302 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:03,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:03,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:03,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:03,303 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:03,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-25 05:25:03,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:25:03,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 05:25:03,375 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:25:03,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:25:03,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:25:03,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:25:03,376 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 9 states. [2018-01-25 05:25:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:03,505 INFO L93 Difference]: Finished difference Result 189 states and 211 transitions. [2018-01-25 05:25:03,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:25:03,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-01-25 05:25:03,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:03,506 INFO L225 Difference]: With dead ends: 189 [2018-01-25 05:25:03,506 INFO L226 Difference]: Without dead ends: 143 [2018-01-25 05:25:03,507 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:25:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-25 05:25:03,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-01-25 05:25:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-25 05:25:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2018-01-25 05:25:03,526 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 42 [2018-01-25 05:25:03,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:03,526 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2018-01-25 05:25:03,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:25:03,526 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2018-01-25 05:25:03,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-25 05:25:03,527 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:03,527 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] [2018-01-25 05:25:03,528 INFO L371 AbstractCegarLoop]: === Iteration 15 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:25:03,528 INFO L82 PathProgramCache]: Analyzing trace with hash -363955689, now seen corresponding path program 1 times [2018-01-25 05:25:03,528 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:03,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:03,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:03,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:03,529 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:03,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:25:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:03,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:03,926 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:25:03,926 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-25 05:25:03,926 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [10], [13], [15], [16], [19], [23], [27], [31], [34], [90], [94], [97], [99], [100], [111], [113], [117], [118], [119], [120], [121], [122], [126], [129], [133], [134], [136], [137], [138], [140], [141], [142], [143], [145], [146] [2018-01-25 05:25:03,928 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:25:03,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:25:13,295 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:25:13,295 INFO L268 AbstractInterpreter]: Visited 42 different actions 138 times. Merged at 22 different actions 88 times. Widened at 1 different actions 2 times. Found 10 fixpoints after 3 different actions. Largest state had 31 variables. [2018-01-25 05:25:13,302 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:25:13,302 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:13,302 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:25:13,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:13,308 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:25:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:13,324 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:13,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:25:13,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:25:13,361 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:25:13,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:25:13,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:25:13,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-25 05:25:13,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 05:25:13,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-25 05:25:13,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-25 05:25:13,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-25 05:25:13,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:25:13,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 05:25:13,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-01-25 05:25:13,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-25 05:25:13,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-25 05:25:13,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-25 05:25:13,480 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,484 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2018-01-25 05:25:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:13,501 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:13,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-01-25 05:25:13,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 05:25:13,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-01-25 05:25:13,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-25 05:25:13,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-25 05:25:13,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-01-25 05:25:13,615 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-25 05:25:13,618 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:25:13,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-01-25 05:25:13,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-01-25 05:25:13,647 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:43, output treesize:37 [2018-01-25 05:25:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:13,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:13,794 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:25:13,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:13,800 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:25:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:13,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:13,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:25:13,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:25:13,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:25:14,027 WARN L1029 $PredicateComparison]: unable to prove that (and (not (= 0 |c_lis_#t~malloc1.base|)) (exists ((|lis_#t~malloc0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |lis_#t~malloc0.base| 1))) (and (= 0 (select .cse0 |c_lis_#t~malloc1.base|)) (= |c_#valid| (store (store .cse0 |c_lis_#t~malloc1.base| 1) |lis_#t~malloc0.base| 0)) (= (select |c_old(#valid)| |lis_#t~malloc0.base|) 0) (not (= 0 |lis_#t~malloc0.base|)))))) is different from true [2018-01-25 05:25:14,033 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|lis_#t~malloc1.base| Int) (|lis_#t~malloc0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |lis_#t~malloc0.base| 1))) (and (= 0 (select .cse0 |lis_#t~malloc1.base|)) (not (= 0 |lis_#t~malloc1.base|)) (= (select |c_old(#valid)| |lis_#t~malloc0.base|) 0) (not (= 0 |lis_#t~malloc0.base|)) (= |c_#valid| (store (store (store .cse0 |lis_#t~malloc1.base| 1) |lis_#t~malloc0.base| 0) |lis_#t~malloc1.base| 0))))) is different from true [2018-01-25 05:25:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 05:25:14,154 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:14,216 WARN L1007 $PredicateComparison]: unable to prove that (forall ((v_lis_~prev~2.base_26 Int) (v_lis_~best~2.base_39 Int)) (let ((.cse0 (store |c_#valid| v_lis_~best~2.base_39 1))) (or (not (= 0 (select .cse0 v_lis_~prev~2.base_26))) (= (store (store (store (store .cse0 v_lis_~prev~2.base_26 1) v_lis_~best~2.base_39 0) v_lis_~prev~2.base_26 0) |c_main_#t~malloc19.base| 0) |c_old(#valid)|) (= v_lis_~prev~2.base_26 0) (not (= (select |c_#valid| v_lis_~best~2.base_39) 0)) (= v_lis_~best~2.base_39 0)))) is different from false [2018-01-25 05:25:14,221 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_6| term size 31 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-25 05:25:14,249 INFO L168 Benchmark]: Toolchain (without parser) took 28004.50 ms. Allocated memory was 294.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 254.2 MB in the beginning and 964.7 MB in the end (delta: -710.5 MB). Peak memory consumption was 460.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:14,250 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 294.1 MB. Free memory is still 260.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:25:14,250 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.82 ms. Allocated memory is still 294.1 MB. Free memory was 253.2 MB in the beginning and 242.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:14,251 INFO L168 Benchmark]: Boogie Preprocessor took 36.46 ms. Allocated memory is still 294.1 MB. Free memory was 242.9 MB in the beginning and 240.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:14,251 INFO L168 Benchmark]: RCFGBuilder took 376.49 ms. Allocated memory is still 294.1 MB. Free memory was 240.9 MB in the beginning and 217.2 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:14,251 INFO L168 Benchmark]: TraceAbstraction took 27353.95 ms. Allocated memory was 294.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 217.2 MB in the beginning and 964.7 MB in the end (delta: -747.5 MB). Peak memory consumption was 423.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:14,253 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.20 ms. Allocated memory is still 294.1 MB. Free memory is still 260.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.82 ms. Allocated memory is still 294.1 MB. Free memory was 253.2 MB in the beginning and 242.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.46 ms. Allocated memory is still 294.1 MB. Free memory was 242.9 MB in the beginning and 240.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 376.49 ms. Allocated memory is still 294.1 MB. Free memory was 240.9 MB in the beginning and 217.2 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 27353.95 ms. Allocated memory was 294.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 217.2 MB in the beginning and 964.7 MB in the end (delta: -747.5 MB). Peak memory consumption was 423.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 273 LocStat_NO_SUPPORTING_DISEQUALITIES : 63 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 56 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 27.383962 RENAME_VARIABLES(MILLISECONDS) : 6.011142 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 13.449244 PROJECTAWAY(MILLISECONDS) : 0.553372 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.097319 DISJOIN(MILLISECONDS) : 5.556471 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 6.125397 ADD_EQUALITY(MILLISECONDS) : 0.061255 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016343 #CONJOIN_DISJUNCTIVE : 59 #RENAME_VARIABLES : 94 #UNFREEZE : 0 #CONJOIN : 101 #PROJECTAWAY : 77 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 89 #ADD_EQUALITY : 58 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 265 LocStat_NO_SUPPORTING_DISEQUALITIES : 63 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 57 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 17.437092 RENAME_VARIABLES(MILLISECONDS) : 4.068146 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 8.663656 PROJECTAWAY(MILLISECONDS) : 0.240716 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.085777 DISJOIN(MILLISECONDS) : 3.737852 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 4.115561 ADD_EQUALITY(MILLISECONDS) : 0.042695 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008275 #CONJOIN_DISJUNCTIVE : 59 #RENAME_VARIABLES : 94 #UNFREEZE : 0 #CONJOIN : 101 #PROJECTAWAY : 77 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 89 #ADD_EQUALITY : 59 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 446 LocStat_NO_SUPPORTING_DISEQUALITIES : 105 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 60 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 27.586347 RENAME_VARIABLES(MILLISECONDS) : 3.269421 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 13.896126 PROJECTAWAY(MILLISECONDS) : 0.258527 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.034903 DISJOIN(MILLISECONDS) : 3.212051 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 3.294537 ADD_EQUALITY(MILLISECONDS) : 0.019465 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005864 #CONJOIN_DISJUNCTIVE : 90 #RENAME_VARIABLES : 154 #UNFREEZE : 0 #CONJOIN : 132 #PROJECTAWAY : 113 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 149 #ADD_EQUALITY : 62 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 40 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 699 LocStat_NO_SUPPORTING_DISEQUALITIES : 171 LocStat_NO_DISJUNCTIONS : -80 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 48 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 69 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 48 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 5.391834 RENAME_VARIABLES(MILLISECONDS) : 0.013448 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 5.101227 PROJECTAWAY(MILLISECONDS) : 72.789103 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.052282 DISJOIN(MILLISECONDS) : 3.089318 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.039423 ADD_EQUALITY(MILLISECONDS) : 0.025708 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007060 #CONJOIN_DISJUNCTIVE : 221 #RENAME_VARIABLES : 439 #UNFREEZE : 0 #CONJOIN : 301 #PROJECTAWAY : 292 #ADD_WEAK_EQUALITY : 14 #DISJOIN : 33 #RENAME_VARIABLES_DISJUNCTIVE : 439 #ADD_EQUALITY : 71 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_6| term size 31 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_6| term size 31: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-25-14-266.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-25-14-266.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-25-14-266.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-25-14-266.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-25-14-266.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-25-14-266.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-25-14-266.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_05-25-14-266.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_05-25-14-266.csv Received shutdown request...